Searcharxiv⌕ Search

arXiv subjects

Xin Liu

Publications and source records attributed to Xin Liu.

At least 91 records · Page 5Linked to original sources
arXiv2026

Control-Anchored Residual Flow Matching Conditioned on Gene Geometry for Virtual Cell Perturbation Modeling

A central task in virtual cell modeling is predicting single-cell transcriptional responses to unseen genetic perturbations and drug combinations, and biological networks provide valuable priors on gene relationships. Existing graph-based models commonly use the same network to structure gene representations and mediate intergene interactions, thereby implicitly treating stable associations as perturbation-response pathways. Gene Ontology and control-derived coexpression networks encode relatively stable relationships rather than intervention-specific response directions or magnitudes. We therefore propose GeneGeoFlow, which conditions a control-anchored residual flow on gene-wise geometry derived from biological networks to learn intervention-specific transcriptional responses. GeneGeoFlow derives multi-scale spectral coordinates from Gene Ontology and control-derived coexpression networks. A perturbation-conditioned, gene-wise gating module selects relevant structural scales and network sources, yielding intervention-specific gene geometry. The resulting geometry conditions a control-anchored residual flow without explicitly propagating target-derived signals along the graph. Condition-wise optimal transport couples unpaired control and perturbed populations for training, while a Delta-correlation objective aligns the predicted and observed condition-level expression-shift directions. GeneGeoFlow achieves Pearson Delta scores of 0.8979 on the Norman additive benchmark and 0.9088 on five held-out drug combinations in the fixed ComboSciPlex test split. These results support perturbation-conditioned gene geometry as an effective structural prior for intervention-specific response prediction, without conflating stable gene relationships with response propagation.

q-bio.MN↗
arXiv2026

MUGEN: A Unified Framework for Efficient Motion Understanding and Generation

Grounding human motion in language, and language in motion, is a central step toward physical AI systems that can understand, generate, and communicate human behavior. Unified motion--language systems first coupled the two directions through a shared discrete motion codebook, but quantization limits generation quality. The strongest generators buy quality back at growing cost: stacked residual codebooks enlarge the representation; masked decoding stages, long autoregressive rollouts, and denoising chains of tens to hundreds of steps stretch inference; even the continuous-latent designs among them reach their latent only through an iterative diffusion head; and none of this decoding machinery serves understanding. We therefore propose MUGEN, a unified motion--language framework that pays neither cost: no codebook, one draw. A single adaptive-length autoencoder compresses any-length motion into a few continuous latent slots, the system's only motion representation: the language model generates them for text-to-motion and reads them back for motion understanding. Depth-routed hidden states let each slot read from the transformer depth it needs, and a calibrated head predicts a joint distribution over the full latent set, so a single draw carries the text-conditional, cross-slot variation a description permits. At a decoding cost of K language-model steps, one draw, and one decoder pass, MUGEN leads language-model baselines on FID on HumanML3D while raising retrieval precision above the real-motion reference under the standard evaluator, achieves the best CIDEr and BLEU@4 scores, and surpasses the discrete-token state of the art on every retrieval and alignment metric on SnapMoGen.

cs.LG↗
arXiv2026

A Damped Subspace Splitting Algorithm for Constrained Density Functional Theory

Constrained density functional theory (CDFT) provides a powerful framework for describing electronically excited and charge-localized states, which underlie a broad range of physical and chemical phenomena. However, the discretized optimization problems arising from CDFT calculations remain challenging, owing to the presence of both the Stiefel manifold constraint and additional nonconvex quadratic constraints. Existing algorithms either fail to enforce the quadratic constraints with high accuracy or face convergence issues due to double-loop iterative structures. In this paper, we first derive a subspace-splitting reformulation that decouples the two groups of constraints, by exploiting the inherent rotation invariance and introducing a nonlinear subspace alignment constraint. Based on this reformulation, we propose a single-loop damped alternating direction method of multipliers, called DASSP. To the best of our knowledge, DASSP is the first algorithm for CDFT calculations with rigorous convergence guarantees. Each iteration of DASSP comprises a spectral minimization step, a projected gradient step, and a damped dual ascent step, all of which admit efficient implementations. Numerical results on synthetic and realistic CDFT problems demonstrate that DASSP attains high feasibility accuracy and exhibits favorable efficiency without compromising robustness. We expect that this work will pave the way toward reliable and efficient large-scale CDFT applications.

