Searcharxiv⌕ Search

arXiv subjects

Xin Zhang

Publications and source records attributed to Xin Zhang.

At least 91 records · Page 5Linked to original sources

Observation of magnetic quantum phase crossovers in a semiconductor spin ladder

Understanding collective phases of strongly correlated quantum magnets relies on theoretically tractable model systems with precise microscopic control. Antiferromagnetic spin ladders provide such a setting, hosting field-tunable gapped and gapless phases at half filling and unconventional pairing tendencies upon doping. Here, we realize a programmable Heisenberg spin ladder in a half-filled germanium quantum dot array featuring site-resolved, continuously tunable exchange interactions. Under a fixed magnetic field, we vary the rung and leg coupling to map the rung-singlet, canted antiferromagnetic, and fully polarized phases. Hamiltonian-learning protocols combining equilibrium and dynamical measurements quantitatively characterize the ladder, incorporating spin-orbit interactions to reproduce the observed crossover behavior. Measurements of higher-order spin correlators -- including four-point correlations inaccessible to conventional bulk probes -- reveal signatures of the underlying phase structure despite the finite size. Our results establish germanium quantum dot arrays as a controllable platform for quantum magnetism, opening routes to investigate unconventional superconductivity in doped ladders.

cond-mat.mes-hall↗

STAGE: Controlled Objective Admission for Multi-Preference LLM Alignment

Multi-preference alignment is often framed as scalarization: combine reward dimensions, then optimize. This leaves a temporal decision underspecified: when should each preference dimension enter policy optimization? We propose \methodname, a stability-guided active-set controller for controlled objective admission. \methodname starts from a small active set, retains admitted objectives, and expands when reward-deviation gates indicate low recent deviation or a patience budget is exhausted. A probing phase estimates a hard-to-easy order, and adaptive weighting emphasizes underperforming active dimensions. Automatic evaluations with 15 training preferences and 16 held-out benchmark columns show that \methodname obtains higher averages than simultaneous scalarization and shared-budget adapted baselines. Component ablations and expansion dynamics further support cumulative retention, gated admission, and probing-derived ordering as useful design choices in this setting. These results position objective-entry timing as a concrete control variable in reward-vector RLHF.

cs.CL↗

CityRiSE: Reasoning Urban Socio-Economic Status in Large Vision-Language Models via Reinforcement Learning

Urban socio-economic sensing plays a vital role in advancing global sustainable development goals. With the advent of Large Vision-Language Models (LVLMs), new opportunities have emerged to address this challenge by framing it as a multi-modal perception and reasoning task. However, recent studies show that LVLMs still struggle to make accurate and interpretable socio-economic predictions from visual data. To overcome these limitations and fully exploit the potential of LVLMs, we propose CityRiSE, a novel framework for Reasoning urban Socio-Economic status in LVLMs via reinforcement learning (RL). With carefully curated multi-modal dataset and verifiable reward design, our approach guides the LVLM to focus on semantically meaningful visual cues, enabling structured and goal-oriented reasoning for generalist socio-economic status prediction. Experiments demonstrate that CityRiSE, equipped with emergent reasoning, significantly outperforms existing baselines, improving both prediction accuracy and generalization across diverse urban contexts, especially on unseen cities and unseen indicators. This work highlights the promise of combining RL and LVLMs for interpretable and generalist urban socio-economic sensing.

cs.CV↗

ARC: Fair Relative Advantage Comparison in Open-Ended Real-World Interaction

Open-ended real-world interaction admits multiple valid behaviors: an agent may answer directly, ask for clarification, provide progress updates, or confirm before acting. This flexibility breaks a core assumption behind group-based RL: rollouts compared within a group are no longer guaranteed to be behaviorally comparable. As a result, reward-model preferences over interaction style can distort relative advantages and steer optimization toward reward-preferred behaviors rather than context-appropriate ones. We formalize this as a \textit{reward fairness problem} and propose \textbf{ARC} (Advantage Regularization via Conditioning), a training recipe that restores fairer relative comparison through strategy-conditioned rollout grouping, together with hybrid rewards and entropy regularization. We study ARC in our proposed \inter, a novel paradigm for responsive, steerable, and execution-aware user-agent interaction that decouples user-visible communication from latent reasoning and tool use. \inter\ also provides the annotation and distillation pipeline for constructing \inter-86K, our strategy-annotated training corpus for supervised and RL training. Empirically, ARC substantially strengthens the core $τ/τ^2$ tool-use benchmarks, while \inter\ reduces time-to-first-token from 4.91s to 1.27s relative to a think-style baseline. Together, these results suggest that a central bottleneck in open-ended interactive learning is not only how agents are rewarded, but whether their behaviors are compared fairly in the first place. The ARC implementation and \inter-86K training data will be released.

cs.AI↗

Hierarchical Sensor-Spoofing Defence Framework for Networked DC Microgrids via Cyber-Physical Coordination

In parallel to the cyber attack that manipulates the reference points of distributed energy resources (DERs) by maliciously accessing the remote monitoring and control system, the vulnerability of voltage/current sensors to electromagnetic interference (EMI) in the physical domain has been widely discussed. Existing research efforts against sensor spoofing attacks can be classified into physical prevention and cyber detection/mitigation. These defence methods each have strengths and weaknesses in balancing cost, security, and performance in a single DER, yet systematic research on their multi-layer efficient coordination across DERs remains limited. Towards this end, this paper proposes a hierarchical framework to detect and mitigate sensor spoofing attacks in networked microgrids (NMGs) via {multi-layer cyber-physical coordination}. It requires only to deploy physical prevention technologies at critical points, i.e., the local points of common coupling (PCC) of MGs, such that cyber detection/mitigation algorithms can be adopted based on the secured sensor readings to counter sensor spoofing attacks in DERs. The framework employs an MG-DER coordinated proactive detection scheme to strategically trigger parameter perturbations, under which the intelligent sensor spoofing attacks can be {effectively} disclosed. Afterwards, mitigation schemes based on MG-DER coordination are activated to recursively and accurately estimate sensor biases. Experiments on a cyber-physical DC NMG testbed confirm the framework's effectiveness across diverse attack scenarios.

eess.SY↗

Nonminimally coupled quintessence with sign-switching interaction

We propose a new nonminimally coupled quintessence model to account for the late-time dark energy dynamics indicated by recent Dark Energy Spectroscopic Instrument (DESI) measurements. Within this framework, the quintessence density begins to decrease only when it starts to dominate the Universe, which naturally accounts for the late-time onset of dark energy weakening. The coupling also induces a sign change in the effective energy transfer between dark matter and dark energy during cosmic evolution. While the scalar field itself remains canonical and never crosses the phantom divide, the modified evolution of the dark matter density gives rise to an effective crossing behavior in the observationally inferred dark energy sector. Compared with both $Λ\mathrm{CDM}$ and $w_0w_a\mathrm{CDM}$ models, our model is favored more strongly by current cosmological data. This work may provide a promising avenue for understanding the observational late-time weakening of dark energy and the origin of its dynamics.

astro-ph.CO↗

Diagnosis Before Recovery: Turning Agent Failures into Selective Self-Correction

Self-correction is particularly useful when a failure constrains the next repair. Coding agents benefit from this property because compilers, tests, and execution traces turn many failures into typed recovery signals, but broad language-agent tasks often expose only a coarse task failure. This creates a tension for generic recovery playbooks: they broaden the agent's context precisely when the system needs a narrower repair interface, mixing incompatible signals for invalid actions, missing procedures, and strict-format errors. Our insight is that development-set failures can recover part of the missing diagnostic substrate by deciding which recovery interventions are admissible before test-time correction. We propose DARC, a diagnosis-guided recovery harness that profiles task-family failure modes, prunes mismatched interventions from a shared recovery library, and freezes a verifier-selected success-cost policy for deployment. This causal order makes correction selective: the harness first determines what kind of failure can be repaired, then decides how much recovery evidence to spend. In ALFWorld, AppWorld, and XBRL Finance, the same protocol yields an action-validity harness, a procedural-recovery fallback, and a format-precision retrieval policy; in each evaluated setting it improves average task performance over base agents and broad playbooks while reducing environment steps or retrieval budget. Our experiments show that failures need not trigger uniformly more context: DARC turns self-correction from prompt expansion into recovery-interface design. DARC provides a practical route toward more reliable agents in domains where compiler-like feedback is absent: making failures actionable before making contexts larger.

cs.CL↗

TimePre: Bridging Accuracy, Efficiency, and Stability in Probabilistic Time-Series Forecasting

