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

A zero-data self-evolution framework that co-trains a Challenger, Solver, and Judge so LLMs can iteratively improve on both verifiable and unverifiable tasks without human labels. Uses role-asymmetry and subtask-amplification preference pairs to train the Judge and sustain improvement.

Trains compact conversational agents to adapt at runtime to changing 'Harness' configurations (Skills, Hooks, prompts, tools) using Harness-Aware Training (HAT): Harness-State Augmentation, on-policy distillation, and RL to preserve generality while meeting low-latency deployment constraints.

Analyzes how to generate useful interaction data for LLM agents and proposes the ACE lens — Accuracy, Complexity, divErsity — while factorizing agentic data as (E, q, τ, v). Surveys verification, difficulty calibration, and coverage strategies and outlines implications for training and benchmarks.