DeepSeek-R1 is an open-source language model constructed on DeepSeek-V3-Base that's been making waves in the AI neighborhood. Not just does it match-or even surpass-OpenAI's o1 model in many criteria, but it also includes completely MIT-licensed weights. This marks it as the first non-OpenAI/Google design to provide strong reasoning abilities in an open and available way.
What makes DeepSeek-R1 particularly exciting is its openness. Unlike the less-open methods from some market leaders, DeepSeek has published a detailed training method in their paper.
The model is also extremely cost-effective, 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 common knowledge was that much better designs needed more data and calculate. While that's still valid, models like o1 and R1 demonstrate an option: inference-time scaling through reasoning.
The Essentials
The DeepSeek-R1 paper provided several designs, but main amongst them were R1 and R1-Zero. Following these are a series of distilled designs that, while intriguing, I will not go over here.
DeepSeek-R1 uses two significant concepts:
1. A multi-stage pipeline where a small set of cold-start data kickstarts the model, followed by massive RL.
2. Group Relative Policy Optimization (GRPO), a reinforcement knowing approach that relies on comparing numerous model outputs per prompt to prevent the need for a different critic.
R1 and R1-Zero are both thinking designs. This essentially means they do Chain-of-Thought before addressing. For the R1 series of models, this takes type as thinking within a tag, before answering with a last summary.
R1-Zero vs R1
R1-Zero uses Reinforcement Learning (RL) straight to DeepSeek-V3-Base with no supervised fine-tuning (SFT). RL is used to optimize the model's policy to take full advantage of reward.
R1-Zero attains exceptional accuracy but often produces complicated outputs, such as mixing multiple languages in a single action. R1 repairs that by integrating minimal supervised fine-tuning and several RL passes, which enhances both accuracy and readability.
It is fascinating how some languages may express certain ideas much better, which leads the model to choose the most meaningful language for the task.
Training Pipeline
The training pipeline that DeepSeek released in the R1 paper is tremendously fascinating. It showcases how they created such strong thinking models, and what you can anticipate from each stage. This consists of the problems that the resulting models from each stage have, and how they fixed it in the next phase.
It's interesting that their training pipeline differs from the usual:
The typical training technique: Pretraining on big dataset (train to forecast next word) to get the base model → monitored fine-tuning → choice tuning by means of RLHF
R1-Zero: Pretrained → RL
R1: Pretrained → Multistage training pipeline with several SFT and RL phases
Cold-Start Fine-Tuning: Fine-tune DeepSeek-V3-Base on a couple of thousand Chain-of-Thought (CoT) samples to ensure the RL process has a good beginning point. This provides a great design to start RL.
First RL Stage: Apply GRPO with rule-based rewards to enhance reasoning correctness 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 action. The result of this step is a strong reasoning model however with weak basic abilities, e.g., poor format and language blending.
Rejection Sampling + basic information: Create new SFT information through rejection tasting on the RL checkpoint (from action 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 jobs) for wider capabilities. This step led to a strong thinking model with general capabilities.
Second RL Stage: Add more benefit signals (helpfulness, harmlessness) to fine-tune the last design, in addition to the thinking benefits. The outcome is DeepSeek-R1.
They likewise did model distillation for a number of Qwen and Llama designs on the thinking traces to get distilled-R1 models.
Model distillation is a method where you use an instructor model to enhance a trainee design by generating training data for the trainee model.
The teacher is normally a larger design than the trainee.
Group Relative Policy Optimization (GRPO)
The standard concept behind using support knowing for LLMs is to tweak the model's policy so that it naturally produces more accurate and useful responses.
They used a reward system that inspects not only for correctness however also for appropriate formatting and language consistency, so the model slowly finds out to favor reactions that meet these quality criteria.
In this paper, they motivate the R1 model to create chain-of-thought thinking through RL training with GRPO.
Instead of including a different module at reasoning time, the training process itself nudges the design to produce detailed, detailed outputs-making the chain-of-thought an emerging behavior of the enhanced policy.
What makes their approach especially intriguing is its reliance on straightforward, rule-based benefit functions.
Instead of depending on pricey external models or human-graded examples as in conventional RLHF, the RL utilized for R1 uses easy criteria: it may give a greater benefit if the answer is proper, if it follows the expected/ formatting, and setiathome.berkeley.edu if the language of the answer matches that of the timely.
Not depending on a reward design also indicates you don't have to invest time 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 prompt, the design creates various responses.
2. Each action receives a scalar reward based upon elements like accuracy, formatting, and language consistency.
3. Rewards are adjusted relative to the group's efficiency, essentially determining just how much better each response is compared to the others.
4. The model updates its technique somewhat to prefer responses with greater relative benefits. It only makes minor adjustments-using methods like clipping and a KL penalty-to ensure the policy does not stray too far from its initial habits.
A cool aspect of GRPO is its versatility. You can utilize simple rule-based benefit functions-for circumstances, awarding a benefit when the model properly uses the syntax-to guide the training.
While DeepSeek utilized GRPO, you might utilize alternative methods rather (PPO or PRIME).
For those aiming to dive deeper, Will Brown has actually composed rather a nice execution of training an LLM with RL utilizing GRPO. GRPO has actually likewise currently been contributed to the Transformer Reinforcement Learning (TRL) library, which is another good resource.
Finally, Yannic Kilcher has a terrific video explaining GRPO by going through the DeepSeekMath paper.
Is RL on LLMs the path to AGI?
As a final note on explaining DeepSeek-R1 and the methods they have actually presented in their paper, I wish to highlight a passage from the DeepSeekMath paper, based upon a point Yannic Kilcher made in his video.
These findings suggest that RL improves the model's general efficiency by rendering the output circulation more robust, simply put, setiathome.berkeley.edu it appears that the enhancement is credited to boosting the appropriate reaction from TopK rather than the improvement of fundamental abilities.
To put it simply, RL fine-tuning tends to form the output circulation so that the highest-probability outputs are more likely to be appropriate, even though the overall capability (as determined by the diversity of proper responses) is mainly present in the pretrained model.
This recommends that support learning on LLMs is more about refining and "forming" the existing distribution of reactions instead of endowing the model with totally brand-new capabilities.
Consequently, while RL techniques such as PPO and GRPO can produce considerable performance gains, there appears to be an intrinsic ceiling figured out by the underlying model's pretrained understanding.
It is uncertain to me how far RL will take us. Perhaps it will be the stepping stone to the next big milestone. I'm delighted to see how it unfolds!
Running DeepSeek-R1
I've utilized DeepSeek-R1 via the main chat user interface for different problems, which it appears to fix well enough. The additional search functionality makes it even better to utilize.
Interestingly, o3-mini(-high) was released as I was composing this post. From my initial testing, R1 seems stronger at math than o3-mini.
I also leased a single H100 via 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 deployed on a single H100 GPU-not to thoroughly evaluate the model's capabilities.
671B via 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 working on the GPU), running through llama.cpp:
29 layers appeared to be the sweet spot given this configuration.
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 video gaming setup.
Digital Spaceport composed 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 bearable for any severe work, but it's fun to run these large designs on available hardware.
What matters most to me is a combination of usefulness and time-to-usefulness in these models. Since reasoning designs require to think before addressing, their time-to-usefulness is generally higher than other designs, but their effectiveness is also usually greater.
We require to both make the most of effectiveness and decrease 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 expected when compared to the mainly CPU-powered run of 671B that I showcased above.
Resources
DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learning
[2402.03300] DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models
DeepSeek R1 - Notion (Building a fully local "deep researcher" with DeepSeek-R1 - YouTube).
DeepSeek R1's dish to duplicate o1 and the future of thinking LMs.
The Illustrated DeepSeek-R1 - by Jay Alammar.
Explainer: What's R1 & Everything Else? - Tim Kellogg.
DeepSeek R1 Explained to your grandmother - 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 framework that combines multimodal understanding and generation. It can both understand and generate images.
DeepSeek-R1: Incentivizing Reasoning Capability in Large Language Models by means of Reinforcement Learning (January 2025) This paper presents DeepSeek-R1, an open-source reasoning design that matches the performance of OpenAI's o1. It presents a detailed method for training such models utilizing large-scale reinforcement knowing strategies.
DeepSeek-V3 Technical Report (December 2024) This report talks about the implementation of an FP8 mixed accuracy training framework verified on an exceptionally massive model, attaining both sped up training and reduced GPU memory use.
DeepSeek LLM: Scaling Open-Source Language Models with Longtermism (January 2024) This paper explores scaling laws and provides findings that assist in the scaling of massive models in open-source setups. It introduces the DeepSeek LLM task, devoted 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 study introduces the DeepSeek-Coder series, a variety of open-source code designs trained from scratch on 2 trillion tokens. The designs are pre-trained on a high-quality project-level code corpus and chessdatabase.science use a fill-in-the-blank job to enhance code generation and infilling.
DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Model (May 2024) This paper presents DeepSeek-V2, a Mixture-of-Experts (MoE) language design characterized by affordable training and effective reasoning.
DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence (June 2024) This research introduces DeepSeek-Coder-V2, an open-source Mixture-of-Experts (MoE) code language design that attains similar to GPT-4 Turbo in code-specific jobs.
Interesting occasions
- Hong Kong University reproduces 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 researcher verifies the DeepSeek group separately found and utilized some core concepts the OpenAI team utilized en route to o1
Liked this post? Join the newsletter.