We propose TimePre, a simple framework that unifies the efficiency of Multilayer Perceptron (MLP)-based models with the distributional flexibility of Multiple Choice Learning (MCL) for Probabilistic Time-Series Forecasting (PTSF). Stabilized Instance Normalization (SIN), the core of TimePre, is a normalization layer that explicitly addresses the trade-off among accuracy, efficiency, and stability. SIN stabilizes the hybrid architecture by correcting channel-wise statistical shifts, thereby resolving the catastrophic hypothesis collapse. Extensive experiments on six benchmark datasets demonstrate that TimePre achieves state-of-the-art (SOTA) accuracy on key probabilistic metrics. Critically, TimePre achieves inference speeds that are orders of magnitude faster than sampling-based models, and is more stable than prior MCL approaches.

cs.LG↗

Generalized Integrable Boundary States in XXZ and XYZ Spin Chains

We investigate integrable boundary states in the anisotropic Heisenberg chain under periodic or twisted boundary conditions, for both even and odd system lengths. Our work demonstrates that the concept of integrable boundary states can be readily generalized. For the XXZ spin chain, we present a set of factorized integrable boundary states using the KT-relation, and these states are also applicable to the XYZ chain. It is shown that a specific set of eigenstates of the transfer matrix can be selected by each boundary state, resulting in an explicit selection rule for the Bethe roots. We also derive the overlaps between integrable boundary states and Bethe states in the U(1)-symmetric cases.

hep-th↗

NeuroBridge: Bridging Multi-Task MRI Knowledge for Neurodegenerative Disease Diagnosis

Accurate MRI-based identification of Alzheimer's disease (AD), mild cognitive impairment (MCI), and related dementias remains challenging because disease-related structural changes are often subtle and heterogeneous. We developed NeuroBridge, a clinically guided multi-task MRI framework for neurodegenerative disease diagnosis. NeuroBridge integrates large-scale self-supervised MRI pretraining with hippocampal segmentation, hippocampal atrophy classification, and reconstruction objectives, followed by gated fusion fine-tuning. Performance was evaluated across ADNI and OASIS cohorts, including cross-cohort transfer, probability-based analysis, and opportunistic screening. NeuroBridge achieved the highest performance across evaluated classification tasks, reaching 88.17% accuracy for AD versus cognitively normal controls in ADNI and 82.78% in OASIS. The largest gains occurred in MCI-related and mixed-diagnosis settings. The framework demonstrated strong cross-cohort generalization, systematic associations between predicted-class probability and accuracy, and the feasibility of probability-based opportunistic screening. Clinically guided multi-task representation learning improves neurodegenerative MRI diagnosis beyond conventional single-task approaches. NeuroBridge provides a robust and scalable framework for dementia assessment and MRI-based opportunistic screening.

cs.LG↗

SHE: Trajectory-driven Safety Harness Evolution for LLM Agents

The safety of large language model (LLM) agents depends not only on model weights but also on the agent harness that manages context, memory, tools, permissions, and runtime control. Existing safety mechanisms often treat the harness as a fixed deployment artifact, limiting their ability to evolve with emerging risks. Moreover, coupled functions across harness components obscure safety responsibility attribution, making localized evolution difficult. We propose Safety Harness Evolution (SHE), a framework that learns evolving safe boundaries from rollout trajectories. SHE decomposes the harness into four artifacts with explicit safety responsibilities, including the System Prompt, Rule Bank, Safety Memory, and Tool Policy, defining clear functional boundaries for localized evolution. Based on this decomposition, SHE introduces an attribution-guided evolution loop that converts trajectory failures into structured diagnoses, learns artifact-specific boundary refinements, and selects evolved harnesses through safety-utility validation. Experiments on Agent-SafetyBench demonstrate that SHE effectively enhances safety through harness evolution, achieving a 3.1x ASR reduction compared with static SafeHarness, while also improving benign utility. The evolved harness further generalizes to unseen risks on the held-out AgentHarm benchmark and transfers across agent models without additional evolution.

cs.AI↗

Conditional variational autoencoders for cosmological model discrimination and anomaly detection in cosmic microwave background power spectra

