First model to learn control policies straight from raw Atari pixels, pairing a convolutional net with Q-learning and experience replay. One unchanged architecture played seven games, beating prior methods on six and a human expert on three.
Combines a policy network (to narrow move choices) and a value network (to score board positions) with Monte Carlo tree search, cutting Go's vast search space enough to beat top programs 99.8% of the time and the European champion 5-0.
Made reinforcement learning from human feedback (RLHF) the standard alignment recipe: collect demonstrations and preference rankings, train a reward model, then optimize with PPO. A 1.3B aligned model was preferred over the 175B GPT-3 by human raters.
An open large language model pairing DeepSeek Sparse Attention (DSA) for cheaper long-context inference with a scaled RL pipeline. Authors claim parity with GPT-5, with a high-compute Speciale variant surpassing it and rivaling Gemini-3.0-Pro on reasoning.
Combines internalizing general skills with task-specific skill utilization via a difficulty-aware router to improve in-distribution and out-of-distribution performance for agentic RL. Uses privileged distillation for hard tasks and diagnostic probing for easy tasks; evaluated on ALFWorld and WebShop.
Uses search-agent reading traces and tiered distractors to train LLMs for long-context, multi-hop reasoning, and introduces a rubric reward that supervises entity-level steps (applied only to correct finals). Improves evidence-grounded reasoning and resists reward hacking across 4B–30B models.
Analyzes how single-domain RL fine-tuning on LLMs induces cross-domain interference and shows this damage concentrates in a low-dimensional shared conflict subspace; proposes a local perturbation theory and short domain "refresh" procedures that selectively recover earlier domains with minimal collateral loss.
A 20B retrieval subagent trained with reinforcement learning inside a stateful search harness that externalizes recoverable search state (candidate pool, curated evidence, verification records). The harness lets the policy focus on semantic search decisions, improving curated recall and transfer robustness.
Trains LLMs with reinforcement learning using a surface chrF reward so models learn to extract and apply linguistic signals from rich context for translating completely unseen languages. Demonstrates better zero-shot translation than in-context learning or supervised fine-tuning, framing outcome-based RL as a meta-skill for language learning from context.
Analyzes the parameter-space geometry of on-policy distillation (OPD) for LLM training, showing OPD updates affect fewer weights, avoid principal directions, and rapidly lock into a low-dimensional update subspace. Compares OPD with supervised fine-tuning (SFT) and reinforcement learning with verifiable rewards (RLVR) and studies implications for optimization and objective mixing.
Shifts branching and credit assignment in agentic RL from coarse units to fine-grained decision points in generated sequences. Uses a Branching Score combining token uncertainty and policy-induced likelihood gains plus procedure-level advantage scaling; improves performance across 13 benchmarks while keeping efficient tool calls.
Applies a population-level test-time scaling strategy that uses one model as generator, verifier, refiner, and ranker to search over candidate proofs. Combines generative-verifier RL and a low false-positive verifier with tournament selection to reach competition-level performance on IMO and USAMO.