Searcharxiv⌕ Search

arXiv subjects

Yong Li

Publications and source records attributed to Yong Li.

At least 19 recordsLinked to original sources

Advancement or Acceleration? How Data Curation Improves LLM Training

While data curation is widely credited with improving large language model training, a basic question remains unresolved: does curation expand what a model can ultimately learn, or merely reach the same solution faster? In this paper, we formalize this distinction between advancement (improving the attainable performance) and acceleration (reaching the same performance with less data). Through an analytic characterization and real-world LLM experiments, we show that advancement requires a correctable train-target gap. When the baseline training and target objectives coincide, no curation policy improves the endpoint, although curation may still accelerate training. This reframes advancement as a property of the curation task rather than the curation method. Under a common gap-centric view of data mixture and selection, we operationalize this condition as the $Δ$-test, an observable discrepancy between the uncurated baseline's training and target losses that is computable prior to expensive curation. Across extensive experiments, an appreciably nonzero $Δ$ predicts persistent gains, whereas gains near $Δ=0$ tend to diminish as the training budget grows. Beyond individual methods, our findings recenter data curation on the task itself and point to target-set construction as a promising direction for shaping what curation can achieve.

cs.LG↗

Microscopic constitutive freedom in metamaterials

Metamaterials expand the range of accessible macroscopic responses through architectural design. Here, a cross-scale design strategy is introduced that combines microscopic control of static constitutive properties with spectral engineering through macroscopic architecture. Beyond shaping frequency-dependent responses, this strategy modifies the corresponding broadband performance bounds in passive systems by engineering the static parameters entering causal constraints. The concept is realized in granular activated carbon, where reversible sorption enhances equilibrium compressibility. Extrapolation of a multiscale model supported by low-frequency measurements to the zero-frequency limit yields an effective static bulk modulus approximately half the conventional nonsorbing isothermal reference value. This reduction substantially lowers the corresponding causal minimum-thickness bound for rigidly backed absorbers. A cascaded hierarchical composite architecture further redistributes absorption toward the target frequency band, achieving near-perfect absorption with a normal-incidence absorption coefficient above 0.9 across most of the 40--6400 Hz range. Together, static constitutive control and macroscopic spectral design enable ultrabroadband sound absorption beyond the conventional isothermal thickness benchmark without violating causality. This strategy offers a new approach to extending the attainable performance of metamaterials.

physics.app-ph↗

WorldArena 2.0: Extending Embodied World Model Benchmarking on Modality, Functionality and Platform

World models have emerged as a central paradigm for embodied intelligence, enabling agents to predict action-conditioned future and reason about environmental dynamics. However, existing embodied world model benchmarks are still largely confined to vision-only prediction, offline embodied applications, and simulator-based evaluation, making them insufficient for assessing increasingly comprehensive world models. In this work, we introduce WorldArena 2.0, an expanded benchmark that systematically broadens embodied world model evaluation along three dimensions: modality, functionality, and platform. Along the modality dimension, WorldArena 2.0 extends evaluation from vision-only to visuotactile modalities, enabling assessment of multimodal perception and prediction. Along the functionality dimension, it extends beyond policy evaluation and planning to assess world models as interactive RL environments for policy optimization. Along the platform dimension, it moves beyond simulator-only evaluation to a diverse suite of simulated and real-world robotic settings across multiple embodiments. Under a standardized protocol, WorldArena 2.0 comprehensively evaluates perceptual quality, interactive utility, and cross-platform performance, providing a comprehensive testbed for tracking progress toward embodied world models. The project page including codes and demos is available at: https://world-arena.ai/.

cs.RO↗

DriveUniTok: A Unified Multimodal Tokenizer for Driving World-Action Models

World models are emerging as a fundamental component of policy learning for real-world agents, enabling agents to predict future world states and plan actions within a learned representation of the dynamic environment. Existing approaches, however, often model appearance, metric geometry represented by projected LiDAR depth, and ego motion either partially or independently, overlooking the fact that these modalities are different projections of a shared underlying world state. This separation can lead to information loss and cross-modal inconsistency, ultimately limiting downstream performance. Motivated by this unified view of the world, we propose DriveUniTok, a unified multimodal tokenizer for driving world-action models (WAMs) that encodes these modalities in a single decodable continuous latent. We freeze DriveUniTok and adapt a pretrained diffusion model, DriveUniWAM, to predict future unified latents; the tokenizer then decodes them into future appearance, projected LiDAR depth, and ego trajectories. Experiments on NAVSIM demonstrate that our unified design achieves better future prediction and planning performance at lower downstream computational cost than separate-stream alternatives. With reinforcement learning post-training, DriveUniWAM achieves a PDMS of 91.54, reaching state-of-the-art performance among the evaluated WAM-based planners.

