AI agents

Tool use, function calling, orchestration and the protocols that let models act rather than only answer.

15,743 stories · RSS feed

arXiv AI
Oct 1

From Verification Failures to Reusable Guidance for Coding Agents

The paper presents a method for turning expert diagnoses of verification failures into reusable guidance for coding agents. By combining executable language definitions in the K framework with a set of procedures for constructing specifications, repairing proofs, and auditing their adequacy, the authors achieve a 164/164 success rate on the HumanEval benchmark after two targeted repairs. They further demonstrate that audits can detect defects missed by successful proofs and evaluate the approach on KleverBench and Optimism proofs, highlighting both progress and remaining challenges.

By Yuqing Zhai, Xiaohong Chen, Lingming Zhang, Sriram Vishwanath, Grigore Rosu
arXiv AI
Oct 1

ComputerSD: Online Self-Distillation from Real-Time Feedback for Computer-Use Agents

ComputerSD is an online self‑distillation method for computer‑use agents that leverages real‑time feedback from executed GUI transitions. It uses a fine‑tuned GUI analyzer to generate guidance and a step‑level value score after each action, combining token‑level OPSD with trajectory‑level GRPO in an asynchronous training framework. On the OSWorld‑Verified benchmark, ComputerSD improves performance over outcome‑only GRPO by 1.9 and 4.1 percentage points on Qwen3‑VL‑8B‑Thinking and EvoCUA‑8B backbones, and shows strong generalizability in out‑of‑distribution tests.

By Yong Du, Tongbo Chen, Zhengxi Lu, Yizhou Liu, Bofan Chen, Tao Jiang, Wenhao Xu, Yongliang Shen
arXiv Statistics ML
Oct 1

Learning to Plan from Random Exploration

arXiv:2609.38383v1 Announce Type: cross Abstract: Random exploration reveals how an environment can be traversed before a goal is specified. Can this experience support long-range planning without po...

By Deqian Kong, Guangyan Sun, Sheng Cheng, Sirui Xie, Bo Pang, Jianwen Xie, Tony Geng, Caiwen Ding, Ying Nian Wu
arXiv AI
Oct 1

Evaluating Persistent Calibration under Evolving Model Knowledge

The paper introduces the concept of persistent calibration, which requires a confidence estimator to accurately reflect a model’s evolving knowledge without additional supervision. It evaluates this by comparing confidence estimators trained on earlier checkpoints to their performance on later checkpoints using knowledge contrast sets—questions that shift from correct to incorrect answers across checkpoints. The study finds that standard inference-time and fine-tuning methods underperform compared to oracle methods, and suggests that multi-checkpoint training can improve calibration by identifying robust confidence features.

By Victor Wang, Thomas Hofweber, Mohit Bansal, Elias Stengel-Eskin
arXiv AI
Oct 1

Mitigating the Length-Scaling Tax with Online Distillation

The paper introduces Length Self-Distillation (LSD) to address the length‑scaling tax (LST) that occurs during reinforcement‑learning post‑training, where models produce unnecessarily verbose responses to already‑solved prompts. LSD routes solved prompts to an on‑policy distillation process while keeping the original RL objective for unsolved prompts, using an exponential moving average of the online policy as its teacher. Experiments show LSD matches or surpasses RL performance while reducing LST from 19.0% to –3.7% on single‑turn reasoning and from 31.4% to 13.7% on multi‑turn agentic tasks, thereby maintaining concise responses on easy queries while still enabling exploration on difficult ones.

By Xu Wan, Wenyue Xu, Shengjie Zhao, Mingyang Sun
arXiv AI
Oct 1

Right Answers, Costly Models: The Efficiency Gap in LLM-based Optimization Modeling

The paper introduces OptTips, a knowledge base of 50 expert optimization modeling techniques, and OptDachshund, a multi‑agent framework that generates mathematical models and solver code from natural‑language problem descriptions. Using these tools, the authors create the EfficientOpt benchmark, comprising 561 expert‑reviewed tasks with paired reference implementations, to evaluate large language models (LLMs) on both correctness and computational efficiency. Their experiments with 11 LLMs show a consistent efficiency gap: even when LLMs produce correct solutions, the resulting programs often take longer to solve than expert‑crafted counterparts, highlighting the need to assess both accuracy and runtime performance in LLM‑based optimization modeling.

By Zhong Li, Xin Huang, Jinhui Wan, Xiangyi Wang, Shenkai Zhang, Ruiqi Chen, Wenyu Liu, Zaiwen Wen, Ziyan Luo
arXiv AI
Oct 1

Inference Auctions

The paper proposes an inference auction for large language model (LLM) APIs, enabling users to bid for faster service when compute demand exceeds capacity. The auction allocates priority efficiently without increasing latency, and includes fast algorithms for truthful bidding and an autobidding agent that adjusts bids within a user’s budget to maximize utility. Experiments show the auction improves system welfare while preserving the cache utilization and latency benefits of the SGLang inference framework.

By Keegan Harris, Siddharth Prasad, Asher Trockman, Nika Haghtalab, Michael I. Jordan
arXiv AI
Oct 1

Self-Evolving Harness on Multiple Tasks with the Agent as Its Own Optimizer

The paper introduces a self‑evolving harness framework where a frozen language‑model agent first solves tasks and then edits its own harness based on run records. Using a 49‑line seed harness, the evolved harness improves average scores on in‑distribution benchmarks by 4.48 points and on out‑of‑distribution benchmarks by 12.64 points, surpassing Codex on the former and matching it on the latter. Continued evolution on a specific out‑of‑distribution benchmark further raises performance, and the study analyzes emergent mechanisms such as output truncation and history compaction.

By Qiankai Xu
arXiv AI
Oct 1

Beyond the Shadows of Plato's Cave: Evaluating False Memory in Autonomous Agents via Counterfactual Reasoning

The paper introduces FAME, a training‑free framework that evaluates false memory in autonomous agents by tracking how their internal beliefs shift under counterfactual scenarios. False memory, defined as biases arising from spurious correlations, environment shifts, or knowledge conflicts, is hard to detect with standard methods. FAME measures concept drift in hidden states, achieving AUROCs between 76.2% and 96.7% and outperforming baselines on benchmarks such as GSM‑Symbolic, GitChameleon, and BigBench‑Hard.

By Quan M. Tran, Zhuo Huang, Zhen Fang, Jing Zhang, Mingming Gong, Tongliang Liu