Search arXiv⌕ Search

arXiv subjects

Haotian Chen

Publications and source records attributed to Haotian Chen.

At least 19 recordsLinked to original sources

On the Order of Privacy and Smoothing in Functional Mean Estimation

Differential privacy (DP) is a leading framework for privacy protection, yet privacy mechanisms tailored to functional data analysis (FDA) remain relatively underexplored. For functional mean estimation, we investigate a fundamental question regarding the ordering of privatization and estimation by comparing two canonical pipelines: Fit-Then-Protect (FTP), which smooths trajectories before privatization, and Protect-Then-Fit (PTF), which privatizes observations at discrete time points before smoothing. When data are observed without error, we prove that FTP achieves strictly smaller mean squared error than PTF asymptotically (as the sample size increases) under the same $μ$-Gaussian differential privacy ($μ$-GDP) budget in both finite-dimensional Hilbert spaces and infinite-dimensional reproducing kernel Hilbert spaces (RKHS). Simulation studies support our theory and explore settings with observation error and fitting constraints, demonstrating that FTP outperforms PTF under small observation noise, whereas PTF can become preferable in high-noise settings. In addition to this comparison, we establish a novel GDP guarantee for Gaussian perturbations taking values in a Banach space, extending existing results beyond the RKHS setting.

math.ST↗

MemT-1.0: Towards Memory-Native Evolution

Memory-native evolution requires making memory an intrinsic capability of foundation models, enabling them to continuously accumulate and utilize information. To this end, we introduce MemT-1.0, a new architecture of memory foundation models that internalize memory as part of model computation. Building on Metis, MemT-1.0 employs Gated DeltaNet-2 with a stable token-level memory update mechanism within each turn. We further introduce Mixture-of-Storage to scale native memory capacity. Following a deliberate backbone preparation, we develop a two-stage training pipeline consisting of continued pre-training and post-training, supported by 34B tokens of training data and efficient training and inference infrastructure. We release a model family comprising MemT-1.0-Nano and MemT-1.0-Flash, and conduct a comprehensive evaluation of memory and general capabilities. The results show that they outperform the parametric memory baselines on average and remain competitive with retrieval-augmented methods, while largely preserving general capabilities. At a history length of 128K tokens, MemT-1.0-Nano achieves approximately $1.86\times$ end-to-end inference speedup and a $66\times$ reduction in persistent storage relative to full context KV cache. By internalizing retrieved procedural experience, MemT-1.0 improves task success on agentic tasks, providing a practical step toward memory-native evolution.

cs.CL↗

A Chiral Superlattice Route to Spin-Split Topological Antiferromagnetism

The interplay between chirality and magnetism is a profound topic, spanning particle physics, condensed matter, chemistry and origin of life. In this paper, we study this interplay in the new antiferromagnet (AFM) UOTe, and we report a chiral superlattice route to spin-split topological phenomena from collinear antiferromagnetism. Pristine UOTe is a collinear AFM without Berry curvature or spin-split bands. However, we identify the spontaneous formation of a chiral superlattice in UOTe, which can be viewed as frozen chiral phonons at finite wave vector. When electrons move through the chiral superlattice, their orbital Bloch wavefunction and quantum geometry are modulated by the strong chiral superlattice potential, generating large Berry curvature in the chiral superlattice, which we detect by the nonlinear Hall effect. At 150 K, the chiral superlattice induced Berry curvature couples to the collinear AFM order, generating a giant anomalous Hall angle ~0.14 abruptly near $T_N$ that is among the largest in bulk magnets. Moreover, our spin Hanle precession measurement shows that the chiral superlattice also generates spin-polarized current from the collinear AFM, a long-standing goal in spintronics. We shed light on the supermodulation formation mechanism based on chemical ion size and physical interlayer-intralayer energy competitions, using which we propose a design principle to discover similar bond-mismatch superlattices, providing a chiral superlattice pathway through real space engineering of quantum geometry.

cond-mat.mes-hall↗

SciRerankBench: Benchmarking Rerankers Towards Scientific Retrieval-Augmented Generation with LLMs

