arXiv subjects

Yiming Lu

Publications and source records attributed to Yiming Lu.

16 recordsLinked to original sources

arXiv2026

Effects of Rotation on the Gravitational Momentum Transfer in Neutron-Star Kicks and Implications for Spin-Kick Alignment

Neutron stars are often born with large recoil velocities, or natal kicks, whose physical origin remains an open question in core-collapse supernova theory. Observations suggest that the spin-kick angle distribution is not isotropic but skewed toward a spin-kick vector alignment. One possible kick mechanism is the gravitational tug-boat effect, in which anisotropic ejecta gravitationally accelerate the proto-neutron star over a timescale of seconds after shock revival, although the long-term importance of this effect relative to other hydrodynamic forces remains debated. Previous derivations of the tug-boat mechanism do not include the effect of initial stellar rotation. Here we derive a minimalist extension to assess how rotation of the expanding asymmetric mass distribution influences spin-kick alignment of gravitational momentum transfer. We show that the spin-kick angle is determined by the product of two factors, one that depends on the ratio of shock expansion time to the rotation period and the other which depends on the orientation of the asymmetric mass distribution with respect to the spin-axis. For fast enough rotation, the first factor amounts to axially averaging out non-axisymmetry thereby suppressing the perpendicular tug and leaving only a spin-aligned force. However, the rotation speed required for this effect would be unrealistically large unless magnetic fields could transport angular momentum from the core to the outflow efficiently. Spin-kick alignment by the tug-boat mechanism would otherwise require the second factor, namely a preferentially spin-aligned mass flux asymmetry. The rotational-averaging framework developed here suggests that, in general, for any kick mechanism that is not sourced by rotation, including rotation will have some tendency to spin-align the kick, but reduce the kick magnitude.

astro-ph.HE↗

arXiv2026

EpiEvolve: Self-Evolving Agents for Streaming Pandemic Forecasting under Regime Shifts

Epidemic LLM forecasters are usually trained and evaluated as static supervised models, whereas operational pandemic forecasting is a streaming process in which labels arrive after predictions and disease regimes shift over time. We study this mismatch in weekly COVID-19 hospitalization trend forecasting across five variant regimes. We introduce EpiEvolve, a self-evolving agent that wraps an LLM forecaster trained on the warm-start period and keeps its weights fixed during streaming. EpiEvolve adapts by storing forecast outcomes in a hierarchical episodic memory, reflecting on delayed labels, retrieving cases relevant to the current regime, and distilling recurring errors into strategic rules. The resulting context lets the forecaster reuse its own past predictions and outcomes in later weeks while following a chronological protocol that prevents future leakage. On the streaming dataset, EpiEvolve reaches $0.629$ average accuracy, compared with $0.561$ for the static backbone and $0.325$ for the external CDC ensemble, and reduces recovery lag after regime shifts from $5$ to $2$ weeks. Ablations show that reflection, strategic memory, and regime-aware retrieval each contribute to the gains.

cs.AI↗

arXiv2026

How is a gas sensor poisoned by volatile methylsiloxanes?

Volatile methyl siloxanes (VMSs), widely present in consumer and industrial products, have attracted increasing concerns due to their persistence, bioaccumulation behavior, and adverse health effects. Beyond their environmental implications, VMSs also pose operational challenges for sensing technologies because they readily decompose on sensing materials to form silicon-based compounds (e.g., silica and silane) that irreversibly impair sensing performance, a phenomenon commonly known as siloxane poisoning. Despite its prevalence, the mechanistic basis of this deactivation remains poorly understood. Herein, we present the first comprehensive theoretical study of siloxane-induced poisoning in catalytic gas sensors. Guided by our self-developed AI Agent, Digital Sensor Platform (DigSen), we first identify siloxane poisoning as a previously overlooked yet high-impact research direction. Using hexamethyldisiloxane (HMDS) as a model compound, we then conducted first-principles calculations to uncover decomposition pathways across noble metal surfaces. Strikingly, a descriptor-based microkinetic volcano model is developed to capture the trade-off between sensing activity and resistance to poisoning, enabling predictive identification of anti-poisoning candidates. These insights not only elucidate the origin of siloxane poisoning but also demonstrate how AI-driven discovery, mechanistic theory, and experiments can be integrated into a closed-loop framework for catalytic sensor design. More broadly, this AI-guided paradigm represents a generalizable strategy for materials digital discovery, offering a transferable methodology that extends well beyond siloxane systems to diverse classes of materials challenges.

