The ARIA framework for MAS-agnostic runtime inspection and amendment is developed, designed to integrate with any MAS that exposes execution trajectories and supports continuation replacement, and a compact model is taught to recognize when intervention is needed and how to correct an ongoing run.
This paper challenges the understanding capabilities of existing AI paradigms and emerging world models by asking a fundamental question: How quickly can reality change before an intelligent system can no longer reliably perceive, reason, and act? We formulate this as a theory- and model-agnostic challenge in which sys...
Symbolic regression searches for an equation that explains observed data. Numerical error is commonly used to guide the search, but it alone can favor an accurate surrogate over a candidate with the right structure. We propose L2G-SR, a framework for LLM-based symbolic regression that guides search with a learned struc...
Letian Huang, Xiangyu Wang, Haowei Lin et al.· 0 citations
Formal inequality proving requires mathematical reasoning and exact computation, often connected through intermediate lemmas and goal reformulations. We introduce IneqAgent, an agentic framework combining LLM reasoning with symbolic computation for inequality proving in Lean4. Lemma-level Monte Carlo Tree Search coordi...
Gao-Lei He, Jin-Hui Li, Ruo-Bing Zuo et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Representation-based safety defenses for vision-language models (VLMs) often learn to separate harmful from benign inputs, but separation alone does not establish what a risk score means or when it should be trusted. We introduce Counterfactual Neighborhood Risk Fields (CNRF), an evidence-grounded framework for selecti...
Tianshi Wang, Jingsong Wang, Fengling Li et al.· 0 citations
Correctness feedback suppresses the very evidence that specification-completeness auditing is designed to uncover: programs that satisfy a written contract but violate intended behavior. We demonstrate this objective reversal on 12 Verus/Rust tasks across four model families under matched call budgets. Independent no-f...
Agents pair reasoning models with harnesses that organize model calls, execute tools, load skill instructions, and retain history in memory. Understanding agent performance requires linking execution conditions to outcomes, behavior, and resource use. We introduce AlphaDiana, a measurement system with modular interface...
Zhanke Zhou, Zongze Li, Weikai Huang et al.· 0 citations
Reward-guided discrete diffusion enables test-time alignment with downstream objectives, but applying Sequential Monte Carlo (SMC) guidance at every denoising step is computationally expensive. Active guidance steps require additional reward evaluations and, for gradient-based proposals, value-gradient computations. Sp...
Jaehyeon Kim, Ziseok Lee, Siyoung Choi et al.· 0 citations
Rapid advances in AI capabilities are causing benchmarks to saturate. Once several models approach perfect scores, a benchmark loses its power to differentiate between them, and with it its utility for informing AI safety cases and frontier policies. Yet benchmark items produce far more information than the scores we t...
Morio Hamada, Jehyeok Yeon, Matteo Migliarini et al.· 0 citations
Large language model (LLM) agents can solve complex interactive tasks, yet reasoning and tool calls take time. In continuously changing environments, an otherwise correct action may arrive too late. We introduce RealtimeBench, with 180 tasks across six game types, to evaluate agents while games continue running during...
Ning-Xin Pan, Han-Yu Li, Ye-Qing Shen et al.· 0 citations
Video deep research aims to answer questions by jointly understanding video content and retrieving external knowledge from the open Web. However, these tasks often require diverse and multi-step tool-use trajectories, which may lead to unnecessary video tool calls, incurring additional costs and failure risk. In this p...
Xintong Zhang, Xiaomeng Fan, Shilin Yan et al.· 0 citations
Razborov's flag algebra method is one of the most successful tools for proving asymptotic density inequalities in extremal graph theory. It reduces an inequality about all large graphs avoiding a forbidden pattern to finitely many algebraic conditions, and a certificate satisfying them can be found by semidefinite prog...
Gyeongwon Jeong, Seonghun Park, Jihoon Hyun et al.· 0 citations