Search arXiv⌕ Search

arXiv subjects

Chen Xu

Publications and source records attributed to Chen Xu.

At least 19 recordsLinked to original sources

The Gaussian Is Enough: Flow-Matching Priors Do Not Help When Fine-Tuning Large Behavior Models

Modern robot imitation learning increasingly relies on generative policies based on diffusion or flow-matching models, which generate actions by transforming samples from a prior distribution. A key question is whether the choice of prior matters. Replacing the standard Gaussian with a closer-to-target, non-Gaussian prior has been shown to substantially improve performance when training from scratch. A natural next step is to ask whether these gains transfer to fine-tuning pretrained Large Behavior Models (LBMs) such as LBM 1.0, $π_{0.5}$, and GR00T~N1.5, where one might expect even larger gains. Surprisingly, we find that this is not the case, except possibly at very low fine-tuning data fractions. Across over 100K simulation rollouts spanning all three aforementioned LBMs on 40+ tasks in two simulation platforms, and 1250 hardware rollouts on five bimanual manipulation tasks, non-Gaussian priors that are demonstrably closer to the target yield statistically indistinguishable or worse fine-tuning performance than a standard Gaussian prior. Diagnostic analyses suggest why: fine-tuned imitation learning policies converge to similar action predictions across priors, despite their fine-tuned encoder embeddings diverging substantially from the pretrained embeddings and each other. A learning-rate ablation further confirms that encoder training is the dominant factor in fine-tuning performance, substantially outweighing the effect of prior choice. We conclude with concrete directions for future research on when and why learned priors might still matter in fine-tuning. Project page: https://cxu-tri.github.io/non_gaussian_FT/

cs.RO↗

ScaleResfusion: Residual Rectified Flow based on Residual Vector Field

Real-world Image Restoration (Real-IR) aims to recover high-quality (HQ) images from complex and unknown degradations. Recent diffusion-based methods have substantially improved perceptual quality, yet two obstacles remain: methods that sample from Gaussian noise require many steps and are often less faithful to the degraded input, whereas residual-based methods that start from the low-quality (LQ) image typically train task-specific models from scratch, with optimization objectives coupled to a particular noise scheduler, and therefore cannot reuse modern pre-trained generative priors. We present \textbf{ScaleResfusion}, which rewrites residual restoration as a scheduler-independent adaptation interface for pre-trained text-to-image rectified-flow models. Its core, \textbf{Residual Rectified Flow} (RRF), inserts the residual term $R$ into the linear transport path of Rectified Flow, so that sampling starts from noisy LQ at an exact acceleration point, where the signal-to-noise ratio of the starting state is continuously controlled by the residual ratio $γ$. The resulting optimization target, the \textbf{residual vector field}, contains no scheduler-specific coefficients and differs from the pre-trained rectified-flow target only by the residual offset $γR$; adapting a frozen billion-scale backbone therefore reduces to fitting this compact residual correction with LoRA-only training. A knowledge-distillation pipeline built around RRF further reduces sampling to as few as 4 steps. Experiments on real-world super-resolution across multiple benchmarks show that ScaleResfusion achieves state-of-the-art restoration quality and transfers consistently across pre-trained rectified-flow backbones from 2B to 9B parameters.

cs.CV↗

ConversationalVoice: Full-Duplex Speech Data from Real Conversations through Source-Faithful Reconstruction and Conversation-Grounded Expansion

Full-duplex speech models require training data that preserves turn-taking, overlap, interruption, and backchannel behavior, yet these signals are entangled across speakers in noisy real-world recordings. We present Conversational Voice, a pipeline that converts real two-speaker excerpts into three complementary training-data artifacts. (1) Separation recovers speaker-specific tracks with stable speaker assignments, a canonical transcript, and naturally observed interaction timing. (2) Reconstruction generates speech in matched voices from a fixed source transcript, reconstructs the source turn order, pauses, and overlaps, and adds word-level alignment and delivery instructions. (3) Expansion generates new dialogue constrained by the source context, speakers, and observed interaction pattern. Automatic speaker-verification metrics remain strong across stages, with same-speaker similarity of 0.983-0.991 and positive discrimination margins of 0.199-0.209. Predicted speech quality (NISQA MOS) is 3.56 for separation, 4.41 for reconstruction, and 4.61 for expansion. A Gemini-based automatic evaluator assigns expansion mean scores of 4.94/5 for contextual coherence and 4.80/5 for dialogue naturalness. Expansion and reconstruction exhibit broadly similar interaction profiles; expansion's turn, overlap-event, backchannel, and interruption rates are 4.6%, 8.0%, 13.2%, and 16.0% lower, respectively. We evaluate data properties only; downstream gains in full-duplex model training remain for future work.

