arXiv subjects

Xin Zhang

Publications and source records attributed to Xin Zhang.

At least 415 records · Page 23Linked to original sources

arXiv2025

Search for exotic gravitational wave signals beyond general relativity using deep learning

The direct detection of gravitational waves by LIGO has confirmed general relativity (GR) and sparked rapid growth in gravitational wave (GW) astronomy. However, subtle post-Newtonian (PN) deviations observed during the analysis of high signal-to-noise ratio events from the observational runs suggest that standard waveform templates, which assume strict adherence to GR, might overlook signals from alternative theories of gravity. Incorporating these exotic signals into traditional search algorithms is computationally infeasible due to the vast template space required. This paper introduces a proof-of-principle deep learning framework for detecting exotic GW signals, leveraging neural networks trained on GR-based templates. Through their generalization ability, neural networks learn intricate features from the data, enabling the detection of signals that deviate from GR. We present the first study evaluating the capability of deep learning to detect beyond-GR signals, including a variety of PN orders. Our model achieves rapid and accurate identification of exotic GW signals across different luminosity distances, with performance comparable to GR-based detections. In particular, applying the model to the GW150914 event demonstrates excellent performance, highlighting the potential of AI-driven methods for detecting previously overlooked signals beyond GR. This work paves the way for new discoveries in gravitational wave astronomy, enabling the detection of signals that might escape traditional search pipelines.

gr-qc↗

arXiv2025

XY-Tokenizer: Mitigating the Semantic-Acoustic Conflict in Low-Bitrate Speech Codecs

Speech codecs serve as bridges between speech signals and large language models. An ideal codec for speech language models should not only preserve acoustic information but also capture rich semantic information. However, existing speech codecs struggle to balance high-quality audio reconstruction with ease of modeling by language models. In this study, we analyze the limitations of previous codecs in balancing semantic richness and acoustic fidelity. We propose XY-Tokenizer, a novel codec that mitigates the conflict between semantic and acoustic capabilities through multi-stage, multi-task learning. Experimental results demonstrate that XY-Tokenizer achieves performance in both semantic and acoustic tasks comparable to that of state-of-the-art codecs operating at similar bitrates, even though those existing codecs typically excel in only one aspect. Specifically, XY-Tokenizer achieves strong text alignment, surpassing distillation-based semantic modeling methods such as SpeechTokenizer and Mimi, while maintaining a speaker similarity score of 0.83 between reconstructed and original audio. The reconstruction performance of XY-Tokenizer is comparable to that of BigCodec, the current state-of-the-art among acoustic-only codecs, which achieves a speaker similarity score of 0.84 at a similar bitrate. Code and models are available at https://github.com/gyt1145028706/XY-Tokenizer.

cs.SD↗

arXiv2025

On the solution operators arising from the gas-liquid two-phase problem in unbounded domains with finite depth

This paper studies some evolution equations arising from the sharp interface problem of the compressible-incompressible Navier-Stokes equations in unbounded domains in $\mathbb{R}^N (N\geq2)$, where the viscous gases initially occupy the upper half space and the viscous liquids below initially lie in the strip-like domain. In order to establish the maximal $L_p$-$L_q$ regularity estimates of the evolution problem, we construct the R-solver of the resolvent problem associated to the gas-liquid two-phase operator. The crucial part of our proof lies in the analysis of the explicit resolvent operators defined in the unbounded domains with flat boundaries.

math.AP↗

arXiv2025

Open-loop and closed-loop solvabilities for zero-sum stochastic linear quadratic differential games of Markovian regime switching system

This paper investigates zero-sum stochastic linear quadratic (SLQ) differential games with Markovian jumps. Open-loop and closed-loop solvabilities are studied by employing a new ``decomposition method", which decomposes the open-loop and closed-loop solvability problems of zero-sum SLQ differential games into two coupled SLQ control problems. Under the uniform convexity-concavity condition, we construct the open-loop saddle point along with its closed-loop representation based on the solution to a system of constrained coupled differential Riccati equations (CDREs), whose solvability is also established by employing the dimension extension technique and the continuation method. Finally, we provide a concrete example and present its closed-form saddle point based on the theoretical results obtained.

