arXiv subjects

Xi Chen

Publications and source records attributed to Xi Chen.

At least 199 records · Page 11Linked to original sources

arXiv2026

Toward Personalized Darts Training: A Data-Driven Framework Based on Skeleton-Based Biomechanical Analysis and Motion Modeling

As sports training becomes more data-driven, traditional dart coaching based mainly on experience and visual observation is increasingly inadequate for high-precision, goal-oriented movements. Although prior studies have highlighted the importance of release parameters, joint motion, and coordination in dart throwing, most quantitative methods still focus on local variables, single-release metrics, or static template matching. These approaches offer limited support for personalized training and often overlook useful movement variability. This paper presents a data-driven dart training assistance system. The system creates a closed-loop framework spanning motion capture, feature modeling, and personalized feedback. Dart-throwing data were collected in markerless conditions using a Kinect 2.0 depth sensor and an optical camera. Eighteen kinematic features were extracted from four biomechanical dimensions: three-link coordination, release velocity, multi-joint angular configuration, and postural stability. Two modules were developed: a personalized optimal throwing trajectory model that combines historical high-quality samples with the minimum jerk criterion, and a motion deviation diagnosis and recommendation model based on z-scores and hierarchical logic. A total of 2,396 throwing samples from professional and non-professional athletes were collected. Results show that the system generates smooth personalized reference trajectories consistent with natural human movement. Case studies indicate that it can detect poor trunk stability, abnormal elbow displacement, and imbalanced velocity control, then provide targeted recommendations. The framework shifts dart evaluation from deviation from a uniform standard to deviation from an individual's optimal control range, improving personalization and interpretability for darts training and other high-precision target sports.

cs.LG↗

arXiv2026

Tracking Protostellar Variability in Massive Protoclusters with ALMA: I. Insights from QUARKS and MaMMOtH

Millimeter/submillimeter variability is often attributed to dynamical disk-mediated accretion, yet detection is limited to low-mass protostars in nearby clouds. Recent observations have also revealed significant (sub)millimeter variability in high-mass protostars, but the confirmed cases are scarce and lack systematic monitoring. In this work, we analyzed multi-epoch Atacama Large Millimeter/submillimeter Array (ALMA) Band 6 (1.3 mm) continuum observations of 22 massive protoclusters, with epoch separations ranging from a few hours to more than two years, while achieving a consistent angular resolution of approximately 0.3 arcsec. These data allow us to track variability of protostars across a broader mass range and in an environment markedly different from nearby clouds. Using a custom processing pipeline for data reduction, image alignment, and relative flux calibration, we achieve high-precision flux measurements and, for the first time, investigate millimeter variability in massive protoclusters based on interferometric data in a statistical manner. Applying the astrodendro algorithm, we identified 383 condensations and tracked their variations in peak intensities. Standard deviation analysis and difference maps reveal five variable sources, corresponding to a lower limit of 1.3% on the variable fraction. Among these, I13111-6228 stands out as it hosts a hypercompact H II region that exhibits a 68% increase in continuum peak intensity over one year, with an uncertainty of 2%.

astro-ph.GA↗

arXiv2026

Tentative Detection of the Glycine Isomer Glycolamide in Hot Molecular Core

Understanding whether prebiotic molecules can endure and reform through the energetic stages of star formation is essential for tracing the continuity of interstellar chemistry toward life. Glycolamide, an isomer of glycine, was recently detected in the molecular cloud G+0.693-0.027. However, establishing its presence in warm, high-density environments is crucial to evaluate the chemical continuity of amides. Here we report the tentative detection of glycolamide in a hot molecular core, G358.93-0.03 MM1, using ALMA 1 mm observations. Seven unblended or only mildly blended emission lines were identified, yielding an abundance of (1.7$\pm$0.2)$\times 10^{-10}$ relative to H$_{2}$. The comparable formamide/glycolamide and acetamide/glycolamide abundance ratios in both sources suggest a chemically connected amide network across different environments. These results demonstrate that amides can persist and chemically evolve during massive star formation, tracing the chemical continuity from interstellar to protostellar environments.

astro-ph.GA↗

arXiv2026

Sublinear-query relative-error testing of halfspaces