cs.CL↗

An Elementary Proof of the $\widetilde O(n^{1/3})$ Bound for Separating Words

For two distinct binary words of length $n$, the separating words problem asks for a small deterministic finite automaton that accepts exactly one of them. Chase proved a $\widetilde O(n^{1/3})$ upper bound using a complex-analytic estimate for sparse polynomials. We replace that estimate by a finite-difference argument and a second-order real recurrence cutoff. The resulting elementary proof gives an explicit bound of $O(n^{1/3}(\log n)^{7/3})$ states.

cs.FL↗

Memory Anchors for Continual Robot Learning

Robot policies deployed in the wild should have the capability to continually learn new tasks without forgetting existing behaviors. A common approach to combat such catastrophic forgetting is to train on new task data with a replay buffer of previously learned task data. Although this buffer is commonly sampled randomly from all prior experiences, we show that a small set of these experiences contributes greatly in anchoring past performance. We call these experiences Memory Anchors. We identify Memory Anchors in regions where representations of new-task observations collapse onto those of old-task observations even though the tasks require conflicting actions, like when a familiar object must be manipulated in a new way. Rehearsing old data in this region plays a key role in preventing destructive overwriting of past task knowledge, serving as this critical Memory Anchor role. Excluding only 10% Memory Anchors before sampling the buffer leads to more than a 4.5x increase in catastrophic forgetting on the LIBERO benchmark suites. Conversely, enriching the replay buffer with Memory Anchors can decrease high-conflict task forgetting by 63% and enables successful continual learning of two task sequences on a real robot. Videos and additional visualizations can be found at https://robot-adaptation.github.io/MemoryAnchors

cs.RO↗

Genie Sim 3.0 : A High-Fidelity Comprehensive Simulation Platform for Humanoid Robot

The development of robust and generalizable robot learning models is critically contingent upon the availability of large-scale, diverse training data and reliable evaluation benchmarks. Collecting data in the physical world poses prohibitive costs and scalability challenges, and prevailing simulation benchmarks frequently suffer from fragmentation, narrow scope, or insufficient fidelity to enable effective sim-to-real transfer. To address these challenges, we introduce Genie Sim 3.0, a unified simulation platform for robotic manipulation. We present Genie Sim Generator, a large language model (LLM)-powered tool that constructs high-fidelity scenes from natural language instructions. Its principal strength resides in rapid and multi-dimensional generalization, facilitating the synthesis of diverse environments to support scalable data collection and robust policy evaluation. We introduce the first benchmark that pioneers the application of LLM for automated evaluation. It leverages LLM to mass-generate evaluation scenarios and employs Vision-Language Model (VLM) to establish an automated assessment pipeline. We also release an open-source dataset comprising more than 10,000 hours of synthetic data across over 200 tasks. Through systematic experimentation, we validate the robust zero-shot sim-to-real transfer capability of our open-source dataset, demonstrating that synthetic data can server as an effective substitute for real-world data under controlled conditions for scalable policy training. For code and dataset details, please refer to: https://github.com/AgibotTech/genie_sim.

cs.RO↗

Mechanism Design for Generative Engines: From Exploitation toward Win-Win Outcomes