physics.chem-ph↗

arXiv2026

Information-Theoretic Scaling Laws of Neural Quantum States

We establish an information-theoretic scaling law for generic autoregressive neural quantum states, determined by the middle-cut mutual information of the wavefunction amplitude. By formalizing the virtual bond as an effective information channel across a sequence bipartition, we rigorously prove that exact autoregressive representation of a quantum state requires the virtual-bond dimension to scale with the amplitude mutual information. For stabilizer-state families, we show that this law yields an explicit, analytical rank formula. Applying this framework across quantum-state tomography, ground-state and finite-temperature learning, our numerical experiments expose precise exponent matching, architecture-dependent scaling differences between recurrent and Transformer neural quantum state, and the critical role of autoregressive basis ordering. These results establish a rigorous physical link between the intrinsic structure of a quantum many-body state and the corresponding neural-network capacity required for its faithful representation.

quant-ph↗

arXiv2025

Multi-AI Agent Framework Reveals the "Oxide Gatekeeper" in Aluminum Nanoparticle Oxidation

Aluminum nanoparticles (ANPs) are among the most energy-dense solid fuels, yet the atomic mechanisms governing their transition from passivated particles to explosive reactants remain elusive. This stems from a fundamental computational bottleneck: ab initio methods offer quantum accuracy but are restricted to small spatiotemporal scales (< 500 atoms, picoseconds), while empirical force fields lack the reactive fidelity required for complex combustion environments. Herein, we bridge this gap by employing a "human-in-the-loop" closed-loop framework where self-auditing AI Agents validate the evolution of a machine learning potential (MLP). By acting as scientific sentinels that visualize hidden model artifacts for human decision-making, this collaborative cycle ensures quantum mechanical accuracy while exhibiting near-linear scalability to million-atom systems and accessing nanosecond timescales (energy RMSE: 1.2 meV/atom, force RMSE: 0.126 eV/Angstrom). Strikingly, our simulations reveal a temperature-regulated dual-mode oxidation mechanism: at moderate temperatures, the oxide shell acts as a dynamic "gatekeeper," regulating oxidation through a "breathing mode" of transient nanochannels; above a critical threshold, a "rupture mode" unleashes catastrophic shell failure and explosive combustion. Importantly, we resolve a decades-old controversy by demonstrating that aluminum cation outward diffusion, rather than oxygen transport, dominates mass transfer across all temperature regimes, with diffusion coefficients consistently exceeding those of oxygen by 2-3 orders of magnitude. These discoveries establish a unified atomic-scale framework for energetic nanomaterial design, enabling the precision engineering of ignition sensitivity and energy release rates through intelligent computational design.

cs.AI↗

arXiv2025

Deconstructing the Dual Black Box:A Plug-and-Play Cognitive Framework for Human-AI Collaborative Enhancement and Its Implications for AI Governance