cs.CV↗

Ranking Function Generation with LLMs for Termination

Ranking functions are a fundamental technique for proving loop termination, but constructing them manually is challenging and requires substantial expertise. We propose RAINFALL, a neuro-symbolic framework which follows the generate-verify-refine paradigm and tightly integrates LLMs with symbolic verification. RAINFALL formulates ranking function synthesis as a code-completion task by inserting placeholders into the input program and constraining the LLM to fill four predefined slots for each loop. The completed program is then checked by a symbolic verifier. If verification succeeds, a valid ranking function is obtained; otherwise, the verifier's diagnostics are translated into natural-language feedback that guides iterative refinement of the LLM's output. We evaluate RAINFALL on two public benchmark suites comprising 358 terminating C programs. Using MiniMax V2.7, RAINFALL synthesizes verifiable ranking functions for 323 programs (90.22%), outperforming all promising baselines. In particular, it solves 12 more programs than PROTON 2.1, the best-performing baseline and winner of the SV-COMP 2026 Termination category. Furthermore, combining RAINFALL with PROTON 2.1 increases the success rate to 96.65% (346/358 programs). We also conduct ablation study confirming individual contributions of placeholder contracts, few-shot examples, symbolic verification, and diagnostic information feedback. Experiments across LLMs further confirm the effectiveness of RAINFALL. Our results suggest a generic, sound framework for ranking-function synthesis and, beyond termination, LLM-assisted synthesis of formally checkable liveness certificates, both of which represent new directions of software engineering research.

cs.SE↗

SRHarness: A Harness for Agentic Symbolic Regression

Recent agentic symbolic regression approaches increasingly rely on large language models to analyze data, select scientific operations, and refine hypotheses over long search trajectories. In such systems, performance depends not only on the underlying model and search strategy, but also on the runtime infrastructure that supports scientific search. We introduce SRHarness, a domain-specific harness for agentic symbolic regression built around three mechanisms: composable scientific actions that provide a common interface over raw, transformed, and candidate-derived quantities; persistent scientific state that retains evaluated hypotheses and exposes compact model-facing views; and trajectory lifecycle management that coordinates continuation, branching, restart, and termination. On LLM-SRBench, SRHarness consistently improves both numerical generalization and symbolic recovery under matched LLM backbones. With DeepSeek-v4-flash-0731, it achieves 93.69% symbolic accuracy on LSR-Transform, compared with 62.16% for SR-Scientist, and retains 72.97% accuracy on an anonymized variant that removes scientific descriptions and variable semantics, versus 39.64% for SR-Scientist. Under the same DeepSeek-v4-flash-0731 backbone, SRHarness also substantially outperforms Codex (72.97% vs. 20.72%) and reaches performance comparable to Codex with GPT-5.5, while simply providing Codex with the same scientific tools does not reproduce this advantage. These results show that effective agentic symbolic regression depends not only on models or tools, but also on structured runtime support for organizing scientific actions, accumulated hypotheses, and long-horizon search.

cs.AI↗

VETTA: Coordinating Turn- and Token-Level Credit Assignment for Multi-Turn LLM Agents