Scientific literature question answering is a pivotal step towards new scientific discoveries. Recently, \textit{two-stage} retrieval-augmented generated large language models (RAG-LLMs) have shown impressive advancements in this domain. Such a two-stage framework, especially the second stage (reranker), is particularly essential in the scientific domain, where subtle differences in terminology may have a greatly negative impact on the final factual-oriented or knowledge-intensive answers. Despite this significant progress, the potential and limitations of these works remain unexplored. In this work, we present a Scientific Rerank-oriented RAG Benchmark (SciRerankBench), for evaluating rerankers within RAG-LLMs systems, spanning five scientific subjects. To rigorously assess the reranker performance in terms of noise resilience, relevance disambiguation, and factual consistency, we develop three types of question-context-answer (Q-C-A) pairs, i.e., Noisy Contexts (NC), Semantically Similar but Logically Irrelevant Contexts (SSLI), and Counterfactual Contexts (CC). Through systematic evaluation of 13 widely used rerankers on five families of LLMs, we provide detailed insights into their relative strengths and limitations. To the best of our knowledge, SciRerankBench is the first benchmark specifically developed to evaluate rerankers within RAG-LLMs, which provides valuable observations and guidance for their future development.

cs.CL↗

Prospects for geoneutrino detection with JUNO

Geoneutrinos, which are antineutrinos emitted during the decay of long-lived radioactive elements inside Earth, serve as a unique tool for studying the composition and heat budget of our planet. The Jiangmen Underground Neutrino Observatory (JUNO) experiment in China, which has recently completed construction, is expected to collect a sample comparable in size to the entire existing world geoneutrino dataset in less than a year. This paper presents an updated estimation of sensitivity to geoneutrinos of JUNO using the best knowledge available to date about the experimental site, the surrounding nuclear reactors, the detector response uncertainties, and the constraints expected from the TAO satellite detector. To facilitate comparison with present and future geological models, our results cover a wide range of predicted signal strengths. Despite the significant background from reactor antineutrinos, the experiment will measure the total geoneutrino flux with a precision comparable to that of existing experiments within its first few years, ultimately achieving a world-leading precision of about 8% over ten years. The large statistics of JUNO will also allow separation of the Uranium-238 and Thorium-232 contributions with unprecedented precision, providing crucial constraints on models of formation and composition of Earth. Observation of the mantle signal above the lithospheric flux will be possible but challenging. For models with the highest predicted mantle concentrations of heat-producing elements, a 3-sigma detection over six years requires knowledge of the lithospheric flux to within 15%. Together with complementary measurements from other locations, the geoneutrino results of JUNO will offer cutting-edge, high-precision insights into the interior of Earth, of fundamental importance to both the geoscience and neutrino physics communities.

hep-ex↗

Test-Time Agent Evolution for Long-Horizon Legal Reasoning

Legal intelligence aims to support reliable decision-making across long-horizon legal processes involving evolving case states and multiple roles. However, real-world legal deployment exhibits substantial case heterogeneity in facts, evidence, and procedural contexts, exposing the limitations of static agent strategies. Moreover, legal reasoning is inherently interdependent across roles and procedural stages, making global reliability fundamentally different from isolated role competence. To address these challenges, we study training-free test-time agent adaptation, where agents continuously exploit deployment-time signals from preceding cases and ongoing interactions without updating model parameters. We propose \method, which introduces \emph{Test-Time Memory Evolution} to retrieve reusable experience from previous cases, adapt it to the current factual and procedural context, and consolidate accumulated experience for subsequent decision-making. Further, \emph{Rubric-Aligned Collaboration} verifies and revises role-specific actions according to behavioral and procedural requirements, enabling coordinated decision-making across roles and stages. Extensive experiments on J1-EVAL and LegalWorld across five backbone models demonstrate consistent improvements over representative reasoning and agent baselines with reasonable interaction and computational costs. Ablation and case studies further show that the two components provide complementary benefits in experience adaptation and cross-role coordination, improving the reliability and efficiency of long-horizon legal reasoning.

cs.AI↗

Belief-Trajectory Energy: Measuring the Path to a Prediction

Large language models (LLMs) progressively revise their predictions across Transformer layers, yet we typically observe only the final output, discarding the trajectory through which it is formed. We introduce Belief-Trajectory Energy(BTE), a model-grounded measure that characterizes an input through the layerwise predictive revisions it induces in a model. By mapping intermediate states into a shared predictive space, BTE provides a principled measure of belief change that can be summarized as either a scalar or a structured depth profile. Theoretically, we show that local BTE corresponds to predictive revision under the Fisher-Rao geometry, while the sequence of revisions captures information beyond the initial-to-final belief change. Empirically, scalar BTE provides a model-relative signal of difficulty across diverse reasoning tasks, while richer BTE representations support human-LLM review detection and fine-grained generator attribution, reaching up to $0.998$ macro-AUROC and $95.6\%$ eight-way attribution accuracy. Further analysis shows that BTE develops throughout pretraining and is selectively reshaped by targeted training, demonstrating that the resulting measurement reflects what the scoring model has learned. Together, our results establish belief trajectories as a principled model-grounded signal and suggest a broader perspective in which learned models can themselves serve as instruments for characterizing the data they process. More demonstrations can be found at https://yingjiahao14.github.io/BTE-web/.