Currently, there exists a fundamental divide between the "cognitive black box" (implicit intuition) of human experts and the "computational black box" (untrustworthy decision-making) of artificial intelligence (AI). This paper proposes a new paradigm of "human-AI collaborative cognitive enhancement," aiming to transform the dual black boxes into a composable, auditable, and extensible "functional white-box" system through structured "meta-interaction." The core breakthrough lies in the "plug-and-play cognitive framework"--a computable knowledge package that can be extracted from expert dialogues and loaded into the Recursive Adversarial Meta-Thinking Network (RAMTN). This enables expert thinking, such as medical diagnostic logic and teaching intuition, to be converted into reusable and scalable public assets, realizing a paradigm shift from "AI as a tool" to "AI as a thinking partner." This work not only provides the first engineering proof for "cognitive equity" but also opens up a new path for AI governance: constructing a verifiable and intervenable governance paradigm through "transparency of interaction protocols" rather than prying into the internal mechanisms of models. The framework is open-sourced to promote technology for good and cognitive inclusion. This paper is an independent exploratory research conducted by the author. All content presented, including the theoretical framework (RAMTN), methodology (meta-interaction), system implementation, and case validation, constitutes the author's individual research achievements.

cs.AI↗

arXiv2025

Communication to Completion: Modeling Collaborative Workflows with Intelligent Multi-Agent Communication

Multi-agent LLM systems have demonstrated impressive capabilities in complex collaborative tasks, yet most frameworks treat communication as instantaneous and free, overlooking a fundamental constraint in real world teamwork, collaboration cost. We propose a scalable framework implemented via Communication to Completion (C2C), which explicitly models communication as a constrained resource with realistic temporal costs. We introduce the Alignment Factor (AF), a dynamic metric inspired by Shared Mental Models, to quantify the link between task understanding and work efficiency. Through experiments on 15 software engineering workflows spanning three complexity tiers and team sizes from 5 to 17 agents, we demonstrate that cost-aware strategies achieve over 40% higher efficiency compared to unconstrained interaction. Our analysis reveals emergent coordination patterns: agents naturally adopt manager centric hub-and-spoke topologies, strategically escalate from asynchronous to synchronous channels based on complexity, and prioritize high value help requests. These patterns remain consistent across multiple frontier models (GPT-5.2, Claude Sonnet 4.5, Gemini 2.5 Pro). This study moves beyond simple agent construction, offering a theoretical foundation for quantifying and optimizing the dynamics of collaboration in future digital workplaces.

cs.MA↗

arXiv2025

RedOne: Revealing Domain-specific LLM Post-Training in Social Networking Services

As a primary medium for modern information dissemination, social networking services (SNS) have experienced rapid growth, which has proposed significant challenges for platform content management and interaction quality improvement. Recently, the development of large language models (LLMs) has offered potential solutions but existing studies focus on isolated tasks, which not only encounter diminishing benefit from the data scaling within individual scenarios but also fail to flexibly adapt to diverse real-world context. To address these challenges, we introduce RedOne, a domain-specific LLM designed to break the performance bottleneck of single-task baselines and establish a comprehensive foundation for the SNS. RedOne was developed through a three-stage training strategy consisting of continue pretraining, supervised fine-tuning, and preference optimization, using a large-scale real-world dataset. Through extensive experiments, RedOne maintains strong general capabilities, and achieves an average improvement up to 14.02% across 8 major SNS tasks and 7.56% in SNS bilingual evaluation benchmark, compared with base models. Furthermore, through online testing, RedOne reduced the exposure rate in harmful content detection by 11.23% and improved the click page rate in post-view search by 14.95% compared with single-tasks finetuned baseline models. These results establish RedOne as a robust domain-specific LLM for SNS, demonstrating excellent generalization across various tasks and promising applicability in real-world scenarios.

cs.LG↗

arXiv2025

Machine learning-based parameter optimization for M\"untz spectral methods