Multi-turn LLM agents often receive sparse task feedback across several interactions, while generating each response token by token. This creates two related credit-assignment questions: which responses helped achieve the outcome, and which generation decisions mattered within each response? Existing methods typically focus on only one level: turn-level methods evaluate complete responses but do not distinguish the decisions within them; token-level methods can propagate feedback across turns but do not explicitly model credit for each response. These complementary limitations motivate learning credit at both levels and coordinating it in a single policy update. We introduce VETTA, a credit assignment method that jointly learns turn- and token-level values through separate heads on a shared lightweight critic. VETTA computes advantages along both temporal sequences and combines each turn advantage with a within-response-centered token residual for PPO updates. Furthermore, to reduce value-learning cost, the critic retains only early Transformer blocks from the pretrained checkpoint used to initialize the actor. Experiments on four agent benchmarks demonstrate VETTA's strong performance. With Qwen2.5-7B-Instruct, VETTA achieves success rates of 95.5% on ALFWorld, 76.0% on WebShop, and 52.2% on ScienceWorld. With Qwen2.5-VL-3B-Instruct, it reaches 84.9% and 80.7% success on Sokoban under sparse and dense rewards, respectively. Critic-depth comparisons further show strong task performance with substantially lower critic-side computation. These results demonstrate that coordinating turn- and token-level credit with a lightweight shared critic improves agent performance while keeping value estimation efficient. Code is available at https://github.com/Jiaju-Chen/VETTA-official.

cs.LG↗

Octonionic and Monogenic Completions of Harmonic Functions

Let $Ω\subset\mathbb{R}^n$ be a domain, with $n\ge2$. We characterize the real-valued harmonic functions that can occur as prescribed real components of monogenic functions. For any fixed nonzero real Clifford module $M$ and any fixed unit vector $s\in M$, a smooth real-valued function $h$ can be written as $h=\langle F,s\rangle$ with $F$ monogenic if and only if the $(n-1)$-form $*dh$ is exact. Consequently, every real-valued harmonic function on $Ω$ admits such a representation if and only if $H_{\mathrm{dR}}^{n-1}(Ω)=0$. In dimension eight, the same exactness criterion characterizes the real parts of octonionic regular functions and yields the corresponding equivalence with $H_{\mathrm{dR}}^7(Ω)=0$. The proofs use global solvability of the Poisson equation and elementary identities for differential forms.

math.CV↗

BrainPro: Process-conditioned Pretraining with Topographic Retrieval for Large EEG Models

EEG foundation models are pretrained on heterogeneous corpora, but two challenges remain underexplored: (1) experimental protocols provide mental-process cues that are rarely used in masked pretraining, and (2) electrode montages vary across datasets, making spatial representations montage-dependent. Existing methods typically learn a single general-purpose representation and model spatial structure implicitly, limiting their ability to exploit process-related information under montage heterogeneity. We introduce BrainPro, a process-conditioned self-supervised pretraining framework that couples topographic retrieval with shared and process-associated representation learning. BrainPro maps dataset-specific montages to a universal channel-region template and retrieves channel- and region-level spatial filters to form a topographically aligned spatial basis. Over this basis, BrainPro learns a shared encoder for general EEG structure and additional affective, motor-related, and auxiliary residual branches for process-associated variation. Protocol-derived mental-process cues condition branch activation and region-weighted masked reconstruction, incorporating topographic spatial priors and process information. Across nine public BCI benchmarks, BrainPro achieves strong performance among evaluated baselines. Ablations, channel-drop analysis, encoder-configuration studies, and spatial-filter visualizations suggest that topographic retrieval and process-conditioned representation learning jointly improve EEG decoding. Our code is available at https://github.com/yi-ding-cs/BrainPro.

cs.LG↗

Effective stability and sharp logarithmic time scales for Hamiltonian PDEs on the circle

We prove effective stability and matching logarithmic upper bounds for small solutions of Hamiltonian PDEs on the one-dimensional torus. An analytic coefficient-majorant calculus and an explicit normal-form iteration yield stability times with logarithms of order $L^{1+1/p}/(\log L)^{1/p}$ for Gevrey weights and $L^{1+(q-1)/(pq+1)}$ for logarithmic ultra-differentiable weights, where $L=\log(1/\varepsilon)$ and $p\geq1$ measures the order dependence of the small divisors. Even frequencies are organized into the exact blocks $\{n,-n\}$; elementary frequency gaps and constant weights on these blocks close the energy estimate. We verify the hypotheses for convolution NLS, fractional NLS with every fixed noninteger exponent $η>1/2$, and a beam equation with a metric parameter and a variational gradient nonlinearity. Two fixed analytic nonlocal Hamiltonian PDEs admit finite-support solutions whose first prescribed norm amplification occurs on the same logarithmic scales along sequences $\varepsilon_n\to0$. The common lower theorem applies to every sufficiently small datum of each admissible equation. Its combination with these examples establishes sharpness of both regularity-dependent scales under the same analytic and arithmetic hypotheses.