Generative engines are reshaping the web ecosystem by making citations a key mechanism for allocating attention, attribution, and downstream value. This creates a strategic tension: content providers are incentivized to optimize for model citation, while platforms must preserve answer quality and trustworthy attribution. We show that this tension can escalate into citation wars. In repeated simulations, state-of-the-art generative engine optimization (GEO) attacks adapt to conventional defenses by producing citation-seeking rewrites that degrade document quality and introduce unsupported claims. To study this problem, we formulate the supplier--platform interaction as a repeated Stackelberg game with partial monitoring. A local best-response analysis identifies when citation competition approaches an inert stationary outcome. Motivated by this finding, we propose a platform--creator mechanism called VCR based on verifiable-content rewards. Rather than only penalizing suspicious rewrites, the platform also credits rewrites that surface checkable factual substance, aligning creator incentives with answer trustworthiness. Experiments on three benchmarks show that VCR consistently achieves the largest Net defense-utility score, outperforming the strongest baseline by an average of 12.1 percentage points, and produces a win--win outcome under our empirical equivalence criterion.

cs.LG↗

Spatially Reconfigurable Antenna Systems for 6G: EM-based Channel Modeling, Measurements, and Orientation Design

Spatially reconfigurable antenna systems (SRASs) are recognized as a key physical-layer technology for sixth-generation (6G) systems. By dynamically adjusting each antenna element's spatial configuration, e.g., position and orientation, SRASs can revamp favorable channel conditions for reliable high-rate data transmission. However, in widely adopted channel models, antennas are typically modeled as ideal isotropic radiators, and the vectorial nature of electromagnetic (EM) propagation is neglected. This oversimplified model precludes full exploitation of the degrees of freedom offered by SRASs for performance enhancement. To address this issue, in this paper, by leveraging the theoretical framework of spherical vector wave expansion, we develop an EM-based channel model tailored for SRAS-enabled multiple-input multiple-output (MIMO) systems. The proposed EM-based channel model is applicable to antennas with arbitrary structures and intrinsically accounts for the vectorial nature of EM propagation, thereby enabling accurate characterization of EM effects such as polarization mismatch on channel gain. Full-wave simulations and experimental measurements are conducted, and the results show excellent agreement with theoretical predictions. Simulation results also reveal that antenna orientation exerts a more pronounced influence on the achievable rate than antenna displacement. Therefore, building upon the derived channel model, a manifold optimization method is proposed to maximize the sum-rate of an SRAS-enabled multiuser-MIMO system by optimizing antenna orientations. Simulation results demonstrate that the proposed scheme improves the sum-rate by up to 16.6\% and 19.3\% compared to systems employing movable antennas and conventional fixed antennas, respectively.

eess.SP↗

A RELHIC twin candidate near the galaxy M51

We report the discovery of a pair of H I clouds near M51 (NGC 5194) using the Five-hundred-meter Aperture Spherical radio Telescope (FAST). These clouds have no optical counterparts and are potential candidates for Reionization-Limited H I Clouds (RELHICs). We search for compact H I sources in deep FEASTS observations using SoFiA and remove objects with optical counterparts through cross-matching with the DESI Legacy Imaging Surveys. The remaining candidates are modelled as hydrostatic H I structures embedded in Navarro-Frenk-White dark matter haloes and compared with RELHIC predictions and TNG50 simulations. We identify two H I clouds, Cloud S and Cloud N, at projected distances of 70--90 kpc from M51. Each cloud has an H I mass of approximately 10^6.5 solar masses, a velocity dispersion of about 20 km/s, and no detectable optical counterpart down to a g-band surface brightness limit of approximately 27.5 mag arcsec^-2. Their stellar luminosities are constrained to be below 10^5 solar luminosities. Their H I properties are consistent with RELHIC predictions, corresponding to host halo masses of 3.7 +- 0.4 * 10^9 solar masses. Cloud S and Cloud N are promising but not definitive RELHIC candidates. A tidal origin remains possible in the interacting M51 system, especially because the clouds are unresolved by FAST and Cloud N may show a velocity gradient. Future high-resolution interferometric observations will be crucial for distinguishing between starless dark matter haloes and tidal debris.

astro-ph.GA↗

Power Homotopy for Zeroth-Order Non-Convex Optimizations

