arXiv AI

Recursive Semantic Divergence for LLM Agent Consistency

The paper introduces Recursive Semantic Divergence (RSD), an unsupervised, trajectory‑level consistency metric for large language model agents that use tools. RSD recursively measures expected cumulative semantic disagreement between two independent rollouts from the same state, using natural language inference to detect logical inconsistency. When applied as a reward signal during fine‑tuning, RSD significantly reduces variability in task progress across benchmarks and model scales while matching supervised fine‑tuning performance without needing ground‑truth labels.

arXiv Computation and Language
Sep 16

Spurious Tool Use: When RL Agents Learn the Wrong Reason to Act

The paper investigates how reinforcement learning can cause large language model agents to adopt shortcut policies for tool use, relying on superficial prompt cues rather than actual task needs. By creating synthetic environments that mix factual QA and math reasoning, the authors show that agents often invoke tools when cues are present, even when those tools are unnecessary, with spurious invocation rates rising up to 39%. They find that shortcut learning occurs mainly when agents have already mastered the target tool and that semantic alignment between cues and tools amplifies the effect. To counter this, they propose a dense, decision-level reward where an LLM judge assesses tool necessity, which reduces cue-driven tool use while maintaining performance.

By Yiwei Yang, Haoxiang Zhang, Bingbing Wen, Yao Lu, Yuchen Wu, Lei Zhang, Julian McAuley, Pan Lu, Bill Howe
arXiv AI
Aug 18

From Sequence to Structure: Relational Uncertainty Propagation for LLM Agents

The paper introduces RUPA, a trajectory‑level uncertainty quantification framework for large language model agents. RUPA models an agent’s execution as a directed graph of reasoning states, tool interactions, and environment feedback, then propagates uncertainty across this graph to capture long‑range dependencies. Experiments on benchmarks such as τ‑2, Terminal‑Bench‑2, and GAIA show that RUPA outperforms existing methods, enabling earlier failure detection and more reliable agent execution.

By Zhengzhao Ma. Boxi Cao, Yaojie Lu, Hongyu Lin, Xianpei Han, Le Sun
arXiv Machine Learning
5d ago

Natural Language Actor-Critic: Scalable Off-Policy Learning in Language Space

Natural Language Actor-Critic (NLAC) is a new actor‑critic algorithm that trains large language model (LLM) agents by using a generative LLM critic to produce natural‑language feedback instead of scalar rewards. By providing richer, actionable explanations for suboptimal actions, NLAC helps LLM policies improve without relying on random exploration, and it can be trained off‑policy without policy gradients. Experiments on reasoning, web browsing, tool‑use, and dialogue tasks show that NLAC outperforms existing training methods and offers a more scalable and stable training paradigm for LLM agents.

By Joey Hong, Kang Liu, Zhan Ling, Jiecao Chen, Sergey Levine
arXiv AI
Oct 12

SWE-Critix: Post-Training Generalist Verifiers for Assessing Coding-Agent Trajectories

SWE-Critix is a post‑training pipeline that creates generalist verifiers for coding‑agent trajectories. It uses supervised fine‑tuning followed by reinforcement learning to train 30B models on CodeForge‑Preview data, enabling the verifier to predict completion labels and generate natural‑language explanations. The approach raises classification accuracy from 57% to 78% on a held‑out test set.

By Jiajun Hu, Chun Yong Chong
arXiv AI
Oct 31

AEM: Adaptive Entropy Modulation for Multi-Turn Agentic Reinforcement Learning

AEM: Adaptive Entropy Modulation for Multi‑Turn Agentic Reinforcement Learning proposes a supervision‑free credit assignment technique that adjusts entropy dynamics at the response level during RL training. By aligning uncertainty estimation with the granularity of LLM agent actions and rescaling advantages based on a response‑level uncertainty proxy, AEM improves the exploration‑exploitation balance without relying on dense intermediate supervision. Experiments on ALFWorld, WebShop, and SWE‑bench‑Verified show consistent performance gains across models from 1.5B to 32B, including a 1.4% improvement in a state‑of‑the‑art software‑engineering RL framework.

By Haotian Zhao, Songlin Zhou, Yuxin Zhang, Stephen S. -T. Yau, Wenyu Zhang, Lun Tian, Tianshu Zhu, Yifeng Huang, Yucheng Zeng, Jingnan Gu, Daxiang Dong, Jianmin Wu