math.AP↗

WorldScape Policy 2.0: Empowering Steerable World Action Modeling with Reasoning-Augmented Memory and In-Context Learning

World Action Models (WAMs) offer a promising paradigm for robotic manipulation by jointly modeling visual state transitions and robot actions. However, existing WAMs are constrained by limited temporal context, coarse episode-level language supervision, and predominantly text-only conditioning, which hinder task-progress tracking and fine-grained language-video-action grounding while limiting visual-context reasoning and cross-embodiment transfer. In this paper, we introduce WorldScape Policy 2.0, a controllable WAM with reasoning-augmented long short-term memory. Its causal short-term visual memory supplies recent observations as DiT prefill to preserve local interaction dynamics, while its long short-term event memory organizes historical VLM outputs into global-history, local-active, and event-boundary representations for progress-aware retrieval. The retrieved history augments perception and autoregressively generated planning tokens, yielding an implicit subgoal condition for autonomous planning; semantic forcing further transfers event-level instruction semantics into this latent planning pathway. To establish fine-grained multimodal controllability, we construct ManipEvent-5M, an event-grounded embodied pretraining dataset containing nearly 5 million event segments with aligned action trajectories, episode-level task instructions, segment-level subtask captions, goal images, and video demonstrations. These designs provide a unified interface for autonomous planning from high-level instructions and controllable execution from fine-grained text, goal-image, or video-context prompts. Experiments in both simulation and real-world platforms demonstrate superior capabilities in long-horizon autonomous planning, fine-grained instruction following and in-context adaptation.

cs.RO↗

UniW(A)M: A Unified Mixture-of-Experts Framework for World and World-Action Models

World models (WMs) and world-action models (WAMs) focus on future world prediction and executable action generation, respectively. Although these models learn shared physical dynamics and interaction semantics from embodied trajectories, they are typically trained in isolation, which restricts knowledge reuse between prediction and control. The central challenge is therefore to develop a unified learning framework that shares these dynamics while preserving the distinct modeling capabilities required by each paradigm. We propose UniW(A)M, a mixture-of-experts world-(action) model built upon diffusion Transformers that unifies action-conditioned world modeling and diverse WAM variants. Shared experts capture common dynamics, while atomic capability experts are reused across interfaces so that each interface keeps its own conditional pathway. At deployment, a plug-in adaptive interface router (PAIR) learns from a small subset of target-task chunk scenarios to select a suitable WAM interface for each execution chunk, balancing task success and execution efficiency while keeping the backbone frozen. We evaluate UniW(A)M on LIBERO, RoboTwin 2.0, and three real-world manipulation tasks, where it achieves 88.3% average real-world success versus 76.7% for the strongest baseline. On WorldArena, it leads action-conditioned world modeling on all three tasks. AC-WM co-training contributes to action generation on every action interface and PAIR raises OOD success from 63.3% to 76.7%.

cs.RO↗

HP-PnP-Flow: Hybrid Time Scheduling and Projection for Plug-and-Play Image Restoration via Flow Matching

Image restoration is a fundamental inverse problem that seeks to recover high-quality images from degraded observations. Plug-and-Play (PnP) methods provide a flexible framework for integrating pretrained denoisers into iterative reconstruction, whereas flow matching offers an efficient generative modeling approach based on continuous-time ODE dynamics. Very recently, Martin et al.\ (ICLR, 2025) developed a PnP-Flow method, which integrates the PnP framework with flow matching through a time-dependent denoiser constructed from a pretrained flow matching model.By incorporating a different time schedule and an additional pixel-space projection operator, this paper proposes a novel efficient PnP-Flow algorithm (HP-PnP-Flow) that enjoys rigorous convergence guarantees under mild assumptions, without imposing restrictive conditions on iterates required by the aforementioned work. Numerical experiments on CelebA and AFHQ-Cat demonstrate that the newly proposed HP-PnP-Flow algorithm significantly outperforms PnP-Flow on several restoration tasks such as denoising, deblurring, super-resolution, random inpainting, and box inpainting. Notably, our algorithm achieves comparable or better reconstruction quality with substantially fewer iterations, reducing the iteration count from $500$ to $100$ for deblurring and super-resolution on AFHQ-Cat.

