GO TO A SECTION

↑ ↓ to navigate · Enter to openExplore all sections →
FDEInterviews logo
arXiv preprint

DAPO: An Open-Source LLM Reinforcement Learning System at Scale

Understand DAPO's clipping, dynamic sampling, token-level loss and length rewards, with tested arithmetic and practical controls for reasoning-model training.

Breakdown by FDE Interviews · 10 min read · Updated

About the original · 2025
AUTHORS
Yu, Zhang, Zhu, Yuan, et al.
FROM
ByteDance Seed, Tsinghua AIR, University of Hong Kong, SIA-Lab
PUBLISHED
Mar 2025 · arXiv preprint
IN THIS BREAKDOWN · 10 SECTIONS

You can read 17% of this breakdown.

01

The paper in one minute

DAPO is an open training recipe for reinforcement learning with verifiable outcomes. Its starting point is a practical frustration: implementing the headline GRPO equation does not necessarily reproduce the reasoning performance associated with that method. Rollout selection, clipping, sequence length and reward handling can materially change the experiment.

The paper combines four techniques. Clip-Higher allows a larger upper clipping range. Dynamic Sampling keeps groups with mixed outcomes. Token-level loss reduction changes how long and short responses contribute. Overlong Reward Shaping avoids treating every truncated trace as an ordinary incorrect answer and introduces a gradual length penalty.

Using Qwen2.5-32B, the authors report 50 points on AIME 2024, compared with 30 for their naive GRPO baseline. These are repeated-evaluation averages, not a best-of-many answer-selection score. The result supports this particular recipe on mathematical tasks; it does not establish the same improvement for customer-service agents or open-ended enterprise work.

The enduring lesson is that the training system defines the effective objective. If some prompts contribute no learning signal, or a long answer's tokens receive much less weight than a short answer's, an apparently faithful implementation can behave differently. The authors' project links the released code and data needed to inspect those choices.

THE IDEA, VISUALLY
A LITTLE MORE ROOM TO INCREASE A REWARDED ACTION Positive advantage = 1. The clipped surrogate flattens at its upper ratio threshold. 0.8 1.0 1.2 1.4 0.8 1.0 1.2 1.4 Surrogate objective New probability / old probability Clip-Higher: 1.28 Symmetric: 1.20 Negative advantages use a different branch of the minimum. These are not hard probability constraints.
Our plot of the clipped surrogate for positive advantage one, using the clipping settings in section 4.1. It illustrates objective arithmetic, not an accuracy curve or a hard constraint on probability changes.
Research notes: the problem, approach and results
50

AIME24 avg@32, Table 1

30

naive GRPO baseline, same table

0.28

upper clipping epsilon, section 4.1

THE PROBLEM

A nominal GRPO implementation can lose useful gradient signal, collapse exploration or mishandle truncated reasoning traces.

THE IDEA

Combine asymmetric clipping, mixed-outcome group sampling, token-level loss reduction and a soft length penalty.

THE RESULT

The Qwen2.5-32B experiment reaches 50 AIME24 points; the recipe and its accounting details matter as much as the algorithm name.

02

Why it matters to an FDE

Most FDEs will not train a reasoning model at this scale. They may still need to evaluate a fine-tuning proposal, reproduce a training failure or explain why a smaller adaptation experiment stalled. DAPO gives that discussion concrete observables: usable groups, clipping fractions, response lengths and held-out task accuracy.

A customer-specific verifier is the first dependency. If it accepts a malformed answer or rewards a shortcut, a better optimizer can reinforce the wrong behavior faster. The reward models concept helps distinguish the reward signal from the business outcome it is supposed to represent.

Treat training as an option after diagnosing a repeatable capability gap. Missing retrieval evidence, tool outages and incorrect permissions need different remedies. When training is justified, compare at a fixed evaluation protocol and account for rejected rollouts as well as optimizer updates. A step count alone does not tell the customer how much the experiment costs.

THE FULL BREAKDOWN

Understand the mechanism. Try it on a real problem.

Unlock this breakdown and 199 more papers.

Premium opens every paper in full, plus every answer, concept, course and guide on the site. One payment for six months of access.

6 months · One payment · No auto-renewal

Get Premium · ₹2,000 / $25
  • ◇1 architecture diagram
  • </>2 runnable code blocks
  • ▦3 results tables
  1. 03Key takeaways

    Six implementation decisions behind the reported result and the limits of each

    Free account
  2. 04How it works

    Follow the group filter, asymmetric surrogate and token-weighted update

    Premium
  3. 05The numbers that matter

    Read the progressive ablation and distinguish update counts from total compute

    Premium
  4. 06Try it yourself

    Execute clipping branches, unequal-length reductions and exact penalty boundaries

    Premium
  5. 07Where it breaks

    Recognize verifier errors, sampling stalls and objectives that reward the wrong behavior

    Premium
  6. 08Using it on a deployment

    Define adoption requirements and measure the full cost of informative training data

    Premium
  7. 09Interview angles

    Explain zero-gradient groups, loss denominators and a misleading efficiency comparison

    Premium
Back to the paper library →