The relative-error property testing model was introduced in [CDHLNSY24] to facilitate the study of property testing for "sparse" Boolean-valued functions, i.e. ones for which only a small fraction of all input assignments satisfy the function. In this framework, the distance from the unknown target function $f$ that is being tested to a function $g$ is defined as $\mathrm{Vol}(f \mathop{\triangle} g)/\mathrm{Vol}(f)$, where the numerator is the fraction of inputs on which $f$ and $g$ disagree and the denominator is the fraction of inputs that satisfy $f$. Recent work [CDHNSY26] has shown that over the Boolean domain $\{0,1\}^n$, any relative-error testing algorithm for the fundamental class of halfspaces (i.e. linear threshold functions) must make $Ω(\log n)$ oracle calls. In this paper we complement the [CDHNSY26] lower bound by showing that halfspaces can be relative-error tested over $\mathbb{R}^n$ under the standard $N(0,I_n)$ Gaussian distribution using a sublinear number of oracle calls -- in particular, substantially fewer than would be required for learning. Our results use a wide range of tools including Hermite analysis, Gaussian isoperimetric inequalities, and geometric results on noise sensitivity and surface area.

cs.DS↗

arXiv2026

Electronic-Structure Correlations Governing Superconductivity in Nb-Based High-Entropy Alloys

Superconducting high-entropy alloys have recently emerged as a new platform for exploring superconductivity in highly disordered metallic systems and may offer advantages for applications requiring mechanical robustness and tolerance to extreme environments. Yet the mechanisms that govern their superconductivity, particularly the roles of lattice distortion and complex local order, both inherent to high-entropy alloys, remain unclear. The conventional valence-electron-concentration rule fails to reliably predict superconducting behavior, motivating a correlation analysis that links performance to electronic structure and lattice disorder. Here, we study a systematic series of niobium-based body-centered-cubic high-entropy alloys, from binary to quinary compositions, designed to investigate the electronic and structural effects and identify the dominant factors controlling superconductivity. Our experimental results reveal that the superconducting critical properties evolve non-monotonically with alloy complexity. Interestingly, alloys with greater lattice distortion can still achieve higher critical temperature and upper critical field. These observations are corroborated by first-principles and Eliashberg analyses, which identify the position of the niobium d-band relative to the Fermi level as the primary driver of electron-phonon coupling, critical temperature, and upper critical field, with lattice distortion serving as a secondary modifier that generally weakens coupling. We consolidate these findings into a detailed correlation map linking superconducting properties to electronic-structure fingerprints and vibrational signatures, establishing a mechanism-informed design strategy for superconducting high-entropy alloys with enhanced critical temperature and field.

cond-mat.supr-con↗

arXiv2026

The Mystery Deepens: On the Query Complexity of Tarski Fixed Points

We give an $O(\log^2 n)$-query algorithm for finding a Tarski fixed point over the $4$-dimensional lattice $[n]^4$, matching the $Ω(\log^2 n)$ lower bound of [EPRY20]. Additionally, our algorithm yields an ${O(\log^{\lceil (k-1)/3\rceil+1} n)}$-query algorithm for any constant $k$, improving the previous best upper bound ${O(\log^{\lceil (k-1)/2\rceil+1} n)}$ of [CL22]. Our algorithm uses a new framework based on \emph{safe partial-information} functions. The latter were introduced in [CLY23] to give a reduction from the Tarski problem to its promised version with a unique fixed point. This is the first time they are directly used to design new algorithms for Tarski fixed points.

cs.CC↗

arXiv2026

Wan-Weaver: Interleaved Multi-modal Generation via Decoupled Training

Recent unified models have made unprecedented progress in both understanding and generation. However, while most of them accept multi-modal inputs, they typically produce only single-modality outputs. This challenge of producing interleaved content is mainly due to training data scarcity and the difficulty of modeling long-range cross-modal context. To address this issue, we decompose interleaved generation into textual planning and visual consistency modeling, and introduce a framework consisting of a planner and a visualizer. The planner produces dense textual descriptions for visual content, while the visualizer synthesizes images accordingly. Under this guidance, we construct large-scale textual-proxy interleaved data (where visual content is represented in text) to train the planner, and curate reference-guided image data to train the visualizer. These designs give rise to Wan-Weaver, which exhibits emergent interleaved generation ability with long-range textual coherence and visual consistency. Meanwhile, the integration of diverse understanding and generation data into planner training enables Wan-Weaver to achieve robust task reasoning and generation proficiency. To assess the model's capability in interleaved generation, we further construct a benchmark that spans a wide range of use cases across multiple dimensions. Extensive experiments demonstrate that, even without access to any real interleaved data, Wan-Weaver achieves superior performance over existing methods.

cs.CV↗

arXiv2026

LongCat-Next: Lexicalizing Modalities as Discrete Tokens