cs.CL↗

Auditing Action Settlement in LLM Agent Environments: Order, Progress, and Replay

Concurrent actions in large language model (LLM) agent environments require arbitration even when each proposal is individually valid. We implement a typed snapshot-settlement contract and audit three distinct properties: order sensitivity, useful progress, and replay consistency. Five settlement policies are tested in 28,800 exhaustive permutation trials and 2,160 scripted multistep episodes. Joint policies are spatially order-invariant conditional on fixed priorities, yet conservative rejection completes only 31.25% of agents in a six-agent doorway task versus 90.28% for random tickets; the paired improvement is 59.03 percentage points (95% bootstrap interval: 50.00-68.06). All policies preserve the tested spatial constraints, and priority arbitration still misses the independent small-instance optimum. A separate full-state journal audit exactly replays 156 checkpoints and rejects 1,332 constructed corruptions with a retained terminal anchor. The evidence concerns execution semantics, not human realism or long-run fairness.

cs.AI↗

When Does Exercise-Specific Joint Selection Help? An Audit of Evaluation and Control Design

Exercise-specific joint selection can improve skeleton-based correctness classification, but what does that gain establish? We audit 1,057 repetitions from ten REHAB24-6 subjects, separating evaluation aggregation, subset structure, and temporal representation. The manual-subset kNN gain changes from 0.055 for pooled out-of-fold AUROC to 0.020 for equal-weight within-person AUROC; both paired intervals include zero. Among 1,000 dimension-matched random maps, 14 match or exceed the manual pooled result, versus 145 when bilateral structure and trunk inclusion are also matched. RBF-SVM retains a positive within-person gain, whereas logistic regression and a random-convolution comparator have negative point gains under that estimand. Sequence-order and paired-seed controls further qualify the interpretation. This exploratory audit shows why joint-selection claims require explicit estimands and structurally appropriate controls; it does not establish a new algorithm or clinical benefit.

cs.AI↗

CAR-VLA: Complexity-Aware and Risk-Adaptive Reasoning for Autonomous Driving

Existing adaptive reasoning methods for driving Vision-Language-Action (VLA) models primarily focus on whether to reason, overlooking how reasoning should differ across driving situations. Our key insight is that while scene complexity informs reasoning depth, dynamic risk is equally critical for deciding how to reason in time-critical situations. We therefore propose CAR-VLA, a unified driving VLA model that jointly considers scene complexity and dynamic risk to guide reasoning depth, urgency, and focus. CAR-VLA maps four complexity--risk categories to three reasoning modes: \textit{Fast Intuition} for direct trajectory generation in simple low-risk scenes, \textit{Slow Thinking} for deliberate reasoning in complex low-risk scenes, and \textit{Reflex Response} for compact, hazard-focused reasoning in high-risk scenes regardless of complexity. Rather than merely shortening deliberation, Reflex Response centers reasoning on the most critical hazard and the immediate safe response. We train CAR-VLA through progressive supervised learning that links scene assessment, reasoning-mode selection, and trajectory generation, followed by reasoning-augmented reinforcement learning to improve driving quality and reasoning behavior. Experiments on NAVSIM v1(91.1 PDMS), NAVSIM v2(90.3 EPDMS), and Navhard(35.0 EPDMS) demonstrate competitive driving performance. Qualitative comparisons on navtest and in-house high-risk scenarios further illustrate risk-aware reasoning and hazard-responsive trajectory generation. The code for this paper will be released publicly at: https://github.com/chenxl124578/CAR-VLA.git

cs.CV↗

Inducing Process Supervision from Outcome-Only Reinforcement Learning

Process reward models (PRMs) have become a key component for LLMs, as their step-level feedback supports both post-training and test-time reasoning. However, training strong PRMs remains costly: human step annotation is difficult to scale, while Monte Carlo estimation is computationally expensive and can drift from the intrinsic correctness of steps. To get effective PRMs at low cost, we introduce TIPS (Thinking-Induced Process Supervision), an outcome-only reinforcement learning (RL) framework for training generative PRMs. In TIPS, the model generates a chain-of-thought (CoT) followed by step-level labels and an outcome label. The reward depends solely on whether the predicted outcome matches the ground truth, and the resulting group-relative advantage is used to optimize the entire generated response. Intuitively, when checking intermediate steps helps determine the outcome, more accurate checks can lead to better outcome judgments and higher rewards. Outcome-only RL can therefore reinforce step-level verification without explicit process supervision. We validate the effectiveness of TIPS across math and agent benchmarks and four backbone families. Notably, TIPS-Qwen3-4B-Thinking-2507 reaches 85.2 F1 on ProcessBench with only 3.2K outcome-labeled trajectories, surpassing all evaluated trained PRMs and strong prompt-only judges such as GPT-5.4-Instruct and Claude-4.7-Opus, while still trailing o1-mini. Code and data are available at https://github.com/RUCBM/TIPS.