math.OC↗

arXiv2025

No Eigenvalues Outside the Limiting Support of Generally Correlated and Noncentral Sample Covariance Matrices

Spectral properties of random matrices play an important role in statistics, machine learning, communications, and many other areas. Engaging results regarding the convergence of the empirical spectral distribution (ESD) and the ``no-eigenvalue'' property have been obtained for random matrices with different correlation structures. However, the related spectral analysis for generally correlated and noncentral random matrices is still incomplete, and this paper aims to fill this research gap. Specifically, we consider matrices whose columns are independent but with non-zero means and non-identical correlations. Under high-dimensional asymptotics where both the number of rows and columns grow simultaneously to infinity, we first establish the almost sure convergence of the ESD for the concerned random matrices to a deterministic limit, assuming mild conditions. Furthermore, we prove that with probability 1, no eigenvalues will appear in any closed interval outside the support of the limiting distribution for matrices with sufficiently large dimensions. The above results can be applied to different areas such as statistics, wireless communications, and signal processing. In this paper, we apply the derived results to two communication scenarios: 1) We determine the limiting performance of the signal-to-interference-plus-noise ratio for multi-user multiple-input multiple-output (MIMO) systems with linear minimum mean-square error receivers; and 2) We establish the invertibility of zero-forcing precoding matrices in downlink MIMO systems, providing theoretical guarantees.

math.ST↗

arXiv2025

Specific Wasserstein divergence between continuous martingales

Defining a divergence between the laws of continuous martingales is a delicate task, owing to the fact that these laws tend to be singular to each other. An important idea, put forward by N. Gantert, is to instead consider a scaling limit of the relative entropy between such continuous martingales sampled over a finite time grid. This gives rise to the concept of specific relative entropy. In order to develop a general theory of divergences between continuous martingales, it is only natural to replace the role of the relative entropy in this construction by a different notion of discrepancy between finite dimensional probability distributions. In the present work we take a first step in this direction, taking a power $p$ of the Wasserstein distance instead of the relative entropy. We call the newly obtained scaling limit the specific $p$-Wasserstein divergence. In our first main result we prove that the specific $p$-Wasserstein divergence is well-defined, exhibit an explicit expression for it in terms of the quadratic variations of the martingales involved, and compare it with the specific relative entropy and adapted Wasserstein distance on a class of SDEs. Next we consider the specific $p$-Wasserstein divergence optimization over the set of win-martingales. In our second main result we characterize the solution of this optimization problem for all $p>0$ and, somewhat surprisingly, we single out the case $p=1/2$ as the one with the best probabilistic properties. For instance, the optimal martingale in this case is very explicit and can be connected to the solution of a variant of the Schrödinger problem.

math.PR↗

arXiv2025

pUniFind: a unified large pre-trained deep learning model pushing the limit of mass spectra interpretation

Deep learning has advanced mass spectrometry data interpretation, yet most models remain feature extractors rather than unified scoring frameworks. We present pUniFind, the first large-scale multimodal pre-trained model in proteomics that integrates end-to-end peptide-spectrum scoring with open, zero-shot de novo sequencing. Trained on over 100 million open search-derived spectra, pUniFind aligns spectral and peptide modalities via cross modality prediction and outperforms traditional engines across diverse datasets, particularly achieving a 42.6 percent increase in the number of identified peptides in immunopeptidomics. Supporting over 1,300 modifications, pUniFind identifies 60 percent more PSMs than existing de novo methods despite a 300-fold larger search space. A deep learning based quality control module further recovers 38.5 percent additional peptides including 1,891 mapped to the genome but absent from reference proteomes while preserving full fragment ion coverage. These results establish a unified, scalable deep learning framework for proteomic analysis, offering improved sensitivity, modification coverage, and interpretability.

