Challenge: Reinforcement learning (RL) has re-emerged as a natural approach for training interactive LLM agents in real-world environments.
Approach: They propose a variant that operates on a turn-level MDP formulation, instead of the commonly used token-level one.
Outcome: The proposed method is more robust than the widely used GRPO algorithm and more efficient than token-level MDPs.

Similar Papers

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.
PVPO: Pre-Estimated Value-Based Policy Optimization for Agentic Reasoning (2026.findings-acl)

Copied to clipboard

Challenge: extending grouping-based methods to agentic reasoning presents unique challenges . frequent environment interactions and tool invocations render intra-group advantage estimation unstable .
Approach: They propose a grouping-based method that uses a single round of rollouts to stabilize advantage estimation.
Outcome: a new RL framework outperforms grouping-based methods in retrieval tasks and advanced mathematical reasoning benchmarks.
SPPO: Sequence-Level PPO for Long-Horizon Reasoning Tasks (2026.acl-long)

Copied to clipboard

Challenge: Proximal Policy Optimization (PPO) is central to aligning Large Language Models with verifiable rewards.
Approach: They propose a scalable algorithm that harmonizes sample efficiency with stability of outcome-based updates.
Outcome: The proposed algorithm outperforms standard PPO and matches the performance of computation-heavy group-based methods.
AAPO: Enhancing the Reasoning Capabilities of LLMs with Advantage Margin (2026.acl-long)

Copied to clipboard

Challenge: Reinforcement learning (RL) has emerged as an effective approach for enhancing the reasoning capabilities of large language models.
Approach: They propose an algorithm that optimizes cross-entropy loss using advantages enhanced through a margin-based estimation scheme.
Outcome: Experimental results show that AAPO improves group relative advantage estimation compared to other methods.
Direct Multi-Turn Preference Optimization for Language Agents (2024.emnlp-main)

Copied to clipboard

Challenge: Extensive experiments on three multi-turn agent task datasets confirm the effectiveness and superiority of the DMPO loss function.
Approach: They propose a novel loss function for multi-turn agent tasks that replaces the policy constraint with the state-action occupancy measure constraint and adds length normalization to the Bradley-Terry model.
Outcome: Experiments on three multi-turn agent task datasets confirm the effectiveness and superiority of the proposed loss function.
AT²PO: Agentic Turn-based Policy Optimization via Tree Search (2026.acl-long)

Copied to clipboard

Challenge: Recent advances in large language models (LLMs) have catalyzed the development of autonomous agents capable of executing complex, multi-turn tasks.
Approach: They propose a framework for agentic reinforcement learning that integrates turn-level tree search with tree search to address key challenges.
Outcome: The proposed framework addresses key challenges: limited exploration diversity, sparse credit assignment, and misaligned policy optimization.
TSPO: Breaking the Double Homogenization Dilemma in Multi-turn Search Policy Optimization (2026.findings-acl)

Copied to clipboard

Challenge: Large Language Models (LLMs) can solve complex tasks through iterative information retrieval.
Approach: They propose a turn-level stage-aware policy optimization approach to solve this problem . they introduce a first-occurrence latent reward mechanism to allocate partial rewards .
Outcome: Experiments show that TSPO outperforms state-of-the-art models on Qwen2.5-3B and 7B models.
Back to Basics: Revisiting REINFORCE-Style Optimization for Learning from Human Feedback in LLMs (2024.acl-long)

Copied to clipboard

Challenge: Proximal Policy Optimization (PPO) is used for RLHF but requires high computational cost and sensitive hyperparameter tuning.
Approach: They propose to use Proximal Policy Optimization to align large language models to human preferences.
Outcome: The proposed method preserves and even increases performance while preserving the motivational principles that led to the development of PPO.
SALT: Step-level Advantage Assignment for Long-horizon Agents via Trajectory Graph (2026.findings-eacl)

Copied to clipboard

Challenge: Large Language Models (LLMs) have demonstrated remarkable capabilities, but their application to complex, multi-step, and long-horizon tasks remains challenging.
Approach: They propose a framework that provides a finer-grained advantage assignment derived solely from outcome rewards.
Outcome: The proposed framework provides a finer-grained advantage assignment, derived solely from outcome rewards.
Proximity-Based Multi-Turn Optimization: Practical Credit Assignment for LLM Agent Training (2026.acl-industry)

Copied to clipboard

Challenge: Existing group-based policy optimization methods rely on statistical deviation within discrete batches, misallocating credit when task difficulty fluctuates.
Approach: They propose a framework for multi-turn LLM agents that integrates global context . they propose GRPO, which integrates success-rate-aware modulation and proximity-based soft aggregation .
Outcome: The proposed framework yields performance gains over existing baselines with negligible computational cost.

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