cs.LG↗

ACPruner: Visual Token Pruning as Biased Attention Coverage Maximization in LVLMs

Large Vision-Language Models (LVLMs) face significant computational inefficiencies caused by the large number of visual tokens. Existing visual token pruning methods mainly focus on either retaining individually important tokens or selecting mutually diverse ones. In this work, we revisit visual token pruning from a coverage perspective and formulate it as a biased attention coverage maximization problem. The key idea is to select a compact token subset whose encoder-side outgoing attention can jointly cover the image while assigning higher coverage priority to more informative regions. From this perspective, we propose ACPruner, a training-free visual token pruning framework for efficient LVLM inference. ACPruner first estimates token importance by combining intra-modal saliency and inter-modal relevance, then derives token-wise coverage from attention patterns within the vision encoder, and finally performs greedy selection to maximize the proposed coverage objective. Extensive experiments across multiple LVLM backbones, including LLaVA-1.5-7B/13B, LLaVA-NeXT-7B/13B, Qwen2.5-VL-7B, and LLaVA-OneVision-7B, show that ACPruner consistently achieves strong performance retention while delivering substantial end-to-end inference speedups.

cs.CV↗

Scientific Data Skills: Enabling Agent-Ready Scientific Data Services at Scale

Scientific data are increasingly used by AI agents, yet existing dataset representations provide limited support for reliable dataset discovery and interpretation, constraining their effective use in scientific workflows. This limitation arises because agents must search across heterogeneous repositories and reconstruct dataset-specific semantics and operating procedures from documentation designed primarily for human use. To address this limitation, we introduce the Scientific Data Skill (SciDSK), an agent-ready representation that packages dataset-specific knowledge and operational guidance as a reusable agent skill. A SciDSK integrates dataset descriptions, scientific context, file organization, task-specific usage procedures, quality checks, and provenance information while retaining the underlying data in its original repository. We define a structured SciDSK specification and develop a systematic construction pipeline that grounds each SciDSK in authoritative dataset records and associated supporting materials. We further establish the Scientific Data Skill Bank, a unified platform that publishes SciDSK resources across six scientific disciplines and supports package access, persistent identification, and traceability to source datasets. We evaluate SciDSK through a retrieval benchmark for dataset discovery and controlled cases for dataset interpretation. On the query retrieval benchmark, Agent-SciDSK achieves 80.77% Hit@1, exceeding Agent-Raw by 9.62 percentage points. Across controlled interpretation cases, the SciDSK condition satisfies 23 of 24 assessment criteria, compared with 22 under the web-page condition. These results indicate that SciDSK improves how agents locate and understand scientific datasets, providing a stronger foundation for actionable scientific data use.

cs.AI↗

Minute-Scale High-Fidelity Gyrokinetic Simulations with Portability from Laptop to Supercomputer

Global gyrokinetic particle simulations remain computationally expensive, as they demand both adequate marker statistics and three-dimensional field solvers. In this work, we present a hybrid spectral method within the particle-in-Fourier (PIF) framework and implement it in the electrostatic model of GTC. Charge scatter and field gather are performed between particles and fields on a two-dimensional poloidal mesh, while the corresponding Poisson solver is discretized using radial finite differences and poloidal $m$-harmonics. Truncated spectral transforms are employed to connect multiple representations for fields, avoiding costly particle-grid operations for each individual $m$-harmonic within the particle loop. Benchmarks against conventional particle-in-cell (PIC) simulations successfully reproduce single-$n$ ion temperature gradient (ITG) mode structures and dispersion relations, as well as multi-$n$ nonlinear ITG transport and its regulation by zonal flows. Compared to conventional PIC, the proposed method reduces the effective problem size by more than a factor of 48 and achieves a speedup of over two orders of magnitude for single-$n$ cases. A 2000-step single-$n$ simulation with approximately 2 million markers completes in 78.2 seconds on a laptop GPU, while multi-$n$ turbulence simulation also completes within minutes. Furthermore, the elimination of toroidal particle-shift communication yields promising preliminary scaling performance on multiple NVIDIA A100 GPUs. The numerical scheme is broadly applicable for accelerating particle simulations on platforms ranging from laptops to supercomputers.