Spectral methods employing non-standard polynomial bases, such as M\"untz polynomials, have proven effective for accurately solving problems with solutions exhibiting low regularity, notably including sub-diffusion equations. However, due to the absence of theoretical guidance, the key parameters controlling the exponents of M\"untz polynomials are usually determined empirically through extensive numerical experiments, leading to a time-consuming tuning process. To address this issue, we propose a novel machine learning-based optimization framework for the M\"untz spectral method. As an illustrative example, we optimize the parameter selection for solving time-fractional partial differential equations (PDEs). Specifically, an artificial neural network (ANN) is employed to predict optimal parameter values based solely on the time-fractional order as input. The ANN is trained by minimizing solution errors on a one-dimensional time-fractional convection-diffusion equation featuring manufactured exact solutions that manifest singularities of varying intensity, covering a comprehensive range of sampled fractional orders. Numerical results for time-fractional PDEs in both one and two dimensions demonstrate that the ANN-based parameter prediction significantly improves the accuracy of the M\"untz spectral method. Moreover, the trained ANN generalizes effectively from one-dimensional to two-dimensional cases, highlighting its robustness across spatial dimensions. Additionally, we verify that the ANN substantially outperforms traditional function approximators, such as spline interpolation, in both prediction accuracy and training efficiency. The proposed optimization framework can be extended beyond fractional PDEs, offering a versatile and powerful approach for spectral methods applied to various low-regularity problems.

math.NA↗

arXiv2025

Analysis of Information Loss on Composition Measurement in Stiff Chemically Reacting Systems

Gas sampling methods have been crucial for the advancement of combustion science, enabling analysis of reaction kinetics and pollutant formation. However, the measured composition can deviate from the true one because of the potential residual reactions in the sampling probes. This study formulates the initial composition estimation in stiff chemically reacting systems as a Bayesian inference problem, solved using the No-U-Turn Sampler (NUTS). Information loss arises from the restriction of system dynamics by low dimensional attracting manifold, where constrained evolution causes initial perturbations to decay or vanish in fast eigen-directions in composition space. This study systematically investigates the initial value inference in combustion systems and successfully validates the methodological framework in the Robertson toy system and hydrogen autoignition. Furthermore, a gas sample collected from a one-dimensional hydrogen diffusion flame is analyzed to investigate the effect of frozen temperature on information loss. The research highlights the importance of species covariance information from observations in improving estimation accuracy and identifies how the rank reduction in the sensitivity matrix leads to inference failures. Critical failure times for species inference in the Robertson and hydrogen autoignition systems are analyzed, providing insights into the limits of inference reliability and its physical significance.

stat.AP↗

arXiv2024

Systematic Analysis of LLM Contributions to Planning: Solver, Verifier, Heuristic

In this work, we provide a systematic analysis of how large language models (LLMs) contribute to solving planning problems. In particular, we examine how LLMs perform when they are used as problem solver, solution verifier, and heuristic guidance to improve intermediate solutions. Our analysis reveals that although it is difficult for LLMs to generate correct plans out-of-the-box, LLMs are much better at providing feedback signals to intermediate/incomplete solutions in the form of comparative heuristic functions. This evaluation framework provides insights into how future work may design better LLM-based tree-search algorithms to solve diverse planning and reasoning problems. We also propose a novel benchmark to evaluate LLM's ability to learn user preferences on the fly, which has wide applications in practical settings.

cs.AI↗

arXiv2024

STRUX: An LLM for Decision-Making with Structured Explanations

Countless decisions shape our daily lives, and it is paramount to understand the how and why behind these choices. In this paper, we introduce a new LLM decision-making framework called STRUX, which enhances LLM decision-making by providing structured explanations. These include favorable and adverse facts related to the decision, along with their respective strengths. STRUX begins by distilling lengthy information into a concise table of key facts. It then employs a series of self-reflection steps to determine which of these facts are pivotal, categorizing them as either favorable or adverse in relation to a specific decision. Lastly, we fine-tune an LLM to identify and prioritize these key facts to optimize decision-making. STRUX has been evaluated on the challenging task of forecasting stock investment decisions based on earnings call transcripts and demonstrated superior performance against strong baselines. It enhances decision transparency by allowing users to understand the impact of different factors, representing a meaningful step towards practical decision-making with LLMs.

cs.CL↗

arXiv2024

DeFine: Decision-Making with Analogical Reasoning over Factor Profiles

