๐ค AI Summary
This work addresses the tendency of reinforcement learning agents to over-rely on external tools even when problems can be solved through internal reasoning, leading to inefficiency and constrained exploration. To mitigate this, the authors propose the Efficient Agent Policy Optimization (EAPO) framework, which dynamically adjusts tool-use penalties by jointly leveraging problem difficulty and model confidence signals. EAPO enables adaptive tool selection through tool-free trajectory sampling, difficulty-aware reward shaping, and confidence-driven token-level reweighting. Evaluated across nine reasoning benchmarks, EAPO achieves a superior accuracyโefficiency trade-off, outperforming GRPO by 7.27%โ10.45% in average performance while reducing tool invocations by 18.33%โ24.59%.
๐ Abstract
Agentic reinforcement learning can induce tool abuse, where models overuse external tools even for queries solvable by internal reasoning. Existing approaches mitigate this issue with uniform tool-use penalties or hard limits, which reduce tool frequency but may also suppress useful tool-assisted exploration. We propose EAPO, an Efficient Agentic Policy Optimization framework that learns selective tool use. EAPO introduces tool-free trajectories into each rollout group, applies difficulty-aware reward shaping to penalize redundant tool calls mainly on easier queries, and uses confidence-aware token reweighting to improve policy learning. Across nine mathematical and knowledge-intensive reasoning benchmarks, EAPO consistently improves the accuracy efficiency trade-off on Qwen2.5-3B, Qwen2.5-7B, and Llama3.1-8B. Compared with GRPO, EAPO improves average performance by 10.45%, 7.27%, and 9.69%, while reducing average tool calls by 18.33%, 18.33%, and 24.59%, respectively. These results show that agents can learn when not to use tools without compromising tool-integrated reasoning.