DeepSeek-R1 is an open-source language design built on DeepSeek-V3-Base that's been making waves in the AI community. Not just does it match-or even surpass-OpenAI's o1 design in numerous standards, however it also includes totally MIT-licensed weights. This marks it as the first non-OpenAI/Google model to deliver strong thinking abilities in an open and available manner.

What makes DeepSeek-R1 particularly amazing is its openness. Unlike the less-open approaches from some market leaders, DeepSeek has actually published a detailed training methodology in their paper.
The design is also extremely affordable, with input tokens costing simply $0.14-0.55 per million (vs o1's $15) and output tokens at $2.19 per million (vs o1's $60).

Until ~ GPT-4, the typical wisdom was that much better models required more data and calculate. While that's still legitimate, models like o1 and R1 show an alternative: inference-time scaling through thinking.

The Essentials

The DeepSeek-R1 paper presented multiple models, however main amongst them were R1 and R1-Zero. Following these are a series of distilled models that, while interesting, I won't go over here.

DeepSeek-R1 utilizes two significant ideas:

1. A multi-stage pipeline where a small set of cold-start data kickstarts the model, followed by large-scale RL.
2. Group Relative Policy Optimization (GRPO), a reinforcement learning approach that relies on comparing several model outputs per timely to prevent the need for a separate critic.

R1 and R1-Zero are both thinking models. This basically means they do Chain-of-Thought before responding to. For the R1 series of models, this takes type as believing within a tag, before addressing with a final summary.

R1-Zero vs R1

R1-Zero applies Reinforcement Learning (RL) straight to DeepSeek-V3-Base with no supervised fine-tuning (SFT). RL is utilized to enhance the design's policy to optimize reward.
R1-Zero attains excellent precision but often produces confusing outputs, such as mixing numerous languages in a single action. R1 repairs that by incorporating minimal monitored fine-tuning and multiple RL passes, which improves both correctness and readability.

It is intriguing how some languages may express certain ideas much better, which leads the design to select the most expressive language for the job.

Training Pipeline

The training pipeline that DeepSeek released in the R1 paper is exceptionally fascinating. It showcases how they developed such strong reasoning designs, and what you can expect from each stage. This consists of the issues that the resulting models from each phase have, and how they resolved it in the next phase.

It's fascinating that their training pipeline varies from the usual:

The usual training method: Pretraining on big dataset (train to predict next word) to get the base design → supervised fine-tuning → choice tuning by means of RLHF
R1-Zero: Pretrained → RL
R1: Pretrained → Multistage training pipeline with multiple SFT and RL phases

Cold-Start Fine-Tuning: Fine-tune DeepSeek-V3-Base on a couple of thousand Chain-of-Thought (CoT) samples to guarantee the RL process has a good starting point. This provides a good design to start RL.
First RL Stage: Apply GRPO with rule-based benefits to improve reasoning accuracy and formatting (such as requiring chain-of-thought into believing tags). When they were near merging in the RL procedure, they moved to the next step. The outcome of this step is a strong reasoning model however with weak general abilities, e.g., bad format and language blending.
Rejection Sampling + general data: Create new SFT data through rejection sampling on the RL checkpoint (from step 2), integrated with monitored information from the DeepSeek-V3-Base design. They collected around 600k premium reasoning samples.
Second Fine-Tuning: Fine-tune DeepSeek-V3-Base again on 800k overall samples (600k thinking + 200k general tasks) for wider abilities. This action led to a strong reasoning design with basic capabilities.
Second RL Stage: Add more reward signals (helpfulness, harmlessness) to refine the last design, in addition to the reasoning rewards. The result is DeepSeek-R1.
They also did model distillation for several Qwen and Llama designs on the reasoning traces to get distilled-R1 models.

Model distillation is a technique where you utilize an instructor design to enhance a trainee model by creating training data for the trainee model.
The teacher is normally a larger model than the trainee.

Group Relative Policy Optimization (GRPO)

The fundamental concept behind utilizing support knowing for LLMs is to fine-tune the model's policy so that it naturally produces more accurate and helpful responses.
They used a benefit system that examines not just for correctness however likewise for oke.zone appropriate formatting and language consistency, so the model slowly learns to favor actions that meet these quality criteria.

In this paper, they encourage the R1 model to produce chain-of-thought reasoning through RL training with GRPO.
Instead of adding a separate module at reasoning time, the training procedure itself nudges the model to produce detailed, detailed outputs-making the chain-of-thought an emergent behavior of the optimized policy.

What makes their technique especially interesting is its dependence on straightforward, rule-based benefit functions.
Instead of depending upon pricey external designs or human-graded examples as in conventional RLHF, the RL used for R1 uses easy requirements: it might give a higher reward if the response is right, if it follows the anticipated/ formatting, and if the language of the response matches that of the prompt.
Not counting on a benefit design likewise suggests you do not need to hang around and effort training it, and it does not take memory and compute far from your main model.

GRPO was presented in the DeepSeekMath paper. Here's how GRPO works:

1. For each input timely, the design produces various reactions.
2. Each reaction gets a scalar reward based on factors like precision, formatting, and language consistency.
3. Rewards are adjusted relative to the group's performance, essentially determining just how much better each action is compared to the others.
4. The model updates its method somewhat to prefer reactions with higher relative advantages. It just makes slight adjustments-using methods like clipping and wiki.vifm.info a KL penalty-to guarantee the policy does not wander off too far from its initial habits.

A cool aspect of GRPO is its flexibility. You can use easy rule-based benefit functions-for instance, awarding a reward when the model properly uses the syntax-to guide the training.

While DeepSeek used GRPO, you might utilize alternative approaches rather (PPO or PRIME).

For those aiming to dive deeper, Will Brown has actually written rather a good implementation of training an LLM with RL using GRPO. GRPO has likewise already been contributed to the Transformer Reinforcement Learning (TRL) library, which is another great resource.
Finally, Yannic Kilcher has a great video explaining GRPO by going through the DeepSeekMath paper.

Is RL on LLMs the path to AGI?

As a last note on explaining DeepSeek-R1 and the methods they have actually presented in their paper, I want to highlight a passage from the DeepSeekMath paper, based upon a point Yannic Kilcher made in his video.

These findings indicate that RL enhances the design's overall efficiency by rendering the output circulation more robust, simply put, it seems that the improvement is credited to boosting the right response from TopK rather than the enhancement of essential capabilities.

Simply put, RL fine-tuning tends to shape the output circulation so that the highest-probability outputs are most likely to be right, even though the general capability (as measured by the diversity of proper answers) is mainly present in the pretrained design.

This suggests that support learning on LLMs is more about refining and "shaping" the existing circulation of reactions instead of enhancing the design with completely new capabilities.
Consequently, while RL techniques such as PPO and GRPO can produce substantial efficiency gains, there seems an intrinsic ceiling figured out by the underlying design's pretrained understanding.

It is uncertain to me how far RL will take us. Perhaps it will be the stepping stone to the next huge turning point. I'm thrilled to see how it unfolds!

Running DeepSeek-R1

I've utilized DeepSeek-R1 by means of the main chat interface for various issues, which it appears to resolve well enough. The additional search functionality makes it even better to use.

Interestingly, o3-mini(-high) was launched as I was composing this post. From my initial testing, R1 appears stronger at mathematics than o3-mini.

I likewise leased a single H100 through Lambda Labs for $2/h (26 CPU cores, 214.7 GB RAM, 1.1 TB SSD) to run some experiments.
The main objective was to see how the design would carry out when released on a single H100 GPU-not to extensively test the model's abilities.

671B by means of Llama.cpp

