Cited by 686Reinforcement Learning in RoboticsNatural Language Processing TechniquesTopic Modeling

Direct Preference Optimization: Your Language Model is Secretly a Reward Model

Rafailov, Rafael, Sharma, Archit, Mitchell, Eric, Manning, Christopher D, Ermon, Stefano, Finn, Chelsea·2023·Advances in Neural Information Processing Systems 36

Integrity signals

Registry

Crossref · 10.52202/075280-2338

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Capability internalization is achieved by learning from reasoning traces, through supervised fine-tuning or preference-guided optimization methods such as DPO and GRPO.

    “Technically, capability internalization is achieved by learning from reasoning traces, through supervised fine-tuning (Wei et al., 2022; Zelikman et al., 2022; Schick et al., 2023; Mukherjee et al., 2023) or preference-guided optimization methods such as DPO (Rafailov et al., 2023; Tunstall et al., 2023; Yuan et al., 2024c; Grattafiori et al., 2024) and GRPO (Shao et al., 2024; DeepSeek-AI et al.,”

    From Memory in the Age of AI Agents (2025) · cites this paper as Rafailov et al., 2023

  • RL is a complex and often unstable procedure.

    “However, RL is a complex and often unstable procedure (Mnih et al., 2015; Rafailov et al., 2023)”

    From ReVISE: Learning to Refine at Test-Time via Intrinsic Self-Verification (2025) · cites this paper as Rafailov et al., 2023

  • Preference optimization allows structured preference learning without relying on reinforcement learning.

    “This allows us to perform structured preference learning without relying on reinforcement learning (RL), which can be computationally extensive and unstable (Rafailov et al., 2023).”

    From ReVISE: Learning to Refine at Test-Time via Intrinsic Self-Verification (2025) · cites this paper as Rafailov et al., 2023

  • GIER offers a lightweight alternative that aligns model reasoning through prompts rather than fine-tuning or reward signals.

    “Our approach also complements alignment methods like RLHF (Ouyang et al., 2022) and preference modeling (Rafailov et al., 2023), offering a lightweight alternative that aligns model reasoning through prompts rather than fine-tuning or reward signals.”

    From GIER: Gap-Driven Self-Refinement for Large Language Models (2025) · cites this paper as Rafailov et al., 2023

  • Current state-of-the-art LLMs are aligned with honesty and helpfulness via training processes including reinforcement learning with human feedback (RLHF).

    “Current state-of-the-art LLMs are aligned with these principles via training processes8,10,13, including reinforcement learning with human feedback14 (RLHF).”

Cited by

Sorted by citations

Authors
Rafailov, R., Sharma, A., Mitchell, E., Manning, C. D., Ermon, S., & Finn, C.
Venue
Advances in Neural Information Processing Systems 36
Published
2023
Pages
53728-53741
ISSN
1049-5258 (ISSN-L)
OpenAlex
W7133208539
Cited by
686
References
0
Citations by year
2026: 486 · 2025: 127 · 2024: 72 · 2023: 1
FWCI
121.54
Type
conference paper
Language
en
Open access
closed
Locations
neural information processing systems (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
Keywords
preference optimization, reward modeling, language models, reward models, preference data, reinforcement learning from human feedback

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review