RL Science
Why policy optimization, sampling, and learning from feedback work — and how to spend rollout compute where it yields the most signal.
Reinforcement Learning for Reasoning & Agents
Senior Researcher · Microsoft Research
Every learning signal in RL has to be sampled. I design the objectives and samplers that make it cheaper and more stable, from reasoning to long-horizon agents.
I’m a researcher working on reinforcement learning for reasoning and agents. I did my PhD in mathematics, advised by Tong Zhang, and came to RL from Monte Carlo sampling. I still see RL for language models through that lens: the learning signal is something you sample, and much of the cost and instability comes from sampling it badly. I study the signal along three axes:
My method is to take an algorithm apart into the terms of its objective and the sampler that generates its data, work out what each contributes in theory and in practice, and design better algorithms from there. On the interface, I co-led RAFT (reward-ranked fine-tuning) and the online iterative RLHF workflow, both open-sourced in RLHFlow. On scalability, Reinforce-Ada turns a non-linear objective into an adaptive sampler, and GVM allocates samples to cut gradient variance. On stability, our minimalist study of GRPO traced its main edge to discarding all-wrong prompts, not reward normalization, and proposed a simpler variant with better KL efficiency. I also co-led LMFlow (NAACL 2024 Best Demo), a toolkit for fine-tuning and inference.
Now I’m applying this to long-horizon agents, where rollouts are slow and rewards arrive late. In multi-turn distillation, we bounded the error of replaying teacher prefixes by two terms — how far the prefixes drift from the student’s own states, and how unreliable the teacher is on them — both set by the prefix sampler. A sampler that favors early steps balances the two, preserving the accuracy of online distillation with zero tool calls during student training. Next I’m exploring environment simulation and trajectory branching, where the environment and the branch points become part of the sampler too.
Outside research, I serve as managing editor of JMLR and was publication chair of ICML 2026.
Why policy optimization, sampling, and learning from feedback work — and how to spend rollout compute where it yields the most signal.
Giving long-horizon agents more and better learning signal: designing the samplers that choose which histories to learn from, and exploring environment simulation, trajectory branching, and credit assignment for sparse, delayed outcomes.
Algorithms, training recipes, and open-source tools that put this research into practice.
Uniform sampling with small groups loses the learning signal on hard prompts. Reinforce-Ada adaptively spends extra rollouts on them, guided by a non-linear RL objective, and converges up to 2× faster than uniform baselines like GRPO at the same inference budget.
Shows a “prefix trap” in multi-turn on-policy distillation (OPD): the prefix sampler trades relevance to the student against teacher reliability. A step-decaying sampler over replayed, pre-collected teacher prefixes matches or improves online OPD accuracy, with zero tool calls during student training and at least 4× faster per rollout.
Allocates the sampling budget across prompts to minimize stochastic-gradient variance: a 2–4× speedup over vanilla RAFT on math reasoning, with similar gains when plugged into GRPO.
Takes GRPO apart: plain rejection-sampling fine-tuning (RAFT) is surprisingly competitive, and GRPO’s main edge comes from discarding prompts whose responses are all wrong, not from reward normalization.
An open, reproducible recipe for online iterative RLHF: preference and reward models stand in for human feedback, and iterative DPO trains the policy — building on our ICML 2024 analysis of KL-regularized RLHF.
Sample, rank by reward, fine-tune on the best: a simple, stable alternative to PPO, and an early form of what is now called rejection-sampling fine-tuning or iterative best-of-n.
Most of my research ships as code, recipes, or models that others can build on.
Open recipes for RLHF and RL for reasoning: reward modeling, online iterative RLHF, RAFT, Minimal-RL, and Reinforce-Ada.
An extensible toolkit for fine-tuning and inference of large foundation models, from supervised fine-tuning to RLHF; 8k+ GitHub stars.
Machine-checked foundations for LLM RL: formalizing the theory of policy-gradient estimators — REINFORCE, GRPO, RAFT, rejection sampling — in Lean 4, with a companion effort for sampling algorithms and diffusion models.
Notes and essays on reinforcement learning, agents, and AI systems — starting with how to curate the learning signal for LLM RL.
* denotes equal contribution. † denotes corresponding author. Name denotes mentored student/intern.
Full publication list can be found in Google Scholar.
Show More
I’m always happy to talk about RL for reasoning and agents, learning signals, and post-training systems, and I’m open to research collaborations.
For work-related inquiries, please contact X at Y dot com
X = hanzedong
Y = microsoft
For JMLR-related inquiries, please contact Z at jmlr.org
Z = hanze.dong