The existing method of GS-PowerOpt solves the non-convex optimization problem of the form $\max_{\boldsymbol{x} \in \mathbb{R}^d} f(\boldsymbol{x})$ through maximizing a Gaussian-smoothed surrogate $F_{N,σ}(\boldsymbolμ) = \mathbb{E}_{\boldsymbol{x}\sim\mathcal{N}(\boldsymbolμ,σ^2 I_d)}[e^{N f(\boldsymbol{x})}]$. We analyze the role of the smoothing radius $σ>0$ and identify a limitation of the fixed-$σ$ design used in GS-PowerOpt. Specifically, $σ$ induces an inherent exploration--refinement tradeoff: a larger $σ$ improves global exploration and finite-time surrogate optimization, but may distort the location of the surrogate maximizer; in contrast, a smaller $σ$ better preserves local structure but can weaken gradient signals away from high-value regions. To address this limitation, we propose GS-PowerHP, a power-smoothed homotopy method with an incrementally decaying $σ$ schedule. The proposed mechanism uses larger smoothing radii in early iterations to maintain informative gradient signals when the iterate is far from high-value regions, and gradually decreases $σ$ to improve local refinement near the maximizer. We provide theoretical results showing that this decaying schedule improves the exploration--refinement tradeoff of fixed-$σ$ power smoothing. Empirically, GS-PowerHP consistently outperforms the fixed-$σ$ baseline and exhibits robust performance across different optimization tasks, including adversarial attacks on ImageNet ($d=150{,}528$), where it substantially improves over other smoothing-based zeroth-order methods.

math.OC↗

Ising superconductivity and anomalous metallic states in a bulk crystal with artificial unidirectional stacking layers

The two-dimensional (2D) limit in macroscopic bulk crystals provides a powerful platform for exploring exotic quantum phases. Here, we report the synthesis of a Sr0.75ClNbS2 superconductor that achieves unidirectional, parallel AA stacking-a configuration never before realized in a bulk crystal. Unlike conventional intercalation, which merely expands the interlayer spacing, our approach employs a planar Sr-Cl network to enforce a complete stacking reorganization, driving all NbS2 layers from the native antiparallel AB stacking into a unidirectional, parallel AA arrangement. This stacking switch globally breaks inversion symmetry, transforming centrosymmetric 2H-NbS2 into a noncentrosymmetric bulk crystal with D3h point group symmetry. Crucially, this structural design reproduces, in three dimensions, the electronic environment of an isolated monolayer, thereby preventing cancellation of the local Ising fields. As a result, strong Ising spin-orbit coupling and spin-split bands persist throughout the bulk. Transport measurements reveal extreme superconducting anisotropy (γ ~ 77), an in-plane upper critical field (~ 10.65 T) that far exceeds the Pauli paramagnetic limit, and clean-limit superconductivity indicative of high crystalline quality. Moreover, magnetotransport uncovers a novel magnetic-field-induced anomalous metallic state characterized by finite dissipation yet a vanishing Hall response. Direct band-structure measurements corroborate the layer-decoupled, quasi-2D electronic nature of the system. This work establishes stacking-geometry engineering as a powerful strategy to artificially enforce a globally noncentrosymmetric, quasi-2D superconducting state in bulk crystals, paving the way for designing quantum materials with tunable crystalline symmetry and electronic band topology.

cond-mat.supr-con↗

Local Flow Matching Generative Models

Flow Matching (FM) is a simulation-free method for learning a continuous, invertible flow that interpolates between two distributions, and in particular generates data from noise. Inspired by the variational nature of the diffusion process as a gradient flow, we introduce a stepwise FM model, Local Flow Matching (LFM), which sequentially learns a sequence of FM submodels, each matching a diffusion process up to the time-step size in the data-to-noise direction. In each step, the two distributions to be interpolated by the sub-flow model are closer than those in the full-flow matching model, which interpolates data to noise distributions, enabling smaller models with more efficient training. This variational perspective also allows us to prove a theoretical generation guarantee for the proposed flow model in terms of the $χ^2$-divergence between the generated and true data distributions, leveraging the contraction property of the diffusion process. In practice, the stepwise structure of LFM is naturally amenable to model distillation, and various distillation techniques can be applied to accelerate generation. We empirically demonstrate that LFM achieves competitive generative performance compared to FM on unconditional generation of tabular and image datasets, and on conditional generation of robotic manipulation policies.

stat.ML↗

SPRI: SVD-Partitioned Residual Initialization for Data-Constrained MoE Upcycling