The cosmic microwave background power spectra are a primary window into the early universe. However, achieving interpretable compression and fast inference diagnostics under weak model assumptions remains challenging. We propose a parameter-conditioned variational autoencoder (CVAE) that aligns a data-driven latent representation with cosmological parameters while retaining an interface to likelihood-style diagnostic tests. The model achieves high directional reconstruction fidelity for the $D_\ell^{TT}$, $D_\ell^{EE}$, and $D_\ell^{TE}$ spectra in just 5 latent dimensions. It reconstructs spectra for several beyond-$Λ$CDM test cases, including controlled parameter extrapolations, and enables an amortized surrogate diagnostic that reduces one representative post-training MCMC run from $\sim$40 hours on CPU cores to $\sim$2 minutes on a GPU in this demonstration. The learned latent space shows a distributed, partially structured organization that mirrors known cosmological parameters and their degeneracies. It also provides representation-space discrimination diagnostics for distinguishing tested cosmological spectra from a fiducial reference. Overall, this physics-informed CVAE supports interpretable compression, rapid diagnostic exploration, and anomaly-sensitive representation learning beyond $Λ$CDM.

astro-ph.CO↗

Interior geometry of black holes as a probe of first-order phase transition

Traditional diagnostics of black hole phase transitions rely on thermodynamic quantities defined at the event horizon or asymptotic boundary. Here, we demonstrate that the near-singularity geometry offers a sharp, independent probe of both first-order phase transitions and supercritical crossover. For scalarized AdS black holes exhibiting a first-order phase transition, the Kasner exponent $p_t$, which characterizes the approach to the singularity, undergoes a dramatic transformation. On one side of the transition, $p_t$ oscillates strongly with temperature, reflecting violent interior dynamics. On the other side, it becomes a smooth, monotonically varying function. These two distinct behaviors converge as the critical point is approached. Beyond the critical point, in the supercritical region, $p_t(T)$ develops a distinct extremum, defining a Kasner crossover line that is entirely independent of traditional thermodynamic (Widom line) or dynamic (Frenkel line) criteria. Our work establishes the near geometry of singularity of scalarized black hole as a novel class of diagnostics for phase transitions, revealing that a change in the macroscopic thermodynamic state fundamentally reshapes the deepest interior structure of spacetime.

gr-qc↗

Is Personalized Modality Weighting Actually Personalized? A Controlled Audit of Per-User Weighting Claims in Multimodal Recommenders

Per-user modality weighting is deployed at billion-user scale in multimodal recommenders, through user modality-strength vectors, attention gates, meta-weight hypernetworks, and low-rank guided weights, each claiming a ranking gain from user-specific modality preference. Yet, to our knowledge, prior evaluations do not isolate a genuinely user-specific signal from a global modality weight plus model capacity. We audit this family with a two-contrast audit principle, reducing six implementations onto one shared collaborative backbone and measuring a utility gap (real-GM) against a single global modality weight and an identifiability gap (real-shuf) against an eval-time permutation of the user-weight binding. Across three independent short-video corpora, a single global weight already delivers nearly all of the content gain (+1.9/+3.6/+3.5pp over a no-modality baseline, p < .001). Making the weight per-user adds no consistent utility: no implementation wins on all corpora and metrics, and the few positive gaps are small (<=0.9pp) and flip. The shuffle control is necessary but not sufficient, since real-shuf reaches +128% of the content gain for heads that simultaneously lose to the global weight. We trace this dissociation to gates reading the shared collaborative embedding: decoupling the gate input collapses the inflated real-shuf to near zero while the utility conclusion stands. A monotone signal-implant dose-response (capture AUROC rising from 0.57 to 0.89 and from 0.64 to 1.00) verifies the harness would detect user-specific structure if present, and every finding replicates on a fourth, cross-domain e-commerce corpus. We propose reporting real-GM alongside real-shuf as a minimum evidentiary standard for personalization claims.

cs.IR↗

Joint constraints on cosmic birefringence and early dark energy from ACT, Planck, DESI, and PantheonPlus

With the increasing number of high-precision astronomical observations, physical quantities that were previously inaccessible to accurate calculations, such as cosmic birefringence, have once again become a focal point of interest. Such phenomena induce a nonvanishing cross-correlation between the $E$- and $B$-mode polarizations of the cosmic microwave background (CMB), thereby providing a direct observational signature of parity violation. The Chern-Simons coupling between the scalar field in early dark energy (EDE) models and CMB photons is regarded as a plausible mechanism for generating cosmic birefringence. Recent data from the Atacama Cosmology Telescope (ACT) deliver $EB$ measurements at higher multipole moments than those previously achieved by {Planck}, while DESI and PantheonPlus datasets provide new and stringent constraints on the late-time expansion history. Using a joint analysis of {Planck}, DESI DR1, Pantheon+, and ACT data, we perform a full-parameter constraint on the cosmic birefringence effects induced by the EDE-CMB photon coupling. Our results favor a higher Hubble constant, $H_0 = 76.9^{+2.9}_{-2.5}\,\rm km\,s^{-1}\,Mpc^{-1}$, and a relatively large EDE fraction, $f_{\mathrm{EDE}} = 0.232^{+0.074}_{-0.047}$. By comparing the cosmological evolution of this model across different data combinations, we find that the ACT-$EB$ data combined with {Planck} + DESI + PantheonPlus provide good constraints to both early- and late-Universe observations.