math.OC↗
arXiv2026

New Statistical Topology Theory Predicts Turbulent Magnetic Emergence from the Sun's Interior

We propose and verify a new statistical topology framework to study the complex magnetic field evolution of Sun-like stars. The Sun, as the star we are most familiar with, exhibits chaotic behaviors such as solar flares and mass ejections that are crucial to the Earth. While these phenomena are mainly driven by the magnetic field, it has been challenging to understand the complex magnetic field. In this paper, we propose a new model to understand the helicity behavior of magnetic loops before their emergence from the interior by advancing the loop ensemble theory from statistical physics. We derive several new power-law scalings that are essential to the Sun's magnetic field, including magnetic flux, magnetic helicity, and linking number. We examine our prediction by a large data analysis through long-term continuous observation over 32 yr. These results not only provide evidence for the new statistical topology framework but also systematically explain the intrinsic unpredictability on the emergence of extreme solar activities. This new discovery on the critical structure of loop ensemble can also be applied to a wide range of turbulence systems.

astro-ph.SR↗
arXiv2026

Towards a new paradigm of scientific discovery with socialized artificial intelligence

Scientific discovery has advanced through successive transformations in the organization of knowledge. Observation and experimentation established the empirical foundations of science. Theory made it possible to derive general principles from particular phenomena. Computation extended inquiry into systems beyond direct observation, while data-intensive methods opened new spaces of pattern and prediction. Science now confronts a different frontier. The central challenge is no longer simply to produce more information, but to organize expanding knowledge, reasoning, and evidence into a coherent process of discovery. Here, we introduce Bridging Literature, Agents, and Zero-gap Experimentation (BLAZE), a paradigm of socialized scientific intelligence. BLAZE conceives AI not as an assistant for isolated research tasks, but as an organizational infrastructure for scientific discovery. It connects persistent knowledge, collective reasoning, empirical validation, and human judgment within a continuous research lifecycle, transforming fragmented activities into a cumulative process of inquiry, criticism, and revision. The central premise of BLAZE is that scientific intelligence does not arise from computation alone. It emerges from the sustained interaction among knowledge, hypotheses, experiments, and collective verification. By organizing humans and machines within a shared scientific process, BLAZE makes discovery more traceable, reproducible, and cumulative while preserving human creativity, judgment, and responsibility. Socialized scientific intelligence may provide a foundation for the next era of science. Its purpose is not to replace human discovery, but to extend the scale, depth, and continuity of collective scientific inquiry.

cs.AI↗
arXiv2026

D$_4$CNN$\times$AnaCal: Physics-Informed Machine Learning for Accurate and Precise Weak Lensing Shear Estimation

Traditional weak gravitational lensing shear estimators are carefully calibrated but struggle to fully capture realistic galaxy morphologies, point-spread-function (PSF) effects, blending, and noise in deep surveys, while blindly trained machine learning (ML) models can introduce significant calibration biases. Here we construct a fully D$_4$-equivariant deep neural network for galaxy shape measurement whose architecture enforces symmetry under 90$^{\circ}$ rotations and mirror transformations, and adopt the Analytical Calibration framework (AnaCal) to calibrate the model using its backpropagated gradients. For isolated galaxies in LSST-like single-band simulations, we demonstrate that our approach achieves $\sim$10% lower shape noise than the traditional moment-based Fourier Power Function Shapelets estimator in the high-noise regime, equivalent to a $\sim$20% gain in effective galaxy number density, while simultaneously achieving multiplicative biases consistent with zero across a wide range of noise levels, PSF sizes and ellipticities, and magnitude selection cuts, with all measurements satisfying $|m| {<} 2 \times 10^{-3}$ (i.e., within the 0.2% LSST requirement) and most at the ${\sim}10^{-4}$ level. We demonstrate this framework on isolated single-band galaxy images with Gaussian noise and known PSF, establishing a rigorous, physics-informed foundation for future extensions of ML-based shear estimation to blended sources and multi-band observations in Stage-IV surveys. All codes and data products will be made publicly available upon acceptance.