cs.LG↗

arXiv2025

RoboScape: Physics-informed Embodied World Model

World models have become indispensable tools for embodied intelligence, serving as powerful simulators capable of generating realistic robotic videos while addressing critical data scarcity challenges. However, current embodied world models exhibit limited physical awareness, particularly in modeling 3D geometry and motion dynamics, resulting in unrealistic video generation for contact-rich robotic scenarios. In this paper, we present RoboScape, a unified physics-informed world model that jointly learns RGB video generation and physics knowledge within an integrated framework. We introduce two key physics-informed joint training tasks: temporal depth prediction that enhances 3D geometric consistency in video rendering, and keypoint dynamics learning that implicitly encodes physical properties (e.g., object shape and material characteristics) while improving complex motion modeling. Extensive experiments demonstrate that RoboScape generates videos with superior visual fidelity and physical plausibility across diverse robotic scenarios. We further validate its practical utility through downstream applications including robotic policy training with generated data and policy evaluation. Our work provides new insights for building efficient physics-informed world models to advance embodied intelligence research. The code is available at: https://github.com/tsinghua-fib-lab/RoboScape.

cs.CV↗

arXiv2025

Moderating the Generalization of Score-based Generative Model

Score-based Generative Models (SGMs) have demonstrated remarkable generalization abilities, e.g. generating unseen, but natural data. However, the greater the generalization power, the more likely the unintended generalization, and the more dangerous the abuse. Research on moderated generalization in SGMs remains limited. To fill this gap, we first examine the current 'gold standard' in Machine Unlearning (MU), i.e., re-training the model after removing the undesirable training data, and find it does not work in SGMs. Further analysis of score functions reveals that the MU 'gold standard' does not alter the original score function, which explains its ineffectiveness. Based on this insight, we propose the first Moderated Score-based Generative Model (MSGM), which introduces a novel score adjustment strategy that redirects the score function away from undesirable data during the continuous-time stochastic differential equation process. Extensive experimental results demonstrate that MSGM significantly reduces the likelihood of generating undesirable content while preserving high visual quality for normal image generation. Albeit designed for SGMs, MSGM is a general and flexible MU framework that is compatible with diverse diffusion architectures (SGM and DDPM) and training strategies (re-training and fine-tuning), and enables zero-shot transfer of the pre-trained models to downstream tasks, e.g. image inpainting and reconstruction. The code will be shared upon acceptance.

cs.LG↗

arXiv2025

Data Efficacy for Language Model Training

Data is fundamental to the training of language models (LM). Recent research has been dedicated to data efficiency, which aims to maximize performance by selecting a minimal or optimal subset of training data. Techniques such as data filtering, sampling, and selection play a crucial role in this area. To complement it, we define Data Efficacy, which focuses on maximizing performance by optimizing the organization of training data and remains relatively underexplored. This work introduces a general paradigm, DELT, for considering data efficacy in LM training, which highlights the significance of training data organization. DELT comprises three components: Data Scoring, Data Selection, and Data Ordering. Among these components, we design Learnability-Quality Scoring (LQS), as a new instance of Data Scoring, which considers both the learnability and quality of each data sample from the gradient consistency perspective. We also devise Folding Ordering (FO), as a novel instance of Data Ordering, which addresses issues such as model forgetting and data distribution bias. Comprehensive experiments validate the data efficacy in LM training, which demonstrates the following: Firstly, various instances of the proposed DELT enhance LM performance to varying degrees without increasing the data scale and model size. Secondly, among these instances, the combination of our proposed LQS for data scoring and Folding for data ordering achieves the most significant improvement. Lastly, data efficacy can be achieved together with data efficiency by applying data selection. Therefore, we believe that data efficacy is a promising foundational area in LM training.

