Searcharxiv⌕ Search

arXiv subjects

Qi Xiong

Publications and source records attributed to Qi Xiong.

At least 37 records · Page 2Linked to original sources

Forecasting the Constraint on the Hu-Sawicki $f(R)$ Modified Gravity in the CSST $3\times2$pt Photometric Survey

We forecast the constraint on the Hu-Sawicki $f(R)$ model from the photometric survey operated by the Chinese Space Station Survey Telescope (CSST). The simulated $3\times2$pt data of galaxy clustering, weak lensing, and galaxy-galaxy lensing measurements within 100 deg$^{2}$ are used in the analysis. The mock observational maps are constructed from a light cone, redshift sampling and noise. The angular power spectra are measured with pseudo-$C_\ell$ estimators and compared to theory in the same basis using validated weighting functions and an analytic covariance matrix that includes Gaussian, connected non-Gaussian, and super-sample terms. We model the theoretical spectra using two methods. The first one uses MGCAMB to compute the linear modified-gravity clustering power spectra, and the second one adopts the FREmu emulator with a baseline of nonlinear $Λ$CDM prescription. Parameter inference is performed with Cobaya, and the cosmological and modified-gravity parameters are sampled within the emulator training domain, which is jointly fitted with the systematic parameters. We find that the predictions from the two methods are in good agreement at the overlapping large scales, and the emulator method can correctly provide additional high-$\ell$ information. The $1σ$ upper bounds of $\log_{10}|f_{R0}|$ are found to be $<-5.42$ for cosmic shear only case and $<-5.29$ for the 100 deg$^2$ CSST $3\times2$pt probe. The full CSST photometric survey with 17,500 deg$^2$ survey area is expected to further improve the constraint precision by about one order of magnitude. Our results demonstrate that the CSST $3\times2$pt survey can deliver strict tests on $f(R)$ gravity.

astro-ph.CO↗

Universal Potential Estimates for Mixed Local and Nonlocal Nonlinear Measure Data Problems

This paper presents the nonlinear potential theory for mixed local and nonlocal $p$-Laplace type equations with coefficients and measure data, involving both superquadratic and subquadratic cases. We prove a class of universal pointwise estimates for the solution and its gradient via Riesz and Wolff potentials. These are achieved by imposing various low regularity conditions on the coefficient of the local term, while the kernel coefficient for the nonlocal term is merely assumed to be measurable. The key to these proofs lies in introducing a novel fractional maximum function that can capture both local and nonlocal features simultaneously, and in establishing pointwise estimates for such maximum operators of the solution and its gradient. Notably, our universal potential estimates not only precisely characterize the oscillations of solutions, but also identify the borderline case that bounds their size, thereby refining the pointwise potential estimates available in earlier work.

math.AP↗

Modeling Temporal Dependencies within the Target for Long-Term Time Series Forecasting

Long-term time series forecasting (LTSF) is a critical task across diverse domains. Despite significant advancements in LTSF research, we identify a performance bottleneck in existing LTSF methods caused by the inadequate modeling of Temporal Dependencies within the Target (TDT). To address this issue, we propose a novel and generic temporal modeling framework, Temporal Dependency Alignment (TDAlign), that equips existing LTSF methods with TDT learning capabilities. TDAlign introduces two key innovations: 1) a loss function that aligns the change values between adjacent time steps in the predictions with those in the target, ensuring consistency with variation patterns, and 2) an adaptive loss balancing strategy that seamlessly integrates the new loss function with existing LTSF methods without introducing additional learnable parameters. As a plug-and-play framework, TDAlign enhances existing methods with minimal computational overhead, featuring only linear time complexity and constant space complexity relative to the prediction length. Extensive experiments on six strong LTSF baselines across seven real-world datasets demonstrate the effectiveness and flexibility of TDAlign. On average, TDAlign reduces baseline prediction errors by \textbf{1.47\%} to \textbf{9.19\%} and change value errors by \textbf{4.57\%} to \textbf{15.78\%}, highlighting its substantial performance improvements.

cs.LG↗

FedLAD: A Linear Algebra Based Data Poisoning Defence for Federated Learning

