Search arXiv⌕ Search

arXiv subjects

Jun Li

Publications and source records attributed to Jun Li.

At least 145 records · Page 8Linked to original sources

Stability conditions in the mathematical Gauged Linear Sigma Model

The theory of Mixed-Spin-P (MSP) fields was introduced by Chang-Li-Li-Liu for the quintic threefold, aiming at studying its higher-genus Gromov-Witten invariants. Chang-Guo-Li has successfully applied it to prove conjectures including the BCOV Feynman rule, Yamaguchi-Yau's polynomiality conjecture and the Holomorphic Anomaly Equation. Meanwhile, Fan-Jarvis-Ruan introduced a mathematical theory of Gauged Linear Sigma Model (GLSM), associating a counting theory to a GIT quotient with a super-potential, under suitable assumptions. This paper provides a common generalization of both works, by introducing new stability conditions in the mathematical GLSM. We show that our stability condition guarantees the separatedness and properness of the cosection degeneracy locus in the moduli. It generalizes the MSP fields construction to more general GIT quotients, including Calabi-Yau global complete intersections in toric varieties. This hopefully provides a geometric platform to effectively compute their higher-genus Gromov-Witten invariants.

math.AG↗

A boundedness theorem for principal bundles on curves

Let $G$ be a reductive group acting on an affine scheme $V$. We study the set of principal $G$-bundles on a smooth projective curve $\mathcal C$ such that the associated $V$-bundle admits a section sending the generic point of $\mathcal C$ into the GIT stable locus $V^{\mathrm{s}}(θ)$. We show that after fixing the degree of the line bundle induced by the character $θ$, the set of such principal $G$-bundles is bounded. The statement of our theorem is made slightly more general so that we deduce from it the boundedness for $ε$-stable quasimaps and $Ω$-stable LG-quasimap.

math.AG↗

Beyond Rejection Sampling: Trajectory Fusion for Scaling Mathematical Reasoning

Large language models (LLMs) have made impressive strides in mathematical reasoning, often fine-tuned using rejection sampling that retains only correct reasoning trajectories. While effective, this paradigm treats supervision as a binary filter that systematically excludes teacher-generated errors, leaving a gap in how reasoning failures are modeled during training. In this paper, we propose TrajFusion, a fine-tuning strategy that reframes rejection sampling as a structured supervision construction process. Specifically, TrajFusion forms fused trajectories that explicitly model trial-and-error reasoning by interleaving selected incorrect trajectories with reflection prompts and correct trajectories. The length of each fused sample is adaptively controlled based on the frequency and diversity of teacher errors, providing richer supervision for challenging problems while safely reducing to vanilla rejection sampling fine-tuning (RFT) when error signals are uninformative. TrajFusion requires no changes to the architecture or training objective. Extensive experiments across multiple math benchmarks demonstrate that TrajFusion consistently outperforms RFT, particularly on challenging and long-form reasoning problems.

cs.CL↗

Can Distillation Mitigate Backdoor Attacks in Pre-trained Encoders?

Self-Supervised Learning (SSL) has become a prominent paradigm for pre-training encoders to learning general-purpose representations from unlabeled data and releasing them on third-party platforms for broad downstream deep learning tasks. However, SSL is vulnerable to backdoor attacks, where an adversary may train and distribute poisoned pre-training encoders to contaminate the downstream models. In this paper, we study a defense mechanism based on distillation against poisoned encoders in SSL. Traditionally, distillation transfers knowledge from a pre-trained teacher model to a student model, enabling the student to replicate or refine the teacher's learned representations. We repurpose distillation to extract benign knowledge and remove backdoors from a poisoned pre-trained encoder to produce a clean and reliable pre-trained model. We conduct extensive experiments to evaluate the effectiveness of distillation in mitigating backdoor attacks on pre-trained encoders. Based on two state-of-the-art backdoor attacks and four widely adopted image classification datasets, our results demonstrate that distillation reduces the attack success rate from 80.87% to 27.51%, with only a 6.35% drop in model accuracy. Furthermore, by comparing four teacher architectures, three student models, and six loss functions, we find that the distillation with fine-tuned teacher networks, warm-up-based student training, and attention-based distillation losses yield the best performance.