astro-ph.IM↗
arXiv2026

DB-Bench: Benchmarking Deblenders for LSST DESC Using the Blending ToolKit

Blending will be a major source of systematic uncertainty in downstream science analyses of LSST data. We benchmark the performance of several deblenders, leveraging the Blending ToolKit (BTK) to perform rigorous, end-to-end testing. This benchmark incorporates key deblending algorithms, including SourceExtractor, SCARLET, and DeepDISC, with the goal of comparing their effectiveness in handling blended galaxy images from LSST/Rubin simulations. A key focus is characterizing algorithm performance in the regime of unrecognized blends, where multiple galaxies are misidentified as a single object, as these cases introduce systematic biases that propagate into downstream cosmological analyses for galaxy surveys. By utilizing BTK's ability to create customized, reproducible blends, we systematically test these deblenders against different blending conditions, such as source separation and brightness. The toolkit's standardized evaluation metrics, including detection precision, segmentation accuracy, and source reconstruction, are comprehensive assessments of each algorithm's strengths and limitations. Each deblender has performance caveats that may impact their true performance in real survey conditions. We find that SCARLET has high segmentation and reconstruction performance, whereas DeepDISC has strong detection recall for faint and low-SNR sources, and SourceExtractor has accurate peak finding abilities but low segmentation and reconstruction performance. This benchmark provides valuable insights into the performance of existing deblenders and highlights areas for future development.

astro-ph.IM↗
arXiv2026

When Fish Look Alike: Tracking Identities with Dual-branch Elasticity

Tracking dense, homogeneous targets like schooling fish remains a major challenge for multiple object tracking due to extreme inter-individual homogeneity, severe physical clustering, and rapid non-rigid deformations. While heavy-backbone separated detection and embedding trackers like SU-T push accuracy boundaries using complex Re-Identification networks, their computational overhead prohibits edge deployment. Furthermore, these modules often fail when appearance features degrade under severe occlusions. To overcome this, we propose Tracking Identities with Dual-branch Elasticity (TIDE). Bypassing expensive appearance cues, TIDE utilizes the Adaptive Geometric Correspondence IoU, an association mechanism leveraging spatial and structural consistency to robustly handle complex morphological variations. Crucially, TIDE introduces system-level deployment elasticity, decoupling the algorithmic pipeline from strict hardware constraints. Evaluations on the MFT-Edge benchmark demonstrate that our Lightweight L-branch achieves a competitive HOTA of 28.43 using merely 20.47G FLOPs. This represents a 38.7-fold computational reduction compared to upper bounds like SU-T, directly facilitating real-time edge deployment. Concurrently, our Scalable S-branch establishes a 29.98 HOTA, successfully bridging the gap between high-precision cloud analysis and efficient edge tracking. The dataset and codes are released at https://vranlee.github.io/TIDE/.

cs.CV↗
arXiv2026

Rigorous justification of the hydrostatic-incompressible approximation for weakly stratified isothermal flow