Sybil attacks pose a significant threat to federated learning, as malicious nodes can collaborate and gain a majority, thereby overwhelming the system. Therefore, it is essential to develop countermeasures that ensure the security of federated learning environments. We present a novel defence method against targeted data poisoning, which is one of the types of Sybil attacks, called Linear Algebra-based Detection (FedLAD). Unlike existing approaches, such as clustering and robust training, which struggle in situations where malicious nodes dominate, FedLAD models the federated learning aggregation process as a linear problem, transforming it into a linear algebra optimisation challenge. This method identifies potential attacks by extracting the independent linear combinations from the original linear combinations, effectively filtering out redundant and malicious elements. Extensive experimental evaluations demonstrate the effectiveness of FedLAD compared to five well-established defence methods: Sherpa, CONTRA, Median, Trimmed Mean, and Krum. Using tasks from both image classification and natural language processing, our experiments confirm that FedLAD is robust and not dependent on specific application settings. The results indicate that FedLAD effectively protects federated learning systems across a broad spectrum of malicious node ratios. Compared to baseline defence methods, FedLAD maintains a low attack success rate for malicious nodes when their ratio ranges from 0.2 to 0.8. Additionally, it preserves high model accuracy when the malicious node ratio is between 0.2 and 0.5. These findings underscore FedLAD's potential to enhance both the reliability and performance of federated learning systems in the face of data poisoning attacks.

cs.LG↗

GalaxyGenius: Mock galaxy image generator for various telescopes from hydrodynamical simulations

We introduce GalaxyGenius, a Python package designed to produce synthetic galaxy images tailored to different telescopes based on hydrodynamical simulations. Its implementation will support and advance research on galaxies in the era of large-scale sky surveys. The package comprises three main modules: data preprocessing, ideal data cube generation, and mock observation. Specifically, the preprocessing module extracts necessary properties of star and gas particles for a selected subhalo from hydrodynamical simulations and creates the execution file for the following radiative transfer procedure. Subsequently, building on the above information, the ideal data cube generation module executes a widely used radiative transfer project, specifically the SKIRT, to perform the SED assignment for each particle and the radiative transfer procedure to produce an IFU-like ideal data cube. Lastly, the mock observation module takes the ideal data cube and applies the throughputs of aiming telescopes, while also incorporating the relevant instrumental effects, point spread functions (PSFs), and background noise to generate the required mock observational images of galaxies. To showcase the outcomes of GalaxyGenius, we created a series of mock images of galaxies based on the IllustrisTNG and EAGLE simulations for both space and ground-based surveys, spanning ultraviolet (UV) to infrared (IR) wavelength coverage, including CSST, Euclid, HST, JWST, Roman, and HSC. GalaxyGenius offers a flexible framework to generate mock galaxy images with customizable recipes. These generated images can serve as valuable references for verifying and validating new approaches in astronomical research. They can also serve as training sets for relevant studies using deep learning in cases where real observational data are insufficient.

astro-ph.IM↗

CoIFNet: A Unified Framework for Multivariate Time Series Forecasting with Missing Values

Multivariate time series forecasting (MTSF) is a critical task with broad applications in domains such as meteorology, transportation, and economics. Nevertheless, pervasive missing values caused by sensor failures or human errors significantly degrade forecasting accuracy. Prior efforts usually employ an impute-then-forecast paradigm, leading to suboptimal predictions due to error accumulation and misaligned objectives between the two stages. To address this challenge, we propose the Collaborative Imputation-Forecasting Network (CoIFNet), a novel framework that unifies imputation and forecasting to achieve robust MTSF in the presence of missing values. Specifically, CoIFNet takes the observed values, mask matrix and timestamp embeddings as input, processing them sequentially through the Cross-Timestep Fusion (CTF) and Cross-Variate Fusion (CVF) modules to capture temporal dependencies that are robust to missing values. We provide theoretical justifications on how our CoIFNet learning objective improves the performance bound of MTSF with missing values. Through extensive experiments on challenging MSTF benchmarks, we demonstrate the effectiveness and computational efficiency of our proposed approach across diverse missing-data scenarios, e.g., CoIFNet outperforms the state-of-the-art method by $\underline{\textbf{24.40}}$% ($\underline{\textbf{23.81}}$%) at a point (block) missing rate of 0.6, while improving memory and time efficiency by $\underline{\boldsymbol{4.3\times}}$ and $\underline{\boldsymbol{2.1\times}}$, respectively. Our code is available at: https://github.com/KaiTang-eng/CoIFNet.