cs.CV↗

VERAS: Verification-Guided Adaptive Search for Reliable Operations Research

Advances in reasoning, coding, and tool use enable LLM agents to solve operations research (OR) problems through iterative problem modeling, program construction, and verification. Yet passing self-authored verification does not ensure that the solutions satisfy task constraints and meet optimization quality. This gap can arise from correlated specification errors, where the generated program and its checks share omissions or misinterpretations of task requirements, alongside incomplete verification coverage and ineffective optimization strategies. We propose VERAS, a verification-guided adaptive search harness for reliable OR that uses verification evidence to prioritize feasibility repair, constraint-coverage review, and solution-quality improvement. VERAS combines task-specific solution checkers with a separate verification agent to examine candidate solutions against the task requirements. It uses verification feedback to guide feasibility repair, additional constraint checking, and objective improvement, while candidate acceptance criteria screen revisions for deterioration in output validity or constraint satisfaction. On ORAgentBench, VERAS achieves a 42.99% pass rate, exceeding the reported 35.51% of Codex using the same LLM. Across two industrial-scale OR problems, VERAS reduces inter-datacenter peak bandwidth by 10.34% relative to native Codex and lowers annualized distribution network planning costs by 6.28% compared with expert-designed solutions. Code and evidence are available at https://github.com/holimario/VERAS.

cs.SE↗

No One-Size-Fits-All: Adaptive Code Editing with Feature-Based Strategy Selection