We consider the limit of small Mach number and small vertical-to-horizontal aspect ratio for the isothermal compressible Navier-Stokes system. In addition, we consider the scale in which the stratification is weak. Owing to the anisotropic nature of the problem, the dynamics exhibit a three-wave separation phenomenon, consistent of a slow wave, a fast horizontal acoustic wave, and an even faster vertical acoustic wave. These three waves, unfortunately, are not mutually orthogonal, and the corresponding projections are parametrized by the small parameter, which significantly complicates the nonlinear analysis. Without any restriction on the size of the initial waves, we establish the uniform existence and uniqueness of solutions to the compressible Navier-Stokes system for any fixed small parameter, by carefully analyzing the evolutions of both the energy and the acoustic waves. Moreover, we prove that, as the small parameter tends to zero, the solutions converge to that of the incompressible primitive equations governing atmospheric and oceanic flows.

math.AP↗
arXiv2026

A Support-Set Algorithm for Optimization Problems with Nonnegative and Orthogonal Constraints

In this paper, we investigate optimization problems with nonnegative and orthogonal constraints, where any feasible matrix of size $n \times p$ exhibits a sparsity pattern such that each row accommodates at most one nonzero entry. Our analysis demonstrates that, by fixing the support set, the global solution of the minimization subproblem for the proximal linearization of the objective function can be computed in closed form with at most $n$ nonzero entries. Exploiting this structural property offers a powerful avenue for dramatically enhancing computational efficiency. Guided by this insight, we propose a support-set algorithm preserving strictly the feasibility of iterates. A central ingredient is a strategically devised update scheme for support sets that adjusts the placement of nonzero entries. We establish the convergence of the support-set algorithm to a first-order stationary point, and show that its iteration complexity required to reach an $ε$-approximate first-order stationary point is $O (ε^{-2})$. Numerical results are strongly in favor of our algorithm in real-world applications, including nonnegative PCA, clustering, and community detection.

math.OC↗
arXiv2026

Experimental Observation of Ghost Image Revivals via Structured Coherence

Ghost imaging retrieves an object's image from intensity correlations between two light beams, neither of which independently carries information about the object. However, conventional ghost imaging critically relies on precise object positioning and conjugate matching between the two arms, causing the image to disappear when these conditions are violated and the object is accessible from one plane only. In this Letter, we break this fundamental limitation by reporting the first experimental observation of revivals of ghost images of arbitrary objects via engineering the longitudinal intensity autocorrelation of a structured thermal light field into a coherence comb. With the reference arm fixed, translating the object produces periodic revivals of the ghost image whenever the object position matches a comb-tooth position, reminiscent of the Talbot effect. This capability enhances the flexibility of correlation imaging, enabling robust tomographic imaging of moving and non-periodic complex objects.

physics.optics↗
arXiv2026

Supercurrent effect in a charge density wave intertwined superconductor

The energy-momentum (E-k) dispersion of quasiparticles constitutes a fundamental concept in condensed matter systems. The ability to modify the E-k dispersion, exemplified by supercurrent-induced Doppler shifts of Bogoliubov quasiparticle spectra in superconductors, enables manipulation of various emergent quantum properties. However, investigations into the supercurrent effect on superconductors intertwined with charge orders remain scarce. Here, we report that the Meissner current, generated by the diamagnetic response to an applied in-plane magnetic field, can tailor Bogoliubov quasiparticle excitations at the precursor charge density wave (CDW) vectors. Our scanning tunneling spectroscopic imaging reveals a field-driven symmetry breaking of CDW modulations, specifically a C3v-to-Cs transition, in superconducting NbSe2. Model calculations suggest that the observed anisotropy originates from a selective Doppler-shift-induced E-k dispersion reconstruction. Furthermore, altering the field direction enables on-demand tuning of anisotropic CDW modulations and visualization of their momentum-space distribution. These results highlight a novel mechanism for controlling emergent electronic phases through momentum-space engineering.

cond-mat.supr-con↗
arXiv2026

WebCoach: Self-Evolving Web Agents with Cross-Session Memory Guidance