cs.LG↗

Exploring cosmological constraints of the weak gravitational lensing and galaxy clustering joint analysis in the CSST photometric survey

We explore the joint weak lensing and galaxy clustering analysis from the photometric survey operated by the China Space Station Telescope (CSST), and study the strength of the cosmological constraints. We employ a high-resolution JiuTian-1G simulation to construct a partial-sky light cone to $z=3$ covering 100 deg$^2$, and obtain the CSST galaxy mock samples based on an improved semi-analytical model. We perform a multi-lens-plane algorithm to generate corresponding synthetic weak lensing maps and catalogs. Then we generate the mock data based on these catalogs considering the instrumental and observational effects of the CSST, and use the Markov Chain Monte Carlo (MCMC) method to perform the constraints. The covariance matrix includes non-Gaussian contributions and super-sample covariance terms, and the systematics from intrinsic alignments, galaxy bias, photometric redshift uncertainties, shear calibration, and non-linear effects are considered in the analysis. We find that the constraint result is comparable to that from Stage III surveys, and it can be significantly improved further in the full CSST survey with 17500 deg$^2$. This indicates the CSST photometric survey is powerful for exploring the Universe.

astro-ph.CO↗

Future Cosmology: New Physics and Opportunity from the China Space Station Telescope (CSST)

The China Space Station Telescope (CSST) is the next-generation Stage~IV survey telescope. It can simultaneously perform multi-band imaging and slitless spectroscopic wide- and deep-field surveys in ten years and an ultra-deep field (UDF) survey in two years, which are suitable for cosmological studies. Here we review several CSST cosmological probes, such as weak gravitational lensing, two-dimensional (2D) and three-dimensional (3D) galaxy clustering, galaxy cluster abundance, cosmic void, Type Ia supernovae (SNe Ia), and baryonic acoustic oscillations (BAO), and explore their capabilities and prospects in discovering new physics and opportunities in cosmology. We find that CSST will measure the matter distribution from small to large scales and the expansion history of the Universe with extremely high accuracy, which can provide percent-level stringent constraints on the properties of dark energy and dark matter and precisely test the theories of gravity.

astro-ph.CO↗

2D watershed void clustering for probing the cosmic large-scale structure

Cosmic void has been proven to be an effective cosmological probe of the large-scale structure (LSS). However, since voids are usually identified in spectroscopic galaxy surveys, they are generally limited to low number density and redshift. We propose to utilize the clustering of two-dimensional (2D) voids identified using Voronoi tessellation and watershed algorithm without any shape assumption to explore the LSS. We generate mock galaxy and void catalogs for the next-generation Stage IV photometric surveys in $z = 0.8-2.0$ from simulations, develop the 2D void identification method, and construct the theoretical model to fit the 2D watershed void and galaxy angular power spectra. We find that our method can accurately extract the cosmological information, and the constraint accuracies of some cosmological parameters from the 2D watershed void clustering are even comparable to the galaxy angular clustering case, which can be further improved by as large as $\sim30\%$ in the void and galaxy joint constraints. This indicates that the 2D void clustering is a good complement to galaxy angular clustering measurements, especially for the forthcoming Stage IV surveys that detect high-redshift universe.

astro-ph.CO↗

RTLSquad: Multi-Agent Based Interpretable RTL Design

Optimizing Register-Transfer Level (RTL) code is crucial for improving hardware PPA performance. Large Language Models (LLMs) offer new approaches for automatic RTL code generation and optimization. However, existing methods often lack decision interpretability (sufficient, understandable justification for decisions), making it difficult for hardware engineers to trust the generated results, thus preventing these methods from being integrated into the design process. To address this, we propose RTLSquad, a novel LLM-Based Multi-Agent system for interpretable RTL code generation. RTLSquad divides the design process into exploration, implementation, and verification & evaluation stages managed by specialized agent squads, generating optimized RTL code through inter-agent collaboration, and providing decision interpretability through the communication process. Experiments show that RTLSquad excels in generating functionally correct RTL code and optimizing PPA performance, while also having the capability to provide decision paths, demonstrating the practical value of our system.