physics.plasm-ph↗

Final assessment of radioactive impurities in the JUNO detector

The Jiangmen Underground Neutrino Observatory (JUNO) collaboration has completed the construction of the 20,000-ton liquid scintillator detector and the associated muon veto detector system. To meet the physics objectives, the materials used in the detector must exhibit low radioactive contamination. The single-event rate in the fiducial volume (R $<$ 17.2 m) of the scintillator is required to be approximately 7 Hz for energies above 0.7 MeV, resulting in an accidental coincidence background of about 1 event per day for reactor neutrino physics analyses. Since the beginning of the construction phase, we have screened the natural radioactivity content of thousands of materials, to select those that meet the design background budget. The radioactive impurity concentrations of the materials ultimately used in the JUNO detector are summarized in this paper. The construction of the entire detector and the subsequent filling of the liquid scintillator were completed in August 2025. From the initial data, the total count rate of natural radioactivity within the detector's fiducial volume has met the requirements and is sufficient to support the reactor antineutrino analysis.

physics.ins-det↗

Linear Gyrokinetic Simulations of Micro-tearing Mode: Local versus Global

A systematic comparison of local and global linear gyrokinetic simulations of micro-tearing modes (MTMs) is performed using the GENE code. The analysis spans diverse plasma parameters, including the core regions with normal and weak magnetic shear, as well as the pedestal region with the strong plasma non-uniformity. The global simulations reveal a distinct MTM type characterized by a `parity mixing' mode structure, which can be significantly destabilized by trapped electrons. Moreover, in contrast to electrostatic drift wave instabilities, the current layer width ($ Δ_c $) is identified as the crucial factor determining the importance of global effects. The MTM in the core region exhibits the slab-like feature with narrow $ Δ_c $, leading to high consistency between local and global results. However, in the pedestal region, the steep pressure gradient broadens $Δ_c$, driving quantitative deviations when $Δ_c$ becomes comparable to the plasma pressure gradient scale length. For high-$n$ MTMs, $ Δ_c $ can exceed the distance between adjacent mode rational surfaces. The resulted overlapping of current layers enhances the toroidal mode coupling effect, accounting for the substantial discrepancies observed between local and global simulations.

physics.plasm-ph↗

A Low-energy Threshold and Multi-messenger Trigger System for the JUNO Experiment

The Jiangmen Underground Neutrino Observatory (JUNO) is a 20-kiloton liquid scintillator neutrino detector, located 650 meters (1800 m.w.e.) underground in Jiangmen, Guangdong, China. JUNO is primarily designed for reactor neutrino measurements and has been taking data since 2025. With the largest mass of its kind and an excellent energy resolution, JUNO is a leading observatory for high-precision measurements of MeV neutrinos. The standard global trigger system serves as the primary trigger for JUNO. We present a newly developed multi-messenger trigger system that extends the capabilities of the global trigger by providing a lower energy threshold and an independent monitoring capability. During the 2025 operation, it achieved an effective energy threshold of approximately 110 +/- 10 keV, providing a lower threshold configuration suitable for low-energy event analysis. The system shows the potential to further reduce the threshold to well below 100 keV. Based on the multi-messenger trigger system, an astrophysical monitor has been developed to receive and process external alerts from other messengers, such as gravitational-wave observations. A Transient Neutrino Burst Monitor is integrated to detect short-time-scale neutrino burst events and enables real-time monitoring of transient astrophysical phenomena. The system is sensitive to neutrino bursts from core-collapse supernovae within a distance of about 250 kpc.

hep-ex↗

Implicit discretization schemes for full-kinetic ion and drift-kinetic electron simulations

We present a new electromagnetic plasma simulation model with full-kinetic ions and drift-kinetic electrons. This model (termed as FIDES) solves the electric field using the implicit perpendicular Ohm's law and a novel implicit parallel Ampere's law, where the latter requires an implicit scheme for the parallel electric field in advancing the electron weights. To suppress unphysical high-frequency instabilities, ion weights are advanced using an implicit scheme for perpendicular electric fields. Simulations of perpendicular and parallel waves validate the model's capability in handling high-frequency physics. Low-frequency wave simulations demonstrate that the implicit parallel Ampere's law can mitigate the cancellation problem more effectively than the conventional schemes using the parallel Ohm's law. To reduce the numerical damping from implicit time-stepping, we develop a second-order scheme for particle pushing. Meanwhile, an integrated strategy combining the first- and second-order schemes is employed to suppress odd-even decoupling while maintaining the accuracy of the second-order formulation.

physics.plasm-ph↗