LLMs are ideal for decision-making thanks to their ability to reason over long contexts. However, challenges arise when processing speech transcripts that describe complex scenarios, as they are verbose and include repetition, hedging, and vagueness. E.g., during a company's earnings call, an executive might project a positive revenue outlook to reassure investors, despite uncertainty regarding future earnings. It is crucial for LLMs to incorporate this uncertainty systematically when making decisions. In this paper, we introduce \textsc{DeFine}, a modular framework that constructs probabilistic factor profiles from complex scenarios. It then integrates these profiles with analogical reasoning, leveraging insights from similar past experiences to guide LLMs in making critical decisions in new situations. Our framework separates the tasks of quantifying uncertainty and incorporating it into LLM decision-making. This approach is particularly useful in areas such as consulting and financial deliberation, where making decisions under uncertainty is vital.

cs.CL↗

arXiv2022

Rethinking Goal-conditioned Supervised Learning and Its Connection to Offline RL

Solving goal-conditioned tasks with sparse rewards using self-supervised learning is promising because of its simplicity and stability over current reinforcement learning (RL) algorithms. A recent work, called Goal-Conditioned Supervised Learning (GCSL), provides a new learning framework by iteratively relabeling and imitating self-generated experiences. In this paper, we revisit the theoretical property of GCSL -- optimizing a lower bound of the goal reaching objective, and extend GCSL as a novel offline goal-conditioned RL algorithm. The proposed method is named Weighted GCSL (WGCSL), in which we introduce an advanced compound weight consisting of three parts (1) discounted weight for goal relabeling, (2) goal-conditioned exponential advantage weight, and (3) best-advantage weight. Theoretically, WGCSL is proved to optimize an equivalent lower bound of the goal-conditioned RL objective and generates monotonically improved policies via an iterated scheme. The monotonic property holds for any behavior policies, and therefore WGCSL can be applied to both online and offline settings. To evaluate algorithms in the offline goal-conditioned RL setting, we provide a benchmark including a range of point and simulated robot domains. Experiments in the introduced benchmark demonstrate that WGCSL can consistently outperform GCSL and existing state-of-the-art offline methods in the fully offline goal-conditioned setting.

cs.LG↗

arXiv2021

SEIHAI: A Sample-efficient Hierarchical AI for the MineRL Competition

The MineRL competition is designed for the development of reinforcement learning and imitation learning algorithms that can efficiently leverage human demonstrations to drastically reduce the number of environment interactions needed to solve the complex \emph{ObtainDiamond} task with sparse rewards. To address the challenge, in this paper, we present \textbf{SEIHAI}, a \textbf{S}ample-\textbf{e}ff\textbf{i}cient \textbf{H}ierarchical \textbf{AI}, that fully takes advantage of the human demonstrations and the task structure. Specifically, we split the task into several sequentially dependent subtasks, and train a suitable agent for each subtask using reinforcement learning and imitation learning. We further design a scheduler to select different agents for different subtasks automatically. SEIHAI takes the first place in the preliminary and final of the NeurIPS-2020 MineRL competition.

cs.LG↗

arXiv2021

Towards robust and domain agnostic reinforcement learning competitions

Reinforcement learning competitions have formed the basis for standard research benchmarks, galvanized advances in the state-of-the-art, and shaped the direction of the field. Despite this, a majority of challenges suffer from the same fundamental problems: participant solutions to the posed challenge are usually domain-specific, biased to maximally exploit compute resources, and not guaranteed to be reproducible. In this paper, we present a new framework of competition design that promotes the development of algorithms that overcome these barriers. We propose four central mechanisms for achieving this end: submission retraining, domain randomization, desemantization through domain obfuscation, and the limitation of competition compute and environment-sample budget. To demonstrate the efficacy of this design, we proposed, organized, and ran the MineRL 2020 Competition on Sample-Efficient Reinforcement Learning. In this work, we describe the organizational outcomes of the competition and show that the resulting participant submissions are reproducible, non-specific to the competition environment, and sample/resource efficient, despite the difficult competition task.

cs.LG↗