DeepSeek-R1 1.58-bit (UD-IQ1_S) quantized design by Unsloth, with a 4-bit quantized KV-cache and partial GPU offloading (29 layers running on the GPU), running via llama.cpp:

29 layers seemed to be the sweet spot provided this setup.

Performance:

A r/localllama user explained that they were able to overcome 2 tok/sec with DeepSeek R1 671B, without utilizing their GPU on their regional gaming setup.
Digital Spaceport wrote a complete guide on how to run Deepseek R1 671b completely locally on a $2000 EPYC server, on which you can get ~ 4.25 to 3.5 tokens per second.

As you can see, the tokens/s isn't rather manageable for any major work, but it's fun to run these large models on available hardware.

What matters most to me is a mix of usefulness and time-to-usefulness in these models. Since reasoning models need to think before responding to, their time-to-usefulness is generally higher than other models, but their usefulness is also generally greater.
We need to both optimize usefulness and minimize time-to-usefulness.

70B by means of Ollama

70.6 b params, 4-bit KM quantized DeepSeek-R1 running via Ollama:

GPU utilization shoots up here, as anticipated when compared to the mainly CPU-powered run of 671B that I showcased above.

Resources

DeepSeek-R1: Incentivizing Reasoning Capability in LLMs through Reinforcement Learning
[2402.03300] DeepSeekMath: addsub.wiki Pushing the Limits of Mathematical Reasoning in Open Language Models
DeepSeek R1 - Notion (Building a totally regional "deep scientist" with DeepSeek-R1 - YouTube).
DeepSeek R1's recipe to reproduce o1 and the future of reasoning LMs.
The Illustrated DeepSeek-R1 - by Jay Alammar.
Explainer: What's R1 & Everything Else? - Tim Kellogg.
DeepSeek R1 Explained to your granny - YouTube

DeepSeek

- Try R1 at chat.deepseek.com.
GitHub - deepseek-ai/DeepSeek-R 1.
deepseek-ai/Janus-Pro -7 B · Hugging Face (January 2025): Janus-Pro is a novel autoregressive structure that combines multimodal understanding and generation. It can both understand and generate images.
DeepSeek-R1: Incentivizing Reasoning Capability in Large Language Models via Reinforcement Learning (January 2025) This paper presents DeepSeek-R1, an open-source reasoning model that equals the performance of OpenAI's o1. It provides a detailed method for training such models utilizing large-scale support knowing techniques.
DeepSeek-V3 Technical Report (December 2024) This report goes over the implementation of an FP8 combined precision training framework confirmed on a very large-scale model, attaining both sped up training and reduced GPU memory use.
DeepSeek LLM: Scaling Open-Source Language Models with Longtermism (January 2024) This paper delves into scaling laws and swwwwiki.coresv.net presents findings that help with the scaling of large-scale models in open-source configurations. It presents the DeepSeek LLM task, dedicated to advancing open-source language models with a long-lasting perspective.
DeepSeek-Coder: When the Large Language Model Meets Programming-The Rise of Code Intelligence (January 2024) This research introduces the DeepSeek-Coder series, a variety of open-source code models trained from scratch on 2 trillion tokens. The models are pre-trained on a high-quality project-level code corpus and employ a fill-in-the-blank task to boost code generation and infilling.
DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model (May 2024) This paper provides DeepSeek-V2, a Mixture-of-Experts (MoE) language design defined by economical training and efficient reasoning.
DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence (June 2024) This research study presents DeepSeek-Coder-V2, an open-source Mixture-of-Experts (MoE) code language design that attains performance comparable to GPT-4 Turbo in code-specific tasks.

Interesting events

- Hong Kong University replicates R1 results (Jan 25, '25).
- Huggingface reveals huggingface/open-r 1: Fully open recreation of DeepSeek-R1 to duplicate R1, completely open source (Jan 25, '25).
- OpenAI scientist validates the DeepSeek group individually found and utilized some core concepts the OpenAI team used on the method to o1

Liked this post? Join the newsletter.