Mixture-of-Experts (MoE) models enable efficient scaling, but training them from scratch remains prohibitively expensive. MoE upcycling mitigates this cost by converting pretrained dense models into sparse MoE models. However, existing upcycling methods typically rely on large-scale continued training and often perform poorly under data-constrained supervised adaptation, due to either homogeneous experts or overly disruptive perturbations to pretrained parameters. In this setting, effective upcycling must leverage pretrained weight structure while introducing sufficient diversity among routed experts. To this end, we propose SVD-Partitioned Residual Initialization (SPRI), which distributes SVD-partitioned residuals derived from pretrained feed-forward network (FFN) weights across routed experts, introducing controlled expert diversity grounded in pretrained spectral structure. We further introduce a two-stage training strategy to improve adaptation stability. We evaluate SPRI on multilingual speech-to-text translation, where limited supervised data challenges MoE upcycling and multiple target languages provide natural routing heterogeneity. On CoVoST2 across 15 En-to-XX directions, SPRI improves average BLEU and COMET over fully fine-tuned dense models by 2.58 and 3.32 points, respectively, and outperforms the prior best MoE upcycling baseline by 3.39 BLEU and 4.34 COMET points.

cs.LG↗

Towards Iterative End-to-End Software Development: A Feature-Driven Multi-Agent Framework

Recent advances in large language model agents offer the promise of automating end-to-end software development from natural language requirements. However, existing approaches largely adopt linear, waterfall-style pipelines, which oversimplify the iterative nature of real-world development and struggle with complex, large-scale projects. To address these limitations, we propose EvoDev, an iterative software development framework inspired by feature-driven development. EvoDev decomposes user requirements into a set of user-valued features and constructs a Feature Map, a directed acyclic graph that explicitly models dependencies between features. Each feature node in the feature map maintains multi-layer contexts, including business logic, software design, and code implementation, which are propagated along dependencies to provide context for subsequent development iterations. We evaluate EvoDev on challenging Android development tasks and show that it outperforms the best-performing baseline, Claude Code, by 57.3%, while improving single-agent performance by 16.0%-58.5% across different base LLMs, highlighting the importance of feature decomposition, dependency modeling, context propagation, and workflow-aware agent design for end-to-end software development. Moreover, our work summarizes practical insights for designing iterative, LLM-driven development frameworks and informs future training of base LLMs to better support iterative software development.

cs.SE↗

HiFAST: An HI data calibration and imaging pipeline for the FAST IV: The stray-radiation correction

