Challenge: Large language models (LLMs) can call tools effectively, but they remain brittle in multi-turn execution.
Approach: They propose a framework that converts execution errors into on-policy corrective supervision within the RL training loop.
Outcome: The proposed framework improves the error recovery rate of Qwen3-8B by 5.7% absolute and overall accuracy by 4.0% on BFCL v4 Multi-Turn.

Similar Papers

Failure makes the agent stronger: Enhancing Accuracy through Structured Reflection for Reliable Tool Interactions (2026.findings-acl)

Copied to clipboard

Challenge: Existing approaches to self-reflection rely on heuristic prompting or unidirectional reasoning traces.
Approach: They propose a structured reflection method that transforms the "from error to repair" process into a first-class, controllable, and trainable action.
Outcome: The proposed method improves multi-turn tool-call success rates and error recovery while reducing redundant calls.
Empowering Multi-Turn Tool-Integrated Agentic Reasoning with Group Turn Policy Optimization (2026.acl-long)

Copied to clipboard

Challenge: Current reinforcement learning methods suffer from coarse-grained, trajectory-level rewards that provide insufficient learning signals for complex multi-turn interactions, leading to training stagnation.
Approach: They propose a novel RL algorithm for training large language models for multi-turn tool-integrated reasoning (TIR) that incorporates three innovations: turn-level reward assignment that provides fine-grained feedback for individual turns, return-based advantage estimation where normalized discounted returns are calculated as advantages, and self-supervised reward shaping that exploits self-supervision signals from generated code to densify sparse binary outcome-based rewards.
Outcome: The proposed algorithm outperforms GRPO by 3.0% across diverse math reasoning benchmarks and improves grepo by 3.9% on commonsense reasoning and program synthesis tasks.
GRPO-CARE: Consistency-Aware Reinforcement Learning for Multimodal Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Recent reinforcement learning approaches have advanced reasoning in Large Language Models (LLMs), yet their adaptation to multimodal LLMs remains underexplored.
Approach: They propose a reinforcement learning framework that eliminates KL penalties and rewards consistency . they propose GRPO-CARE, which outperforms standard GR PO, with a base reward for accuracy and an adaptive bonus for consistency.
Outcome: The proposed framework outperforms standard GRPO on the most difficult evaluation level and reasoning consistency test benchmarks.
Save the Good Prefix: Precise Error Penalization via Process-Supervised RL to Enhance LLM Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: Existing reinforcement learning methods rely on sparse outcome rewards, which fail to credit correct intermediate steps in partially successful solutions.
Approach: They propose a process reward model that rewards correct steps only when they detect errors . they propose VPPO, which rewards the correct prefix and an erroneous suffix .
Outcome: a new approach outperforms sparse-reward RL and prior PRM-guided baselines on Pass@1 and Pass@K . a process reward model (PRM) outperformed sparser-rebound RL on multiple reasoning benchmarks .
Lost in Execution: On the Multilingual Robustness of Tool Calling in Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Large Language Models (LLMs) are increasingly deployed as agents that invoke external tools through structured function calls.
Approach: They introduce a diagnostic benchmark and conduct a systematic evaluation of multilingual tool calling across Chinese, Hindi, and the low-resource language Igbo.
Outcome: The proposed benchmarks show that multilingual tool calling fails despite correct intent understanding and tool selection.
Invocation Refiner: A Plug-and-Play Module for Rectifying LLM Tool Invocations (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have shown remarkable capabilities in Tool-Integrated Reasoning (TIR) however, the practical application is often hindered by frequent errors in tool invocations, such as incorrect tool names, invalid parameters, wrong tool-call order, or malformed invocation formats.
Approach: They propose a specialized post-processing module that performs independent reasoning on the input of a frozen upstream LLM and an advanced RL algorithm to improve the tool-use reliability of base LLMs.
Outcome: The proposed module improves task completion rates and invocation accuracy over the raw outputs of various upstream LLMs on a diverse set of tool-use and reasoning benchmarks.
CRPS: Curriculum Replay via Progressive Suffixes from Successful Trajectories for Long-Horizon LLM Agents (2026.findings-acl)

Copied to clipboard

Challenge: Long-horizon agents trained with sparse terminal rewards experience slow and unstable learning . this is amplified by group-normalized on-policy objectives, which yield degenerate advantages and weak learning signals.
Approach: They propose a lightweight RL-training strategy that turns terminal successes into within-trajectory curriculum by replaying from successful suffix states.
Outcome: The proposed strategy outperforms full-episode GRPO and naive experience replay across ALFWorld and WebShop with different foundation models.
LLMs in the Imaginarium: Tool Learning through Simulated Trial and Error (2024.acl-long)

Copied to clipboard

Challenge: Existing work on tool-augmented LLMs focuses on the broad coverage of tools and the flexibility of adding new tools.
Approach: They propose a biologically inspired method for tool-augmented LLMs that orchestrates three key mechanisms for successful tool use behaviors in the biological system: trial and error, imagination, and memory.
Outcome: The proposed method improves tool learning for LLMs under both in-context learning and fine-tuning settings, bringing a boost of 46.7% to Mistral-Instruct-7B and outperforms GPT-4.
DPEPO: Diverse Parallel Exploration Policy Optimization for LLM-based Agents (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to large language model (LLM) agents that follow the sequential "reason-then-act" paradigm suffer from limited exploration and incomplete environmental understanding as they interact with only a single environment per step.
Approach: They propose a paradigm that enables an agent to interact with multiple environments simultaneously and share cross-trajectory experiences.
Outcome: The proposed paradigm achieves state-of-the-art (SOTA) success rates while maintaining comparable efficiency to strong sequential baselines.
MASPO: Unifying Gradient Utilization, Probability Mass, and Signal Reliability for Robust and Sample-Efficient LLM Reasoning (2026.acl-long)

Copied to clipboard

Challenge: Existing RLVR algorithms rely on rigid, uniform, and symmetric trust region mechanisms . current algorithms lack robustness, asymmetric signal reliability and inefficient gradient utilization .
Approach: They propose a framework to harmonize three dimensions of RLVR algorithms, a paper argues . a binary cutoff is used to discard valuable reinforcement signals, they argue .
Outcome: The proposed framework outperforms baselines in evaluating a robust RLVR solution.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations