AI agents

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

15,733 stories · RSS feed

arXiv AI
Oct 27

MiRL: Error-Targeted Reinforcement Learning for Correcting Terminal Agent Misbehaviors

MiRL is a new reinforcement learning approach that targets specific misbehaviors of terminal agents—models that execute long‑horizon tasks in natural language by interacting with a command shell. The method first profiles a policy to identify recurring wrong steps, then trains the policy by starting rollouts at those misbehaviors and rewarding only successful, misbehavior‑free trajectories. On the Qwen3.5‑4B model, MiRL reduces repeated misbehaviors by 43–57% on unseen prefixes and outperforms or matches baseline agents on Terminal‑Bench benchmarks while using only 35% of the rollouts.

By Runchu Tian, Zaid Khan, Zun Wang, Justin Chih-Yao Chen, Mohit Bansal
arXiv AI
Oct 27

UMAS: System-Level Uncertainty Quantification for Multi-Agent LLM Systems

UMAS is a parameter‑free, cost‑neutral framework for system‑level uncertainty quantification in multi‑agent large language model systems. It estimates the credibility of inter‑agent influence using each generation’s intrinsic confidence, modulates uncertainty updates at each node, and aggregates these into a system‑level estimate. Evaluations on Debate and DyLAN show UMAS outperforms state‑of‑the‑art baselines by an average of 10.54 AUROC points and improves hallucination detection and answer selection, boosting MAS accuracy by up to 12.6 points on specific tasks.

By Hanwen Li, Jinhao Duan, Xiaoshuang Shi, Yue Zhang, Tianlong Chen, Kaidi Xu, Chenxi Yuan
arXiv AI
Oct 27

Sparse Recovery Bird's-Eye View Model Soup for Robust Camera-Based 3D Object Detection

The paper introduces SR‑BEVS, a sparse recovery learning technique that enhances both clean accuracy and robustness to real‑world corruptions for camera‑based bird’s‑eye view (BEV) 3D object detection models. By pruning weights based on magnitude, generating diverse sparse models, retraining them with varied learning rates, and averaging the recovered models into a single dense model, the method achieves up to 33.8% improvement in corruption robustness and a 1.8% gain in clean accuracy over the Fast‑BEV baseline on the nuScenes dataset. The approach adds no inference overhead and preserves a connected low‑loss basin, suggesting applicability to other BEV models.

By Jinwoo Chung, Sangho An, Hyunsung Park, Jangho Kim
arXiv AI
Oct 27

Provably Efficient Q-learning for Robust Reinforcement Learning

The paper introduces a sample‑efficient asynchronous Q‑learning algorithm for robust reinforcement learning in infinite‑horizon, discounted robust MDPs with total‑variation uncertainty. It proves that, given a single Markovian trajectory, the algorithm achieves an entrywise ε‑approximation of the optimal Q‑function with a sample complexity bounded by a nearly minimax‑optimal expression involving the discount factor, uncertainty level, mixing time, and occupancy probability. This result improves significantly over prior bounds for robust RL.

By Yuchen Jiao, Gen Li