activity
20232026
most citedA General Theoretical Paradigm to Understand Learning from Human Preferences

14 citations · 24 across the 21 of their papers we have counts for

collaborators
Showing 2025Show all

9 papers · 1 filter

cs.LG2025★ 1 cited

Outcome-based Exploration for LLM Reasoning

Yuda Song, Julia Kempe, Remi Munos

Reinforcement learning (RL) has emerged as a powerful method for improving the reasoning abilities of large language models (LLMs). Outcome-based RL, which rewards policies solely…

cs.LG2025

On a few pitfalls in KL divergence gradient estimation for RL

Yunhao Tang, Rémi Munos

We point out a few pitfalls in implementing gradient estimation for KL divergence in RL training for LLM, as seen in a number of open source projects and papers. The first major pi…

cs.LG2025

Asymmetric REINFORCE for off-Policy Reinforcement Learning: Balancing positive and negative rewards

Charles Arnal, Gaëtan Narozniak, Vivien Cabannes +3

Reinforcement learning (RL) is increasingly used to align large language models (LLMs). Off-policy methods offer greater implementation simplicity and data efficiency than on-polic…

cs.LG2025

RL-finetuning LLMs from on- and off-policy data with a single algorithm

Yunhao Tang, Taco Cohen, David W. Zhang +2

We introduce a novel reinforcement learning algorithm (AGRO, for Any-Generation Reward Optimization) for fine-tuning large-language models. AGRO leverages the concept of generation…

cs.LG2025

Temporal Difference Flows

Jesse Farebrother, Matteo Pirotta, Andrea Tirinzoni +3

Predictive models of the future are fundamental for an agent's ability to reason and plan. A common strategy learns a world model and unrolls it step-by-step at inference, where sm…

cs.LG2025

Soft Policy Optimization: Online Off-Policy RL for Sequence Models

Taco Cohen, David W. Zhang, Kunhao Zheng +3

RL-based post-training of language models is almost exclusively done using on-policy methods such as PPO. These methods cannot learn from arbitrary sequences such as those produced…

cs.LG2025

Beyond Verifiable Rewards: Scaling Reinforcement Learning for Language Models to Unverifiable Data

Yunhao Tang, Sid Wang, Lovish Madaan +1

We propose to scale RL to unverifiable data with a novel algorithm JEPO (Jensen's Evidence lower bound Policy Optimization). While most prior efforts on scaling RL for LLMs focus o…

cs.LG2025

Optimizing Language Models for Inference Time Objectives using Reinforcement Learning

Yunhao Tang, Kunhao Zheng, Gabriel Synnaeve +1

In this work, we investigate the merits of explicitly optimizing for inference time algorithmic performance during model training. We show how optimizing for inference time perform…

cs.LG2025

Optimizing Return Distributions with Distributional Dynamic Programming

Bernardo Ávila Pires, Mark Rowland, Diana Borsa +6

We introduce distributional dynamic programming (DP) methods for optimizing statistical functionals of the return distribution, with standard reinforcement learning as a special ca…