Large language models have shown strong potential in automating code editing (CE) tasks, yet most existing systems rely on a fixed CE strategy (i.e., one-step, search-replace, and plan-apply) across diverse scenarios. In practice, CE tasks vary widely in code context, edit locality, and semantic complexity, causing no single strategy to perform consistently well. Moreover, systematic studies on the relationship between strategies and CE tasks remain scarce, limiting further optimization of LLM-based code editing strategies. To address this gap, we construct CEBench, comprising 500 real-world CE tasks curated from SWE-bench. Then we compare three representative CE strategies (one-step, search-replace, plan-apply). Our study reveals two key findings: (1) each strategy exhibits distinct advantages for specific CE tasks, with no universal optimality; (2) strategy effectiveness is significantly influenced by four core task features: total lines of code, modification type, modification scope, and task type. Motivated by these findings, we propose Ace, an adaptive code editing framework that dynamically selects optimal CE strategies based on task features. Unlike classifier-based or instruction-prompting approaches, Ace employs a fine-tuned LLM that learns feature-strategy mappings from empirical data to recommend strategies with interpretable rationales. Extensive experiments on our CEBench-verified show that Ace outperforms state-of-the-art baselines: it boosts Pass@1 by 21.7% while reducing token consumption by 27.3% compared to the best baseline (AutoCodeRover). Our strategy selector achieves 72.6% selection accuracy with 69.9% rationale accuracy (Cohen's Kappa = 0.807), providing transparent and trustworthy decision-making for developers.

cs.SE↗

UniWind: Day-Ahead Wind Power Forecasting via Physics-Informed State Routing

Accurate day-ahead wind power forecasting is essential for cost-effective power-system operation. Wind power generation is primarily driven by future meteorological conditions while retaining temporal dependencies in power generation. In practice, observed wind-farm power reflects both meteorology-driven generation potential and deviations associated with local environmental and operational factors. Existing physical models provide useful constraints but adapt poorly across wind farms, whereas data-driven models can capture rich correlations but do not explicitly structure these two sources of variation. To bridge this gap, we propose UniWind, a wind power forecasting framework that integrates physics-informed generation priors with data-driven state-aware corrections. UniWind first employs a Physical Prior Estimator to construct a site-calibrated physical prior by combining a site-conditioned monotone warp with a shared physical power curve. It further applies a physical upper-bound constraint to shape this prior as a soft envelope of available wind power generation. UniWind then uses a Latent State Encoder to construct latent power-state representations from historical prior-power discrepancies and future meteorological context, and transforms the physical prior into final power forecasts through a State-aware Power Corrector with pseudo-label-guided routing and bounded expert correction. Experiments on 24 real-world datasets demonstrate UniWind's strong forecasting accuracy, robustness, and generalization across full-shot, cross-farm zero-shot, and cross-region zero-shot settings.

cs.LG↗

Nonpersistence of full-dimensional tori with polynomial decay in nonlinear Schrödinger equations

We establish local nonpersistence of full-dimensional invariant tori with polynomially decaying actions for the periodic quintic nonlinear Schrödinger equation \[ iu_t-u_{xx}+T_vu+μ|u|^4u=0,\qquad x\in\mathbb T:=\mathbb R/(2π\mathbb Z). \] For every $κ\geq1$, we construct a fixed bounded real Fourier multiplier $T_ve^{ijx}=v_je^{ijx}$ whose frequencies $λ_j=j^2+v_j$ satisfy the Bourgain-type Diophantine condition \[ \operatorname{dist}\left(\sum_j\ell_jλ_j,\mathbb Z\right) \geqγ_κ\prod_j(1+\ell_j^2\langle j\rangle^{2κ})^{-1} \] for some $γ_κ>0$ and every nonzero finitely supported integer sequence $\ell$, where $\langle j\rangle=\max\{1,|j|\}$. For this multiplier, every $3 0$, and all sufficiently small $μA^2>0$, the closed relative action tube of radius $3/10$ around $I_j=A\langle j\rangle^{-M}$ contains no full-dimensional invariant torus in $H^1(\mathbb T)$ carrying a complete flow, with arbitrary frequencies allowed. This advances the study of the polynomial-decay problem identified by Kuksin as a main open problem in KAM theory for one-dimensional Hamiltonian PDEs [Amer. Math. Soc. Transl. Ser. 2, 212 (2004), 237--258, Problem 7.1]. Bourgain discussed a related question for short-range Hamiltonian systems [Russian Math. Surveys 59 (2004), 231--246, Section 3]. The proof combines simultaneous Diophantine and weighted homological estimates, an exact common-phase transformation, and one normal-form step on four adjacent Fourier coordinates. Uniform phase rotation forces an action excursion, while overlapping parameter intervals cover all sufficiently small positive perturbations. The mechanism suggests applications to other Hamiltonian PDEs.

math.DS↗

A globally defined compressible polyconvex isotropic energy satisfying the true-stress-true-strain monotonicity condition (TSTS-M++)

We construct a compressible isotropic energy on $\mathrm{GL}^+(3)$ combining polyconvexity and global true-stress-true-strain monotonicity (TSTS-M++), answering a question of Wollner, Holzapfel and Neff. For every $μ>0$ and $k>0$, the energy $W_k(F)=\fracμ{2k}[\exp(k(\lVert F\rVert^2+3J^{-1}+J-7))-1]$, $J=\det F$, is polyconvex and strictly rank-one convex. Its Cauchy-stress response satisfies TSTS-M++ globally if and only if $k\ge1/(8\sqrt3)$. The reference state is stress free with positive infinitesimal shear and bulk moduli. Stress bijectivity has the smaller sharp threshold $k_{\rm B}\approx0.0083$: at equality the stress map is a global homeomorphism with a nondifferentiable inverse, and above it a global smooth diffeomorphism. Thus, for $k_{\rm B}\le k<1/(8\sqrt3)$, the Cauchy-stress map remains globally bijective while TSTS-M++ fails at finite strain. In the TSTS-M++ regime, each prescribed inner radius of a finite plane-strain annulus with a traction-free outer wall has a unique radial equilibrium, and the inner pressure increases smoothly and strictly from zero to infinity. Comparisons with other energies distinguish the roles of polyconvexity, TSTS-M++, reduced convexity and endpoint growth. Under incompressible spherical inflation, global pressure inversion holds for the Demiray family with $b\ge b_*$, including $W_k|_{J=1}$ for $k\ge k_*$ and the stress-free $I_1$-exponential energy, and for the exponentiated Hencky energy when $k_{\mathrm{eH}}>3/8$. Incompressible neo-Hooke instead has a limit point. A further compressible $I_1$ energy retains the global constitutive properties and reference moduli of $W_k$ but exhibits two pressure turning points under incompressible spherical inflation, showing that these properties allow a descending pressure branch.

math.AP↗