Multimodal LLM-powered agents have recently demonstrated impressive capabilities in web navigation, enabling agents to complete complex browsing tasks across diverse domains. However, current agents struggle with repetitive errors and lack the ability to learn from past experiences across sessions, limiting their long-term robustness and sample efficiency. We introduce WebCoach, a model-agnostic self-evolving framework that equips web browsing agents with persistent cross-session memory, enabling improved long-term planning, reflection, and continual learning without retraining. WebCoach consists of three key components: (1) a WebCondenser, which standardizes raw navigation logs into concise summaries; (2) an External Memory Store, which organizes complete trajectories as episodic experiences; and (3) a Coach, which retrieves relevant experiences based on similarity and recency, and decides whether to inject task-specific advice into the agent via runtime hooks. This design empowers web agents to access long-term memory beyond their native context window, improving robustness in complex browsing tasks. Moreover, WebCoach achieves self-evolution by continuously curating episodic memory from new navigation trajectories, enabling agents to improve over time without retraining. Evaluations on the WebVoyager benchmark demonstrate that WebCoach consistently improves the performance of browser-use agents across three different LLM backbones. With a 38B model, it increases task success rates from 47% to 61% while reducing or maintaining the average number of steps. Notably, smaller base models with WebCoach achieve performance comparable to the same web agent using GPT-4o.

cs.AI↗
arXiv2026

Cross-Coordinate Correspondence Pruning for Image-to-Point Cloud Registration

Recent detection-free approaches have shown significant efficacy in image-to-point cloud (I2P) registration by employing a coarse-to-fine matching pipeline. In the coarse stage, down-sampled image features and voxelized point cloud features are typically fused to establish initial coarse correspondences for subsequent refinement. However, existing methods largely overlook the critical role of point cloud density, which fundamentally dictates the quality of coarse correspondences and the final registration results. Specifically, excessively sparse point clouds lead to an insufficient number of inliers, while overly dense ones often introduce a high outlier ratio. Consequently, this creates an inherent density trade-off, thereby significantly limiting the registration accuracy of current approaches. For mitigating this trade-off, we propose a novel Cross-Coordinate Correspondences Pruning (CCP) strategy to acquire sufficient inliers while ensuring a low outlier ratio. To minimize interference from inter-modal coordinate discrepancies, we first project cross-coordinate coarse correspondences to the 2D image coordinate system for spatial unification. Subsequently, a lightweight pruning network is responsible for predicting the inlier confidences, which are used to filter coarse outliers, from coordinate geometric and modal feature dimensions. To maximize inlier recall, we further design a Multi-Density Point Ensemble (MDPE) strategy that consolidates and deduplicates pruned coarse correspondences across varying point cloud densities. Our method achieves a significant performance improvement, surpassing existing state-of-the-art methods by at least 8.6% in Registration Recall across various benchmarks.

cs.CV↗
arXiv2026

Process Reward Informed Tree Rollout for Effective Multi-Turn RL

Reinforcement learning (RL) has become a key approach for training LLM agents, yet popular methods such as GRPO/RLOO rely on multiple independently sampled complete trajectories for advantage estimation. In long-horizon agentic tasks, such a uniform rollout strategy can waste budget on uninformative dead-end attempts, while promising intermediate states do not receive sufficient exploration. The multi-turn structure of agentic trajectories, with interleaved actions and observations, naturally supports organizing a trajectory group as a tree, where each turn serves as a decision point for exploration. This perspective reframes effective exploration as the problem of deciding where to branch. We propose Process-Scorer Guided Adaptive Tree Rollout (PATR), a quality-aware rollout framework for multi-turn agent RL. PATR uses task-appropriate process feedback to score partial trajectories, selectively branches from promising states, reuses shared prefixes, and conservatively stops degenerate paths to reduce wasted sampling. The resulting rollout groups remain compatible with standard policy optimization while providing more efficient exploration under the same training budget. We evaluate PATR on FrozenLake and the challenging SWE-Bench, which is largely unexplored by prior tree-rollout agent RL methods. Experiments show that PATR improves performance by up to +5.0 points on SWE-Bench and +9.3 points on FrozenLake, highlighting process-guided tree rollouts as an effective strategy for scalable multi-turn RL.