cs.CL↗

arXiv2025

A Novel Large Vision Foundation Model (LVFM)-based Approach for Generating High-Resolution Canopy Height Maps in Plantations for Precision Forestry Management

Accurate, cost-effective monitoring of plantation aboveground biomass (AGB) is crucial for supporting local livelihoods and carbon sequestration initiatives like the China Certified Emission Reduction (CCER) program. High-resolution canopy height maps (CHMs) are essential for this, but standard lidar-based methods are expensive. While deep learning with RGB imagery offers an alternative, accurately extracting canopy height features remains challenging. To address this, we developed a novel model for high-resolution CHM generation using a Large Vision Foundation Model (LVFM). Our model integrates a feature extractor, a self-supervised feature enhancement module to preserve spatial details, and a height estimator. Tested in Beijing's Fangshan District using 1-meter Google Earth imagery, our model outperformed existing methods, including conventional CNNs. It achieved a mean absolute error of 0.09 m, a root mean square error of 0.24 m, and a correlation of 0.78 against lidar-based CHMs. The resulting CHMs enabled over 90% success in individual tree detection, high accuracy in AGB estimation, and effective tracking of plantation growth, demonstrating strong generalization to non-training areas. This approach presents a promising, scalable tool for evaluating carbon sequestration in both plantations and natural forests.

cs.CV↗

arXiv2025

Benchmarking nuclear matrix elements of $0νββ$ decay with high-energy nuclear collisions

Reducing uncertainties in the nuclear matrix elements (NMEs) remains a critical challenge in designing and interpreting experiments aimed at discovering neutrinoless double beta ($0νββ$) decay. Here, we identify a class of observables, distinct from those employed in low-energy nuclear structure applications, that are strongly correlated with the NMEs: momentum correlations among hadrons produced in high-energy nuclear collisions. Focusing on the $^{150}$Nd$\rightarrow$$^{150}$Sm transition, we combine a Bayesian analysis of the structure of $^{150}$Nd with simulations of high-energy $^{150}$Nd+$^{150}$Nd collisions. We reveal prominent correlations between the NMEs and features of the quark-gluon plasma (QGP) formed in these processes, such as spatial gradients and anisotropies, which are accessible via collective flow measurements. Our findings demonstrate collider experiments involving $0νββ$ decay candidates as a platform for benchmarking theoretical predictions of the NMEs.

nucl-th↗

arXiv2025

Walsh Spider Diffusions as Time Changed Multi-parameter Processes

Inspired by allocation strategies in multi-armed bandit model, we propose a pathwise construction of Walsh spider diffusions. For any infinitesimal generator on a star shaped graph, there exists a unique time change associated with a multi-parameter process such that the time change of this multi-parameter process is the desired diffusion. The time change has an interpretation of time allocation of the process on each edge, and it can be derived explicitly from a family of equations.

math.PR↗

arXiv2025

FEA-Bench: A Benchmark for Evaluating Repository-Level Code Generation for Feature Implementation

Implementing new features in repository-level codebases is a crucial application of code generation models. However, current benchmarks lack a dedicated evaluation framework for this capability. To fill this gap, we introduce FEA-Bench, a benchmark designed to assess the ability of large language models (LLMs) to perform incremental development within code repositories. We collect pull requests from 83 GitHub repositories and use rule-based and intent-based filtering to construct task instances focused on new feature development. Each task instance containing code changes is paired with relevant unit test files to ensure that the solution can be verified. The feature implementation requires LLMs to simultaneously possess code completion capabilities for new components and code editing abilities for other relevant parts in the code repository, providing a more comprehensive evaluation method of LLMs' automated software engineering capabilities. Experimental results show that LLMs perform significantly worse in the FEA-Bench, highlighting considerable challenges in such repository-level incremental code development.

cs.SE↗

arXiv2025

Direct imaging of quantum interference and Non-Abelian entanglement in Hopfion: an magnetic soliton possess loop-like anyonic properties