astro-ph.CO↗

STAGE: A Full-Screenplay Benchmark for Reasoning over Evolving Stories

Movie screenplays are a demanding testbed for long-form narrative understanding, as characters' goals, beliefs, knowledge, and relationships evolve continuously across scenes. However, existing benchmarks primarily evaluate isolated facts from the completed screenplay, leaving unassessed whether models can track the evolving state of characters as the story unfolds. We introduce STAGE, a benchmark over 151 English and Chinese full-length screenplays, built on a provenance-linked narrative backbone that recovers the state and epistemic access of each character at every point along its timeline. Three tasks derived from the backbone jointly probe whether models can maintain, explain, and act on evolving narrative state: Character Development Tracking updates a focal character's state between checkpoints, Cross-Scene Narrative Evolution Reasoning targets cross-scene state transitions, and In-Script Character Role-Playing requires responses bounded by the character's state and knowledge at a specified point. We identify three failure modes of current LLMs: silent forgetting under recursive state updating, limited cross-scene reasoning even when all relevant evidence is supplied, and a trade-off in role-playing where stylistic character fidelity and screenplay-grounded memory faithfulness are optimized by different memory-access strategies. STAGE thus provides a unified framework for diagnosing how current models fail to track, reason about, and enact story evolution.

cs.CL↗

MoWorld: A Flash World Model

The future of World Models depends not only on scaling model capability, but also on scaling practicality and inference efficiency. High-frame-rate inference enables responsive perception, planning, and control in real-world autonomous systems. To this end, we present MoWorld, a cost-effective yet high-performance Flash World Model with an end-to-end framework spanning data generation, pre-training, distillation, and efficient inference, enabling up to 50 FPS real-time interaction with cinematic visual quality without the need of high-end GPUs. To enable large-scale real-world deployment, MoWorld jointly optimizes model capability and cost throughout the entire development pipeline. Specifically, unlike existing approaches that primarily rely on large-scale video corpora, MoWorld is built upon a scalable 3D-native data engine accumulated from our large-scale 3D vision and generative modeling pipeline, enabling the efficient construction of geometrically consistent training data across diverse real-world and synthetic environments. Based on this foundation, a curriculum cross-frame pre-training strategy for stable and scalable World Model learning, an efficient denoising-step distillation algorithm to reduce diffusion training cost, and a mixed-precision parallel inference framework for low-cost real-time deployment. MoWorld is the first real-time interactive World Model built on the Neural Processing Unit (NPU) and can achieves up to 50 FPS in such the devices, enabling practical and efficient deployment at scale. Comprehensive evaluations demonstrate that MoWorld achieves leading performance; notably, its average inference cost is only 30\%-50\% of that of existing World Models, providing a practical foundation for large-scale real-world applications of World Models. We also demonstrate diverse applications of MoWorld.

cs.CV↗

Quantitative Particle Approximation for Controlled Nonlinear Filtering

We estimate convergence rates of value functions for particle approximations of a controlled nonlinear filtering problem. The state is a McKean--Vlasov diffusion on the flat torus, driven by hidden idiosyncratic noise and observed common noise. The filter---the conditional law of the state given the observations---serves as the state variable of the control problem, and the associated value function solves a second-order Hamilton--Jacobi--Bellman equation on the Wasserstein space. We approximate this problem by a centralized \(N\)-particle control problem with independent idiosyncratic noises and a common observation noise. The framework accommodates nonseparable rewards and controlled drifts. Since a single control is applied to the entire population, the Hamiltonian is defined by an optimization performed after integration over the population. Under smoothness of the data, uniform ellipticity, and regularity of this Hamiltonian, we establish uniform value-function error bounds of order \(N^{-1/6}\) for \(d=1\), \(N^{-1/6}(\log N)^{1/3}\) for \(d=2\), and \(N^{-1/(3d)}\) for \(d>2\). The proof combines a translation lift in the common-noise direction, Fourier--Wasserstein inf- and sup-convolutions, viscosity comparison, and particle derivative estimates uniform in \(N\).

math.OC↗