The prevailing Next-Token Prediction (NTP) paradigm has driven the success of large language models through discrete autoregressive modeling. However, contemporary multimodal systems remain language-centric, often treating non-linguistic modalities as external attachments, leading to fragmented architectures and suboptimal integration. To transcend this limitation, we introduce Discrete Native Autoregressive (DiNA), a unified framework that represents multimodal information within a shared discrete space, enabling a consistent and principled autoregressive modeling across modalities. A key innovation is the Discrete Native Any-resolution Visual Transformer (dNaViT), which performs tokenization and de-tokenization at arbitrary resolutions, transforming continuous visual signals into hierarchical discrete tokens. Building on this foundation, we develop LongCat-Next, a native multimodal model that processes text, vision, and audio under a single autoregressive objective with minimal modality-specific design. As an industrial-strength foundation model, it excels at seeing, painting, and talking within a single framework, achieving strong performance across a wide range of multimodal benchmarks. In particular, LongCat-Next addresses the long-standing performance ceiling of discrete vision modeling on understanding tasks and provides a unified approach to effectively reconcile the conflict between understanding and generation. As an attempt toward native multimodality, we open-source the LongCat-Next and its tokenizers, hoping to foster further research and development in the community. GitHub: https://github.com/meituan-longcat/LongCat-Next

cs.CV↗

arXiv2026

Local Precise Refinement: A Dual-Gated Mixture-of-Experts for Enhancing Foundation Model Generalization against Spectral Shifts

Domain Generalization Semantic Segmentation (DGSS) in spectral remote sensing is severely challenged by spectral shifts across diverse acquisition conditions, which cause significant performance degradation for models deployed in unseen domains. While fine-tuning foundation models is a promising direction, existing methods employ global, homogeneous adjustments. This "one-size-fits-all" tuning struggles with the spatial heterogeneity of land cover, causing semantic confusion. We argue that the key to robust DGSS lies not in a single global adaptation, but in performing fine-grained, spatially-adaptive refinement of a foundation model's features. To achieve this, we propose SpectralMoE, a novel fine-tuning framework for DGSS. It operationalizes this principle by utilizing a Mixture-of-Experts (MoE) architecture to perform \textbf{local precise refinement} on the foundation model's features, incorporating depth features estimated from selected RGB bands of the spectral remote sensing imagery to guide the fine-tuning process. Specifically, SpectralMoE employs a dual-gated MoE architecture that independently routes visual and depth features to top-k selected experts for specialized refinement, enabling modality-specific adjustments. A subsequent cross-attention mechanism then judiciously fuses the refined structural cues into the visual stream, mitigating semantic ambiguities caused by spectral variations. Extensive experiments show that SpectralMoE sets a new state-of-the-art on multiple DGSS benchmarks across hyperspectral, multispectral, and RGB remote sensing imagery.

cs.CV↗

arXiv2026

AgentCollab: A Self-Evaluation-Driven Collaboration Paradigm for Efficient LLM Agents

Autonomous agents powered by large language models (LLMs) perform complex tasks through long-horizon reasoning and tool interaction, where a fundamental trade-off arises between execution efficiency and reasoning robustness. Models at different capability-cost levels offer complementary advantages: lower-cost models enable fast execution but may struggle on difficult reasoning segments, while stronger models provide more robust reasoning at higher computational cost. We present AgentCollab, a self-driven collaborative inference framework that dynamically coordinates models with different reasoning capacities during agent execution. Instead of relying on external routing modules, the framework uses the agent's own self-reflection signal to determine whether the current reasoning trajectory is making meaningful progress, and escalates control to a stronger reasoning tier only when necessary. To further stabilize long-horizon execution, we introduce a difficulty-aware cumulative escalation strategy that allocates additional reasoning budget based on recent failure signals. In our experiments, we instantiate this framework using a two-level small-large model setting. Experiments on diverse multi-step agent benchmarks show that AgentCollab consistently improves the accuracy-efficiency Pareto frontier of LLM agents.

cs.CL↗

arXiv2026

Weighted Nested Commutators for Scalable Counterdiabatic State Preparation

Counterdiabatic (CD) driving enables efficient quantum state preparation, but it requires implementing highly nonlocal adiabatic gauge potentials (AGP) that are impractical to compute and realize in large many-body systems. We introduce a \textit{weighted nested-commutator} (WNC) ansatz to approximate AGP using local operators. The WNC ansatz generalizes the standard nested-commutator ansatz by assigning independent variational weights to commutators of local Hamiltonian terms, thereby enlarging the variational space while preserving a fixed operator range. We show that the WNC ansatz can be efficiently optimized using a local optimization scheme. Moreover, it systematically outperforms the nested-commutator ansatz in preparing one-dimensional matrix product states (MPS) and the ground state of a nonintegrable quantum Ising model. We then numerically demonstrate that CD driving based on the WNC ansatz significantly accelerates the preparation of 1D MPS for system sizes up to $N = 1000$ qubits, as well as the two-dimensional Affleck-Kennedy-Lieb-Tasaki state on a hexagonal lattice with up to $N = 3 \times 10$ sites.