Stray radiation is a considerable challenge for radio telescopes, requiring careful assessment due to its effects. This is crucial when the strong background flux from side lobes significantly affects the total flux, especially for extended sources. In this study, we introduced the beam pattern of the L-band receiver on the Five-hundred-meter Aperture Spherical Telescope (FAST), covering various frequencies based on recent observations. We discovered that the main beam efficiency of all beams exceeds 90\% throughout the L band frequencies, with efficiency decreasing slowly as frequency increases. Subsequently, we developed a module to mitigate stray radiation effects, incorporating it into FAST's standard \HI data reduction process, referred to as \texttt{HiFAST}. Our analysis shows that side lobe flux's influence, particularly for extended sources with significant surface density gradients, necessitates detailed evaluation. Corrections for the extended M33 galaxy can reach up to 20\%. Moreover, the pattern data presented here is vital for studying HI intensity maps at high redshift. The module, along with HiFAST and beam pattern data across 15 frequency bins, can be accessed at \textrm{https://hifast.readthedocs.io}. The datasets of beam pattern presented in this paper, are openly available at \textrm{https://doi.org/10.57760/sciencedb.j00113.00266} (https://www.scidb.cn/s/bqQRNv).

astro-ph.IM↗

The FAST Hundred-Deg$^2$ HI Deep (HD$^2$) Survey: Early Results from the Pilot Survey

The Hundred-deg$^2$ HI Deep (HD$^2$) survey carried out with the Five-hundred-meter Aperture Spherical Telescope (FAST) is planned to map a contiguous region within the DESI DR1 footprint, achieving an effective integration time of 20 minutes for each pointing and a uniform detection sensitivity of 0.28 mJy beam$^{-1}$ at 4.8 km s$^{-1}$ resolution. We present early results from the pilot HD$^2$ survey: a 10 deg$^2$ field overlapping with HSC-SSP and the DESI EDR SV3, observed with an integration time of 7.3 minutes per beam and the rms of 0.45 mJy beam$^{-1}$ at 4.8 km s$^{-1}$ resolution. We identify 339 HI sources at $z<0.09$, corresponding to $\sim$34 detections per deg$^2$, nearly six times higher than the detection rate of the wide-field surveys. Optical counterparts are primarily identified using DESI redshifts, yielding a matching rate and correctness exceeding 90% for galaxies with $r<19.5$ mag, a substantial improvement over SDSS. Under the constraint of $r < 17.8$ mag and $0.01 < z < 0.05$, nearly 50% of galaxies in the DESI BGS samples have HI detections in this pilot survey. The optical properties of these HI-detected galaxies span nearly the entire parameter range of the DESI sample. The gas fraction scaling relations versus stellar mass, stellar mass surface density, NUV-r, and specific star formation rate are consistent with previous surveys, e.g., ALFALFA, DINGO, and xGASS. These results justify the feasibility of the full HD$^2$ survey, which will build a high-completeness HI census over a contiguous area to probe the cold gas scaling relations of galaxies over different scales.

astro-ph.GA↗

Entanglement Growth from Structured Initial States in Many-Body Localized Systems

Understanding how complex entanglement structures emerge is a central problem in quantum many-body physics. Recent work by Zhang et al. has considered structured initial states prepared by evolving a product state under a chaotic Hamiltonian for a finite time before quenching to the target Hamiltonian. In this setup, total entanglement entropy growth in many-body localized systems exhibits two distinct regimes, first increasing and then decreasing as the initial entanglement is tuned. In this work, we identify the physical origin of this behavior by analyzing the dynamics of both the Rényi entanglement entropy and the Wehrl-Rényi entropy in the random-field XXZ model, the latter of which characterizes multipartite entanglement. We show that a similar non-monotonic dependence on the initial entanglement also appears in the net growth of the Wehrl-Rényi entropy for product states polarized along the $z$-direction. The first regime is governed by a finite magnetization associated with local integrals of motion, while the second reflects inter-site correlations. In contrast, for product states in the $x/y$-direction, the entanglement growth exhibits a monotonic decay. Our results provide a more fine-grained picture of how distinct initial-state properties shape entanglement dynamics in many-body localized systems.

quant-ph↗

How hate spreads online and why it returns: Re-entrant phases driven by collective behavior

The 2025 Bondi Beach mass-shooting was perpetrated by individuals inspired by ISIS (Islamic State) propaganda that increasingly featured anti-Semitic hate content following the October 2023 start of the Israel-Palestine war. Similar stories hold for other types of hate attacks, e.g. against Muslims on May 18, 2026. There is an urgent need to get ahead of future threats by understanding how and when a newly created piece of hate content will spread system-wide online. We present a two-species coalescence-fragmentation model with Susceptible-Infected-Recovered dynamics that incorporates the following published empirical features: (1) New pieces of hate content tend to be generated and promoted by a subset of in-built communities on less regulated platforms. (2) These `hate' communities create links (hyperlinks) with each other and with non-hate communities across all platforms to form dynamically evolving clusters (i.e. coalescence) across which new hate content can then spread. (3) These clusters can get broken up by moderator shutdowns (i.e. fragmentation). We present numerical solutions and derive two levels of approximate mean-field theory: Effective Medium Theory (EMT) and Beyond Effective Medium Theory (BEMT). Both numerical and analytic solutions reveal that system-wide spreading is governed by re-entrant threshold phases: as the fraction of hate communities varies, the system can transition from spreading to no-spreading and back to spreading. The derived analytic formulae give explicit insight into how these phase boundaries might be manipulated to prevent system-wide spreading. More broadly, the re-entrant phase behavior warns that policies which steadily reduce the number of hate communities can initially succeed but then backfire if pushed further, suggesting that blanket requirements for platforms to simply do `more' are over-simplistic.

physics.soc-ph↗