cs.CL↗
arXiv2026

Radially correlated partially coherent beams with a deterministic vortex structure

Partially coherent beams have attracted considerable attention due to their intrinsic resilience against complex environmental perturbations. However, the intrinsic wavefront fluctuations make it fundamentally challenging to preserve well-defined orbital angular momentum during propagation. In this work, we propose and experimentally demonstrate a class of radially correlated, partially coherent beams that carry deterministic vortex structures, generated via optical conformal mapping from Cartesian to log-polar coordinates. The resulting beams exhibit a ring-shaped coherence distribution, characterized by low coherence in the radial direction and high coherence in the azimuthal direction. This unique feature of such a beam supports a well-defined deterministic vortex phase, thereby enabling the beam to preserve its ring-shaped coherence distribution during propagation through a focusing system. Our results provide new insights into the design of new partially coherent beams and may facilitate the development of applications in optical encoding, free-space information transmission, and ultrafast light-matter interactions.

physics.optics↗
arXiv2026

Towards a General Intelligence and Interface for Wearable Health Data

While ubiquitous wearable sensors capture a wealth of behavioral and physiological information, effectively transforming these signals into personalized health insights is challenging. Specifically, converting low-level sensor data into representations capable of characterizing higher-level states is difficult due to high phenotypic diversity and variation in individual baseline health, physiology, and lifestyle factors. Moreover, collecting wearable data paired with health outcome annotations is laborious and expensive, and retrospective annotation remains practically unfeasible, contributing to a scarcity of data with high-quality labels. To overcome these limitations, we propose a foundation model for wearable health that is pretrained on more than one trillion minutes of unlabeled sensor signals drawn from a large cohort of five million participants. We demonstrate that the joint scaling of model capacity and pretraining data volume leads to systematic improvements in performance, as evaluated on a diverse set of 35 health prediction tasks, spanning cardiovascular, metabolic, sleep, and mental health, as well as lifestyle choices and demographic factors. We find that this population scale representation unlocks label-efficient few-shot learning and generative capabilities for robust daily metric estimation. To further leverage this learned representation, we deploy a classroom of LLM agents to autonomously search the space of downstream predictive heads built on the model embeddings, showing broad performance improvements that increase with LLM model capacity. Finally, we show how integrating these downstream predictors into a Personal Health Agent can support model responses that are more relevant, contextually aware, and safe, and we validate this via 1,860 ratings from a cohort of clinicians.

cs.AI↗
arXiv2026

A fault-tolerant quantum blockchain deployed on commercial telecommunications network

Popularized by the Bitcoin cryptocurrency, blockchain technology establishes a decentralized digital framework that utilizes cryptographic and consensus protocols to secure data against unauthorized modification. Consequently, blockchain has found broad adoption across diverse fields, including finance, data management, healthcare, and digital asset governance. In the quantum computing era, a paramount objective for blockchain is to preserve its foundational advantages of cryptographic integrity and decentralized fault-tolerant resilience. In principle, quantum digital signatures and quantum Byzantine agreement protocols offer foundational security guarantees and tolerate up to one-half of malicious nodes for blockchain. However, the practical realization of such a quantum-enhanced blockchain remains a significant and multifaceted challenge. Here, we propose and experimentally demonstrate a fully operational hybrid quantum blockchain architecture built on photonic integrated circuits and deployed over commercially available classical telecommunications infrastructure. The system achieves a fault tolerance of nearly one-half, surpassing the classical limit, while reaching consensus on a timescale of seconds. A deployed food traceability application validates the practicality of the proposed architecture, achieving a throughput of approximately 500 transactions per second. This work establishes a foundation for practical quantum blockchains, enabling secure, scalable, and decentralized information processing in the emerging quantum era.

quant-ph↗