quant-ph↗

arXiv2026

ByteHouse: ByteDance's Cloud-Native Data Warehouse for Real-Time Multimodal Data Analytics

With the rapid rise of intelligent data services, modern enterprises increasingly require efficient, multimodal, and cost-effective data analytics infrastructures. However, in ByteDance's production environments, existing systems fall short due to limitations such as I/O-inefficient multimodal storage, inflexible query optimization (e.g., failing to optimize multimodal access patterns), and performance degradation caused by resource disaggregation (e.g., loss of data locality in remote storage). To address these challenges, we introduce ByteHouse (https://bytehouse.cloud), a cloud-native data warehouse designed for real-time multimodal data analytics. The storage layer integrates a unified table engine that provides a two-tier logical abstraction and physically consistent layout, SSD-backed cluster-scale cache (CrossCache) that supports shared caching across compute nodes, and virtual file system (NexusFS) that enable efficient local access on compute nodes. The compute layer supports analytical, batch, and incremental execution modes, with tailored optimizations for hybrid queries (e.g., runtime filtering over tiered vector indexes). The control layer coordinates global metadata and transactions, and features an effective optimizer enhanced by historical execution traces and AI-assisted plan selection. Evaluations on internal and standard workloads show that ByteHouse achieves significant efficiency improvement over existing systems.

cs.DB↗

arXiv2026

Electrical Transport and Quantum Oscillations in the Metallic Spin Supersolid EuCo2Al9

The discovery of spin supersolid and its giant magnetocaloric effect has opened a new arena in frustrated quantum magnets and cutting-edge cryogenics. The intermetallic EuCo2Al9 (ECA), for the first time, extends this intriguing phase from Mott insulators to a highly conductive metal [1]. In this work, we systematically study the electrical transport properties of ECA, where itinerant electrons serve as a sensitive probe for the spin supersolid states. We observe anomalies both in the temperature-dependent resistivity and field-dependent magnetoresistance and Hall signals, which are attributed to response of electrons to the Eu2+ spins and their fluctuations. Moreover, Shubnikov-de Haas quantum oscillations at high magnetic field reveal pronounced band splitting in the spin polarized state. Our results reveal an intimate correspondence between electrical transport and magnetic transitions in ECA, deepening the understanding of this metallic spin supersolid.

cond-mat.str-el↗

arXiv2026

RKKY-dipolar Interactions and 3D Spin Supersolid on Stacked Triangular Lattice

Inspired by the recent discovery of metallic spin supersolidity and its giant magnetocaloric effect in the rare-earth alloy EuCo$_2$Al$_9$ [Nature 651, 61 (2026)], we perform a combined study through electronic structure analysis, effective spin model, and Monte Carlo simulations on a stacked triangular lattice, and reveal a novel mechanism for the emergence of 3D spin supersolid in a metallic antiferromagnet. From first-principles inputs, we derive a minimal spin model on a stacked triangular lattice (STL), which arises from the interplay between Ruderman-Kittel-Kasuya-Yosida (RKKY) and dipolar interactions and accurately reproduces the experimental thermodynamics. Based on the STL model, we identify a ground state that simultaneously breaks discrete lattice translational symmetry and continuous spin-rotational symmetry -- the hallmark of a spin supersolid. Furthermore, we present the field-temperature phase diagram of the 3D STL model and discuss the various magnetic phases and associated phase transitions. Under zero field, the spin supersolid Y order establishes in two steps: an upper transition at $T_{N1}$, where an emergent U(1) symmetry appears and the system enters a fluctuating collinear regime, followed by a lower transition at $T_{N2}$ into the spin supersolid Y phase. In contrast, the supersolid V phase undergoes a single phase transition at $T_N^V$. Our results not only provide a comprehensive theoretical understanding of the metallic spin supersolid reported for EuCo$_2$Al$_9$ but also pave the way for further experimental investigations into its supersolid transitions and universality class.

cond-mat.str-el↗

arXiv2026

In-orbit Test of the Weak Equivalence Principle with Atom Interferometry

The Weak Equivalence Principle (WEP) is a central pillar of general relativity. Its precise test with quantum systems in space offers a unique window onto new physics. Here we report the first in-orbit quantum test of the WEP. A dual-species (85Rb/87Rb) atom interferometer is realized aboard the China Space Station. Methods of platform motion suppression, fluorescence detection switching, and two-photon detuning switching are developed to eliminate phase noise and improve measurement accuracy. A test uncertainty of 2.8*10-8 is obtained from 280 days of WEP test data, and a test result of (-3.1+/-4.6)*10-7 is achieved after error estimation. This improves prior atom-interferometric WEP tests in microgravity by three orders of magnitude. This work paves the way for space-borne quantum inertial sensors and their application to future fundamental physics in space.

physics.atom-ph↗

arXiv2026

Halfspaces are hard to test with relative error

Several recent works [DHLNSY25, CPPS25a, CPPS25b] have studied a model of property testing of Boolean functions under a \emph{relative-error} criterion. In this model, the distance from a target function $f: \{0,1\}^n \to \{0,1\}$ that is being tested to a function $g$ is defined relative to the number of inputs $x$ for which $f(x)=1$; moreover, testing algorithms in this model have access both to a black-box oracle for $f$ and to independent uniform satisfying assignments of $f$. The motivation for this model is that it provides a natural framework for testing \emph{sparse} Boolean functions that have few satisfying assignments, analogous to well-studied models for property testing of sparse graphs. The main result of this paper is a lower bound for testing \emph{halfspaces} (i.e., linear threshold functions) in the relative error model: we show that $\tildeΩ(\log n)$ oracle calls are required for any relative-error halfspace testing algorithm over the Boolean hypercube $\{0,1\}^n$. This stands in sharp contrast both with the constant-query testability (independent of $n$) of halfspaces in the standard model [MORS10], and with the positive results for relative-error testing of many other classes given in [DHLNSY25, CPPS25a, CPPS25b]. Our lower bound for halfspaces gives the first example of a well-studied class of functions for which relative-error testing is provably more difficult than standard-model testing.

cs.CC↗

arXiv2026

Optimal low-rank stochastic gradient estimation for LLM training

Large language model (LLM) training is often bottlenecked by memory constraints and stochastic gradient noise in extremely high-dimensional parameter spaces. Motivated by empirical evidence that many LLM gradient matrices are effectively low-rank during training, we present an unbiased, memory-efficient, low-rank matrix estimator with the lowest variance that is applicable across common stochastic gradient estimation paradigms. The core idea is to project a high-dimensional stochastic gradient estimator onto a random low-dimensional subspace and lift it back, reducing memory while keeping the estimator unbiased and controlling mean-squared error via an optimally designed projection distribution, including Haar--Stiefel projections. The projection distribution is derived by solving a constrained functional optimization problem, yielding an optimal random projector that guides algorithm design. Empirically, the resulting low-rank gradient estimators deliver both practical memory savings and improved training behavior. In RoBERTa-large fine-tuning, our method attains the lowest peak GPU memory among compared methods (e.g., 3.83GB versus 16.7GB for full BP) while remaining competitive in accuracy; in autoregressive LLM pretraining (LLaMA-20M/60M/100M), our method outperforms the traditional methods, supporting the benefit of the proposed optimal projection strategy.

cs.LG↗

arXiv2026

Radiative Compression of Dense Cores in the Pillars of Creation as Revealed by JWST Extinction Mapping

The Pillars of Creation in M16 represent an iconic star-forming region where stellar feedback shapes molecular cloud evolution. We present a detailed investigation of dust extinction and density structure in the Pillars of Creation using multiband photometric observations from \emph{JWST} NIRCam. A high-resolution (2\arcsec) extinction map reaching depths of $A_V\sim 100$ mag has been constructed using NIRCam filters F090W, F200W, F335M, and F444W. This map clearly reveals the intricate structure of dense gas within the molecular cloud in the Pillars of Creation region. Analysis of the column density probability distribution function (N-PDF) exhibits a characteristic lognormal distribution at intermediate extinctions ($A_V\approx10-30$\,mag), which transitions to a power-law tail at high extinctions ($A_V\gtrsim$ 30\,mag) where star-forming cores reside. The power-law slope $α$ displays significant spatial variation, steepening from $α\approx 2.0$ at the pillar tips facing the NGC 6611 cluster to $α\approx$4.0 in regions distant from the cluster. This systematic gradient demonstrates that stellar feedback not only disperses molecular clouds but can also locally enhance the formation of dense, self-gravitating structures through radiative compression.

astro-ph.GA↗