AIAny

DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning

Shows that LLM reasoning can be incentivized through pure reinforcement learning, with no human-annotated reasoning traces. Self-reflection, verification, and strategy-switching emerge on their own, and the patterns transfer to distill smaller models.

Introduction

The conventional wisdom was that strong reasoning required teaching models to imitate human-written chains of thought. DeepSeek-R1 inverts that: it rewards only the final answer's correctness and lets the reasoning process organize itself. The model spontaneously learns to spend more tokens on hard problems, double-check its own steps, and abandon failing strategies mid-stream — behaviors nobody explicitly demonstrated to it.

Key Findings
  • Pure RL with verifiable rewards (math, code, STEM) is enough to elicit advanced reasoning, removing the human-annotation bottleneck that caps supervised approaches and bakes in human bias.
  • "Aha moment" dynamics emerge: response length grows with problem difficulty, and the model develops self-reflection and verification on its own rather than being told to.
  • The emergent reasoning patterns can be distilled into much smaller models, so a single large RL run pays off across a whole model family — you don't need to repeat the expensive training per size.
Who Should Read This

Great fit if you build or fine-tune reasoning systems and want a recipe that sidesteps costly human chain-of-thought labeling, or if you care about how reasoning behaviors arise rather than just benchmark numbers. Look elsewhere if you need a turnkey product — this is a research model and method, and pure-RL training is reward-hackable and unstable on tasks where correctness can't be cheaply verified.

Information

  • Websitearxiv.org
  • OrganizationsDeepSeek-AI
  • AuthorsDeepSeek-AI, Daya Guo, Dejian Yang, Haowei Zhang, Junxiao Song, Ruoyu Zhang, Runxin Xu, Qihao Zhu, Shirong Ma, Peiyi Wang …
  • Published date2025/01/22

More Items

Demonstrates that additive weighted aggregation in rubric-based reinforcement learning enables reward hacking—models improve rubric coverage but produce worse answers—and proposes ProRubric, an offline regrouping that aggregates checklist criteria into conjunctive protocol-level dimensions to raise appropriateness without losing coverage.

Improves token-level credit assignment for RL fine-tuning of language models by parameterizing the critic as cumulative, position-wise log-odds increments (Tracking-Value PPO), enabling more accurate value-evolution tracking under sparse terminal rewards and boosting math-reasoning and coding benchmarks.

Enables multi-head, depth-wise residual retrieval in Transformers by expanding a single residual stream into multiple context-aware streams using causal depthwise convolutions. Improves pretraining convergence and downstream benchmark scores with minimal overhead, yielding notable iso-loss compute speedups in large MoE models.