cs.LG↗

ECGomics: An Open Platform for AI-ECG Digital Biomarker Discovery

Background: Conventional electrocardiogram (ECG) analysis faces a persistent dichotomy: expert-driven features ensure interpretability but lack sensitivity to latent patterns, while deep learning offers high accuracy but functions as a black box with high data dependency. We introduce ECGomics, a systematic paradigm and open-source platform for the multidimensional deconstruction of cardiac signals into digital biomarker. Methods: Inspired by the taxonomic rigor of genomics, ECGomics deconstructs cardiac activity across four dimensions: Structural, Intensity, Functional, and Comparative. This taxonomy synergizes expert-defined morphological rules with data-driven latent representations, effectively bridging the gap between handcrafted features and deep learning embeddings. Results: We operationalized this framework into a scalable ecosystem consisting of a web-based research platform and a mobile-integrated solution (https://github.com/PKUDigitalHealth/ECGomics). The web platform facilitates high-throughput analysis via precision parameter configuration, high-fidelity data ingestion, and 12-lead visualization, allowing for the systematic extraction of biomarkers across the four ECGomics dimensions. Complementarily, the mobile interface, integrated with portable sensors and a cloud-based engine, enables real-time signal acquisition and near-instantaneous delivery of structured diagnostic reports. This dual-interface architecture successfully transitions ECGomics from theoretical discovery to decentralized, real-world health management, ensuring professional-grade monitoring in diverse clinical and home-based settings. Conclusion: ECGomics harmonizes diagnostic precision, interpretability, and data efficiency. By providing a deployable software ecosystem, this paradigm establishes a robust foundation for digital biomarker discovery and personalized cardiovascular medicine.

q-bio.QM↗

Does DINOv3 Set a New Medical Vision Standard? Benchmarking 2D and 3D Classification, Segmentation, and Registration

The advent of large-scale vision foundation models, pre-trained on diverse natural images, has marked a paradigm shift in computer vision. However, how the frontier vision foundation models' efficacies transfer to specialised domains such as medical imaging remains an open question. This report investigates whether DINOv3, a state-of-the-art self-supervised vision transformer (ViT) pre-trained on natural images, can directly serve as a powerful, unified encoder for medical vision tasks without domain-specific fine-tuning. To answer this, we benchmark DINOv3 across common medical vision tasks, including 2D and 3D classification, segmentation, and registration on a wide range of medical imaging modalities. We systematically analyse its scalability by varying model sizes and input image resolutions. Our findings reveal that DINOv3 shows impressive performance and establishes a formidable new baseline. Remarkably, it can even outperform medical-specific foundation models like BiomedCLIP and CT-Net on several tasks, despite being trained solely on natural images. However, we identify clear limitations: The model's features degrade in scenarios requiring deep domain specialisation, such as in whole-slide images (WSIs), electron microscopy (EM), and positron emission tomography (PET). Furthermore, we observe that DINOv3 does not consistently follow the scaling law in the medical domain. Its performance does not reliably increase with larger models or finer feature resolutions, showing diverse scaling behaviours across tasks. Overall, our work establishes DINOv3 as a strong baseline, whose powerful visual features can serve as a robust prior for multiple medical tasks. This opens promising future directions, such as leveraging its features to enforce multiview consistency in 3D reconstruction.

cs.CV↗

V2X-Radar: A Multi-modal Dataset with 4D Radar for Cooperative Perception

Modern autonomous vehicle perception systems often struggle with occlusions and limited perception range. Previous studies have demonstrated the effectiveness of cooperative perception in extending the perception range and overcoming occlusions, thereby enhancing the safety of autonomous driving. In recent years, a series of cooperative perception datasets have emerged; however, these datasets primarily focus on cameras and LiDAR, neglecting 4D Radar, a sensor used in single-vehicle autonomous driving to provide robust perception in adverse weather conditions. In this paper, to bridge the gap created by the absence of 4D Radar datasets in cooperative perception, we present V2X-Radar, the first large-scale, real-world multi-modal dataset featuring 4D Radar. V2X-Radar dataset is collected using a connected vehicle platform and an intelligent roadside unit equipped with 4D Radar, LiDAR, and multi-view cameras. The collected data encompasses sunny and rainy weather conditions, spanning daytime, dusk, and nighttime, as well as various typical challenging scenarios. The dataset consists of 20K LiDAR frames, 40K camera images, and 20K 4D Radar data, including 350K annotated boxes across five categories. To support various research domains, we have established V2X-Radar-C for cooperative perception, V2X-Radar-I for roadside perception, and V2X-Radar-V for single-vehicle perception. Furthermore, we provide comprehensive benchmarks across these three sub-datasets. We will release all datasets and benchmark codebase at https://huggingface.co/datasets/yanglei18/V2X-Radar and https://github.com/yanglei18/V2X-Radar.

cs.CV↗

AnyECG: Evolved ECG Foundation Model for Holistic Health Profiling

Background: Artificial intelligence enabled electrocardiography (AI-ECG) has demonstrated the ability to detect diverse pathologies, but most existing models focus on single disease identification, neglecting comorbidities and future risk prediction. Although ECGFounder expanded cardiac disease coverage, a holistic health profiling model remains needed. Methods: We constructed a large multicenter dataset comprising 13.3 million ECGs from 2.98 million patients. Using transfer learning, ECGFounder was fine-tuned to develop AnyECG, a foundation model for holistic health profiling. Performance was evaluated using external validation cohorts and a 10-year longitudinal cohort for current diagnosis, future risk prediction, and comorbidity identification. Results: AnyECG demonstrated systemic predictive capability across 1172 conditions, achieving an AUROC greater than 0.7 for 306 diseases. The model revealed novel disease associations, robust comorbidity patterns, and future disease risks. Representative examples included high diagnostic performance for hyperparathyroidism (AUROC 0.941), type 2 diabetes (0.803), Crohn disease (0.817), lymphoid leukemia (0.856), and chronic obstructive pulmonary disease (0.773). Conclusion: The AnyECG foundation model provides substantial evidence that AI-ECG can serve as a systemic tool for concurrent disease detection and long-term risk prediction.

eess.SP↗

Hausdorff dimension and quasisymmetric minimality of homogeneous Moran sets

In this paper, we study the quasisymmetric Hausdorff minimality of homogeneous Moran sets. First, we obtain the Hausdorff dimension formula of two classes of homogeneous Moran sets which satisfy some conditions. Second, we show two special classes of homogeneous Moran sets with Hausdorff dimension 1 are quasisymmetrically Hausdorff minimal.

math.GN↗

Experimental realization of quantum Zeno dynamics for robust quantum metrology

Quantum Zeno dynamics (QZD), which restricts the system's evolution to a protected subspace, provides a promising approach for protecting quantum information from noise. Here, we explore a practical approach to harnessing QZD for robust quantum metrology. By introducing strong inter-particle interactions during the parameter encoding stage, we overcome the typical limitations of previous QZD studies, which have largely focused on single-particle systems and faced challenges where QZD could interfere with the encoding process. We experimentally validate the proposed scheme on a nuclear magnetic resonance platform, achieving near-optimal precision scaling under amplitude damping in both parallel and sequential settings. Numerical simulations further demonstrate the scalability of the approach and its compatibility with other control techniques for suppressing more general types of noise. These findings highlight QZD as a powerful strategy for noise-resilient quantum metrology.

quant-ph↗

Continuous Unitary Designs for Universally Robust Quantum Control

Unitary designs are unitary ensembles that emulate Haar-random unitary statistics. They provide a vital tool for studying quantum randomness and have found broad applications in quantum technologies. However, existing research has focused on discrete ensembles, despite that many physical processes, such as in quantum chaos, thermalization, and control, naturally involve continuous ensembles generated from continuous time-evolution. Here we initial the study of continuous unitary designs, addressing fundamental questions about their construction and practical utility. For single-qubit system, we construct explicit unitary 1-design paths from spherical 2-design curves and Hopf fibration theory. For arbitrary dimensions, we develop two systematic construction frameworks, one based on topological bundle theory of the unitary group and the other based on the Heisenberg-Weyl group. On the practical front, our unitary design paths provide analytical solutions to universally robust quantum control. Simulations show they outperform conventional pulse techniques in mitigating arbitrary unknown static noises, demonstrating immediate utility for quantum engineering. Extending unitary designs to the continuous domain not only introduces powerful geometric and topological tools that complement conventional combinatorial and group-theoretic methods, but also enhances experimental feasibility over discrete counterparts which usually involve instantaneous pulses. As an outlook, we anticipate that this work will pave the way for using continuous unitary designs to explore complex quantum dynamics and devise quantum information protocols.

quant-ph↗

Parallel Quantum Gates via Scalable Subsystem-Optimized Robust Control

Accurate and efficient implementation of parallel quantum gates is crucial for scalable quantum information processing. However, the unavoidable crosstalk between qubits in current noisy processors impedes the achievement of high gate fidelities and renders full Hilbert-space control optimization prohibitively difficult. Here, we overcome this challenge by reducing the full-system optimization to crosstalk-robust control over constant-sized subsystems, which dramatically reduces the computational cost. Our method effectively eliminates the leading-order gate operation deviations induced by crosstalk, thereby suppressing error rates. Within this framework, we construct analytical pulse solutions for parallel single-qubit gates and numerical pulses for parallel multi-qubit operations. We validate the proposed approach numerically across multiple platforms, including coupled nitrogen-vacancy centers, a nuclear-spin processor, and superconducting-qubit arrays with up to 200 qubits. As a result, the noise scaling is reduced from exponential to linear for parallel single-qubit gates, and an order-of-magnitude reduction is achieved for parallel multi-qubit gates. Moreover, our method does not require precise knowledge of crosstalk strengths and makes no assumption about the underlying qubit connectivity or lattice geometry, thereby establishing a scalable framework for parallel quantum control in large-scale quantum architectures.

quant-ph↗

A relativistic quantum Euler-Poisson system derived from the Klein-Gordon-Poisson equation: hyperbolic-elliptic structure

In the Klein-Gordon equation, quantum and relativistic parameters are strongly coupled, which poses significant analytical challenges in the derivation and analysis of related classical fluid models. In this paper, starting from the Klein-Gordon-Poisson system, we formally derive a relativistic quantum hydrodynamic (RQHD) system via the Madelung transformation, in which the relativistic and quantum correction terms in the Euler-Poisson framework are clearly exhibited. In particular, at a formal level, the RQHD system reduces to the relativistic hydrodynamics system in the semiclassical regime and to the quantum hydrodynamics system in the non-relativistic regime. These limiting procedures highlight the unified structure of the proposed model and clarify the role played by the coupled relativistic and quantum effects. From an analytical point of view, by reformulating the RQHD system as a coupled hyperbolic-elliptic system with a nonlocal Poisson interaction, we establish the local-in-time existence and uniqueness of classical solutions to the associated Cauchy problem. The initial density is assumed to be a small perturbation of a positive constant state, while the remaining initial data are taken to be general smooth functions. The analysis relies on energy estimates and suitable estimates for the nonlocal terms, and provides a rigorous well-posedness result in the natural energy space.

math.AP↗

Irregular vanishing on $\mathbb{P}^2 \times \mathbb{P}^2$

In this paper, we describe Mixed-Spin-P(MSP) fields for a smooth CY 3-fold $X_{3,3} \subset \mathbb{P}^2 \times \mathbb{P}^2$. Then we describe $\mathbb{C}^* -$fixed loci of the moduli space of these MSP fields. We prove that any virtual localization term coming from the fixed locus corresponding to an irregular graph does not contribute to the invariant if the graph is not a pure loop, and also prove this vanishing property for the moduli space of N-MSP fields.

math.AG↗

MAPI-GNN: Multi-Activation Plane Interaction Graph Neural Network for Multimodal Medical Diagnosis

Graph neural networks are increasingly applied to multimodal medical diagnosis for their inherent relational modeling capabilities. However, their efficacy is often compromised by the prevailing reliance on a single, static graph built from indiscriminate features, hindering the ability to model patient-specific pathological relationships. To this end, the proposed Multi-Activation Plane Interaction Graph Neural Network (MAPI-GNN) reconstructs this single-graph paradigm by learning a multifaceted graph profile from semantically disentangled feature subspaces. The framework first uncovers latent graph-aware patterns via a multi-dimensional discriminator; these patterns then guide the dynamic construction of a stack of activation graphs; and this multifaceted profile is finally aggregated and contextualized by a relational fusion engine for a robust diagnosis. Extensive experiments on two diverse tasks, comprising over 1300 patient samples, demonstrate that MAPI-GNN significantly outperforms state-of-the-art methods.

cs.CV↗

RMLer: Synthesizing Novel Objects across Diverse Categories via Reinforcement Mixing Learning

Novel object synthesis by integrating distinct textual concepts from diverse categories remains a significant challenge in Text-to-Image (T2I) generation. Existing methods often suffer from insufficient concept mixing, lack of rigorous evaluation, and suboptimal outputs-manifesting as conceptual imbalance, superficial combinations, or mere juxtapositions. To address these limitations, we propose Reinforcement Mixing Learning (RMLer), a framework that formulates cross-category concept fusion as a reinforcement learning problem: mixed features serve as states, mixing strategies as actions, and visual outcomes as rewards. Specifically, we design an MLP-policy network to predict dynamic coefficients for blending cross-category text embeddings. We further introduce visual rewards based on (1) semantic similarity and (2) compositional balance between the fused object and its constituent concepts, optimizing the policy via proximal policy optimization. At inference, a selection strategy leverages these rewards to curate the highest-quality fused objects. Extensive experiments demonstrate RMLer's superiority in synthesizing coherent, high-fidelity objects from diverse categories, outperforming existing methods. Our work provides a robust framework for generating novel visual concepts, with promising applications in film, gaming, and design.

cs.CV↗

Shear Stress and Fluid-Wall Interaction Force in LBM Simulations of Hydrodynamic and MHD Flows

Chapman-Enskog analysis of the lattice Boltzmann method (LBM) is adopted to recover the Navier-Stokes (N-S) equation for the magnetohydrodynamic (MHD) flows driven by external body forces other than the induced Lorentz force. Various numerical schemes are discussed for the implementation of external body forces, leading to different artefact terms. An order-of-magnitude analysis is provided to demonstrate that the artefact terms are negligible in calculating the shear stress and strain rate tensors, which keeps the study of fluid-wall interaction and the implementation of large eddy simulation (LES) simple. This clarifies the confusion in the literature, where both considering and not considering the artefact terms have been adopted without discussion. Additionally, the fluid-wall interaction force can be computed as the intuitive momentum exchange rate using a special distribution function after a half-step propagation, and consistency is obtained with the formula derived using the Chapman-Enskog analysis. The momentum flux tensor for moving boundaries is uncovered as the cause of violating Galilean invariance and the Maxwell stress tensor for Lorentz force is also contained in this intuitively calculated interaction force for MHD flows due to the modification of equilibrium distribution function. Both extra terms should be removed for an interaction force associated with the hydrodynamic pressure and viscous shear stress. The implication of extra terms for the global balance of different physical forces is discussed.

physics.flu-dyn↗

Enhancing Supervised Composed Image Retrieval via Reasoning-Augmented Representation Engineering

Composed Image Retrieval (CIR) presents a significant challenge as it requires jointly understanding a reference image and a modified textual instruction to find relevant target images. Some existing methods attempt to use a two-stage approach to further refine retrieval results. However, this often requires additional training of a ranking model. Despite the success of Chain-of-Thought (CoT) techniques in reducing training costs for language models, their application in CIR tasks remains limited -- compressing visual information into text or relying on elaborate prompt designs. Besides, existing works only utilize it for zero-shot CIR, as it is challenging to achieve satisfactory results in supervised CIR with a well-trained model. In this work, we proposed a framework that includes the Pyramid Matching Model with Training-Free Refinement (PMTFR) to address these challenges. Through a simple but effective module called Pyramid Patcher, we enhanced the Pyramid Matching Model's understanding of visual information at different granularities. Inspired by representation engineering, we extracted representations from COT data and injected them into the LVLMs. This approach allowed us to obtain refined retrieval scores in the Training-Free Refinement paradigm without relying on explicit textual reasoning, further enhancing performance. Extensive experiments on CIR benchmarks demonstrate that PMTFR surpasses state-of-the-art methods in supervised CIR tasks. The code will be made public.

cs.CV↗