cs.AR↗

Cosmological Prediction of the Void and Galaxy Clustering Measurements in the CSST Spectroscopic Survey

The void power spectrum is related to the clustering of low-density regions in the large-scale structure (LSS) of the Universe, and can be used as an effective cosmological probe to extract the information of the LSS. We generate the galaxy mock catalogs from Jiutian simulation, and identify voids using the watershed algorithm for studying the cosmological constraint strength of the China Space Station Telescope (CSST) spectroscopic survey. The galaxy and void auto power spectra and void-galaxy cross power spectra at $z=0.3$, 0.6, and 0.9 are derived from the mock catalogs. To fit the full power spectra, we propose to use the void average effective radius at a given redshift to simplify the theoretical model, and adopt the Markov Chain Monte Carlo (MCMC) technique to implement the constraints on the cosmological and void parameters. The systematical parameters, such as galaxy and void biases, and noise terms in the power spectra are also included in the fitting process. We find that our theoretical model can correctly extract the cosmological information from the galaxy and void power spectra, which demonstrates its feasibility and effectivity. The joint constraint accuracy of the cosmological parameters can be improved by $\sim20\%$ compared to that from the galaxy power spectrum only. The fitting results of the void density profile and systematical parameters are also well constrained and consistent with the expectation. This indicates that the void clustering measurement can be an effective complement to the galaxy clustering probe, especially for the next generation galaxy surveys.

astro-ph.CO↗

Rényi Divergence Deep Mutual Learning

This paper revisits Deep Mutual Learning (DML), a simple yet effective computing paradigm. We propose using Rényi divergence instead of the KL divergence, which is more flexible and tunable, to improve vanilla DML. This modification is able to consistently improve performance over vanilla DML with limited additional complexity. The convergence properties of the proposed paradigm are analyzed theoretically, and Stochastic Gradient Descent with a constant learning rate is shown to converge with $\mathcal{O}(1)$-bias in the worst case scenario for nonconvex optimization tasks. That is, learning will reach nearby local optima but continue searching within a bounded scope, which may help mitigate overfitting. Finally, our extensive empirical results demonstrate the advantage of combining DML and Rényi divergence, leading to further improvement in model generalization.

cs.LG↗

Void Number Counts as a Cosmological Probe for the Large-Scale Structure

Void number counts (VNC) indicates the number of low-density regions in the large-scale structure (LSS) of the Universe, and we propose to use it as an effective cosmological probe. By generating the galaxy mock catalog based on Jiutian simulations and considering the spectroscopic survey strategy and instrumental design of the China Space Station Telescope (CSST), which can reach a magnitude limit $\sim$23 AB mag and spectral resolution $R\gtrsim200$ with a sky coverage 17,500 deg$^2$, we identify voids using the watershed algorithm without any assumption of void shape, and obtain the mock void catalog and data of the VNC in six redshift bins from $z=0.3$ to1.3. We use the Markov Chain Monte Carlo (MCMC) method to constrain the cosmological and VNC parameters. The void linear underdensity threshold $δ_{\rm v}$ in the theoretical model is set to be a free parameter at a given redshift to fit the VNC data and explore its redshift evolution. We find that, the VNC can correctly derive the cosmological information, and the constraint strength on the cosmological parameters is comparable to that from the void size function (VSF) method, which can reach a few percentage levels in the CSST full spectroscopic survey. This is because that, since the VNC is not sensitive to void shape, the modified theoretical model can match the data better by integrating over void features, and more voids could be included in the VNC analysis by applying simpler selection criteria, which will improve the statistical significance. It indicates that the VNC can be an effective cosmological probe for exploring the LSS.

astro-ph.CO↗

A Prior Embedding-Driven Architecture for Long Distance Blind Iris Recognition

