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.

Similar Papers

Turn-PPO: Turn-Level Advantage Estimation with PPO for Improved Multi-Turn RL in Agentic LLMs (2026.findings-eacl)

Copied to clipboard

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.
Token-Level Policy Optimization: Linking Group-Level Rewards to Token-Level Aggregation via sequence-level likelihood (2026.acl-long)

Copied to clipboard

Challenge: Group Relative Policy Optimization (GRPO) has significantly advanced the reasoning ability of large language models (LLMs).
Approach: They propose a token-level framework that leverages sequence-level likelihood to link group-level rewards with individual tokens via token- level aggregation and introduces a KL-Divergence mask constraint that targets tokens with positive advantages and decreasing entropy to mitigate abrupt policy updates.
Outcome: Experiments show that TEPO achieves state-of-the-art performance on mathematical reasoning benchmarks and reduces convergence time by 50% compared with GRPO/DAPO.
DialCoT Meets PPO: Decomposing and Exploring Reasoning Paths in Smaller Language Models (2023.emnlp-main)

Copied to clipboard

Challenge: Chain-of-Thought prompting has improved the reasoning capabilities of Large Language Models (LLMs) but it is ineffective or detrimental to the performance on reasoning tasks in Smaller Language Model (SLMs) with less than 10 billion parameters.
Approach: They propose a Dialogue-guided Chain-of-Thought method to improve the reasoning capabilities of Large Language Models (LLMs) by generating intermediate reasoning steps in a dialogue format to guide the model to the final answer.
Outcome: The proposed method can achieve significant performance gains over state-of-the-art competitors on four arithmetic reasoning datasets.
Improving the Language Understanding Capabilities of Large Language Models Using Reinforcement Learning (2025.findings-emnlp)

Copied to clipboard

Challenge: Instruction-fine-tuned large language models (LLMs) under 14B parameters underperform on NLU tasks . we explore a framework to improve the NLU capabilities of LLMs .
Approach: They propose to use Proximal Policy Optimization to improve NLU capabilities . they frame NLU as a reinforcement learning environment and optimize for reward signals .
Outcome: The proposed framework outperforms supervised fine-tuning on GLUE and superGLUE tasks.
TARo: Token-level Adaptive Routing for LLM Test-time Alignment (2026.findings-acl)

Copied to clipboard

Challenge: Large language models (LLMs) exhibit strong reasoning capabilities but typically require expensive post-training to reach high performance.
Approach: They propose to use token-level Adaptive Routing to steer frozen LLMs toward structured reasoning entirely at inference time.
Outcome: Extensive experiments show that TARo significantly improves reasoning performance by up to +22.4% over base model and +8.4% .
Token-level Proximal Policy Optimization for Query Generation (2025.emnlp-main)

Copied to clipboard

Challenge: Large Language Models (LLMs) have improved search engines and recommendation systems through their text understanding capabilities.
Approach: They propose a token-level proximal policy optimization approach to empower LLMs to perform better in query generation through fine-tuning.
Outcome: The proposed approach outperforms existing LLMs on an open-source and industrial dataset.
Sequence-level Large Language Model Training with Contrastive Preference Optimization (2025.findings-naacl)

Copied to clipboard

Challenge: a new method to improve the performance of large language models requires a small computational cost.
Approach: They propose a CPO procedure that can inject sequence-level information into the model at any training stage without expensive human labeled data.
Outcome: The proposed objective surpasses the next token prediction in terms of win rate in instruction-following and text generation tasks.
TLPO: Token-Level Policy Optimization for Mitigating Language Confusion in Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Prior mitigation approaches that optimize entire responses operate at the level of entire responses and can lead to unintended degradation of general model capabilities.
Approach: They propose a fine-tuning framework to mitigate erroneous outputs by localizing and updating the policy at a granular level.
Outcome: The proposed framework outperforms baselines on multiple multilingual LLMs across diverse languages while preserving task accuracy.
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.
Don’t Forget Your Reward Values: Language Model Alignment via Value-based Calibration (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods for generating large language models have been criticized for their complexity and instability.
Approach: They propose a value-based calibration method to better align Large Language Models with human preferences.
Outcome: The proposed method surpasses existing methods on AI assistant and summarization datasets, providing impressive generalizability, robustness, and diversity in different settings.

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