This work provides the first experimental elucidation of quantum topological effects in individual hopfions, establishing their potential as building blocks for three-dimensional topological quantum spintronics. The observed Non-Abelian characteristics suggest pathways toward fault-tolerant quantum operations through controlled hopfion braiding in engineered magnetic metamaterials.

cond-mat.mes-hall↗

arXiv2025

SynGraph: A Dynamic Graph-LLM Synthesis Framework for Sparse Streaming User Sentiment Modeling

User reviews on e-commerce platforms exhibit dynamic sentiment patterns driven by temporal and contextual factors. Traditional sentiment analysis methods focus on static reviews, failing to capture the evolving temporal relationship between user sentiment rating and textual content. Sentiment analysis on streaming reviews addresses this limitation by modeling and predicting the temporal evolution of user sentiments. However, it suffers from data sparsity, manifesting in temporal, spatial, and combined forms. In this paper, we introduce SynGraph, a novel framework designed to address data sparsity in sentiment analysis on streaming reviews. SynGraph alleviates data sparsity by categorizing users into mid-tail, long-tail, and extreme scenarios and incorporating LLM-augmented enhancements within a dynamic graph-based structure. Experiments on real-world datasets demonstrate its effectiveness in addressing sparsity and improving sentiment modeling in streaming reviews.

cs.CL↗

arXiv2025

Gradients of unitary optical neural networks using parameter-shift rule

This paper explores the application of the parameter-shift rule (PSR) for computing gradients in unitary optical neural networks (UONNs). While backpropagation has been fundamental to training conventional neural networks, its implementation in optical neural networks faces significant challenges due to the physical constraints of optical systems. We demonstrate how PSR, which calculates gradients by evaluating functions at shifted parameter values, can be effectively adapted for training UONNs constructed from Mach-Zehnder interferometer meshes. The method leverages the inherent Fourier series nature of optical interference in these systems to compute exact analytical gradients directly from hardware measurements. This approach offers a promising alternative to traditional in silico training methods and circumvents the limitations of both finite difference approximations and all-optical backpropagation implementations. We present the theoretical framework and practical methodology for applying PSR to optimize phase parameters in optical neural networks, potentially advancing the development of efficient hardware-based training strategies for optical computing systems.

cs.ET↗

arXiv2025

Combining strongly lensed and unlensed fast radio bursts: To be a more precise late-universe probe

The Macquart relation and time-delay cosmography are now two promising ways to fast radio burst (FRB) cosmology. In this work, we propose a joint method that combines strongly lensed and unlensed FRBs for improving cosmological parameter estimation by using simulated FRB data from the future sensitive coherent all-sky monitor survey, which is expected to detect a large number of FRBs including galaxy-galaxy strongly lensed events. We find that using a detectable sample of 100,000 localized FRBs including $40$ lensed events can simultaneously constrain the Hubble constant and the equation of state of dark energy, with high precision of $\varepsilon(H_0)=0.4\%$ and $\varepsilon(w)=4.5\%$ in the simplest dynamical dark energy model. The joint analysis of unlensed and lensed FRBs significantly improves the constraint on $H_0$, which could be more effective than combining either the unlensed FRBs with future gravitational wave (GW) standard sirens or the lensed FRBs with CMB. Furthermore, combining the full FRB sample with the CMB+BAO+SNe data yields $σ(H_0)=0.29~{\rm km~s^{-1}~Mpc^{-1}}$, $σ(w_0)=0.046$, and $σ(w_a)=0.15$ in the two-parameter dynamical dark energy model, which outperform the results from the CMB+BAO+SNe+GW data. This reinforces the cosmological implications of a multi-wavelength observational strategy in optical and radio bands. We conclude that the future FRB observations will shed light on the nature of dark energy and also the Hubble tension if enough events with long-duration lensing are incorporated.

astro-ph.CO↗