Blind iris images, which result from unknown degradation during the process of iris recognition at long distances, often lead to decreased iris recognition rates. Currently, little existing literature offers a solution to this problem. In response, we propose a prior embedding-driven architecture for long distance blind iris recognition. We first proposed a blind iris image restoration network called Iris-PPRGAN. To effectively restore the texture of the blind iris, Iris-PPRGAN includes a Generative Adversarial Network (GAN) used as a Prior Decoder, and a DNN used as the encoder. To extract iris features more efficiently, we then proposed a robust iris classifier by modifying the bottleneck module of InsightFace, which called Insight-Iris. A low-quality blind iris image is first restored by Iris-PPRGAN, then the restored iris image undergoes recognition via Insight-Iris. Experimental results on the public CASIA-Iris-distance dataset demonstrate that our proposed method significantly superior results to state-of-the-art blind iris restoration methods both quantitatively and qualitatively, Specifically, the recognition rate for long-distance blind iris images reaches 90% after processing with our methods, representing an improvement of approximately ten percentage points compared to images without restoration.

cs.CV↗

Pointwise and Oscillation Estimates via Riesz Potentials for Mixed Local and Nonlocal Parabolic Equations

We establish a class of pointwise estimates for weak solutions to mixed local and nonlocal parabolic equations involving measure data and merely measurable coefficients via caloric Riesz potentials. Such estimates effectively bound the sizes and oscillations of weak solutions, respectively. The proof relies on demonstrating a new local Hölder estimate with an optimal $L^q$-Tail for weak solutions to the corresponding homogeneous problem, which remarkably extends the $L^\infty$-Tail in previous work. It is worth mentioning that our main results capture both local and nonlocal features of the double phase parabolic equations and, more importantly, remain valid for SOLA (Solutions Obtained by Limit of Approximations).

math.AP↗

Cosmological Forecast of the Void Size Function Measurement from the CSST Spectroscopic Survey

Void size function (VSF) contains information of the cosmic large-scale structure (LSS), and can be used to derive the properties of dark energy and dark matter. We predict the VSFs measured from the spectroscopic galaxy survey operated by the China Space Station Telescope (CSST), and study the strength of cosmological constraint. We employ a high-resolution Jiutian simulation to get CSST galaxy mock samples based on an improved semi-analytical model. We identify voids from this galaxy catalog using the watershed algorithm without assuming a spherical shape, and estimate the VSFs at different redshift bins from $z=0.5$ to 1.1. We propose a void selection method based on the ellipticity, and assume the void linear underdensity threshold $δ_{\rm v}$ in the theoretical model is redshift-dependent and set it as a free parameter in each redshift bin. The Markov Chain Monte Carlo (MCMC) method is adopted to implement the constraints on the cosmological and void parameters. We find that the CSST VSF measurement can constrain the cosmological parameters to a few percent level. The best-fit values of $δ_{\rm v}$ are ranging from $\sim-0.4$ to $-0.1$ as the redshift increases from 0.5 to 1.1, which has a distinct difference from the theoretical calculation with $δ_{\rm v}\simeq-2.7$ assuming the spherical evolution and using particles as tracer. Our method can provide a good reference for void identification and selection in the VSF analysis of the spectroscopic galaxy surveys.

astro-ph.CO↗

Gradient potential estimates for elliptic double obstacle problems with Orlicz growth

In this paper,we consider the solutions of the elliptic double obstacle problems with Orlicz growth involving measure data. Some pointwise estimates for the approximable solutions to these problems are obtained in terms of fractional maximal operators. Furthermore, we establish pointwise and oscillation estimates for the gradients of solutions via the non-linear Wolff potentials, which in turn yield $C^{1,α}$-regularity of solutions.

math.AP↗

Hölder Continuity for Fully Fractional Parabolic Equations with Space-time Nonlocal Operators

We study the local Hölder regularity of weak solutions to the fully fractional parabolic equations involving spatial fractional diffusion and fractional time derivatives of the Marchaud type. It is worth noting that we do not impose boundedness assumptions on the weak solutions and nonhomogeneous terms. Within the space-time nonlocal framework, it is crucial to consider both space-dependent nonlocal tail terms and the first introduced time-dependent nonlocal tail term. By adapting a nonlocal variant of the parabolic De Giorgi iterative technique, we initially establish a priori local boundedness with tail terms for weak solutions and then prove the local Hölder continuity.

math.AP↗