DeepSeek-R1 is an design developed 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 many benchmarks, but it likewise comes with totally MIT-licensed weights. This marks it as the very first non-OpenAI/Google model to provide strong thinking capabilities in an open and available way.
What makes DeepSeek-R1 especially exciting is its transparency. Unlike the less-open methods from some market leaders, DeepSeek has actually released a detailed training approach in their paper.
The design is likewise extremely affordable, with input tokens costing just $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 models required more data and calculate. While that's still valid, designs like o1 and R1 demonstrate an alternative: inference-time scaling through thinking.
The Essentials
The DeepSeek-R1 paper presented numerous models, but main among them were R1 and R1-Zero. Following these are a series of distilled models that, while interesting, I won't talk about here.
DeepSeek-R1 utilizes 2 major ideas:
1. A multi-stage pipeline where a small set of cold-start data kickstarts the design, followed by massive RL.
2. Group Relative Policy Optimization (GRPO), a support learning technique that relies on comparing several design outputs per prompt to prevent the requirement for a different critic.
R1 and R1-Zero are both reasoning designs. This essentially means they do Chain-of-Thought before answering. For the R1 series of designs, this takes form as thinking within a tag, before responding to with a last summary.
R1-Zero vs R1
R1-Zero applies Reinforcement Learning (RL) straight to DeepSeek-V3-Base without any supervised fine-tuning (SFT). RL is used to enhance the model's policy to take full advantage of benefit.
R1-Zero attains outstanding accuracy however often produces complicated outputs, such as mixing numerous languages in a single response. R1 repairs that by incorporating limited supervised fine-tuning and multiple RL passes, which improves both correctness and readability.
It is fascinating how some languages may express certain ideas better, which leads the model to choose the most meaningful language for the job.
Training Pipeline
The training pipeline that DeepSeek released in the R1 paper is immensely fascinating. It showcases how they developed such strong reasoning models, and what you can get out of each stage. This includes the issues that the resulting models from each stage have, and how they fixed it in the next phase.
It's fascinating that their training pipeline differs from the typical:
The typical training strategy: Pretraining on big dataset (train to predict next word) to get the base design → monitored fine-tuning → choice tuning via 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 few thousand Chain-of-Thought (CoT) samples to guarantee the RL process has a good starting point. This provides an excellent model to start RL.
First RL Stage: Apply GRPO with rule-based rewards to improve thinking accuracy and formatting (such as forcing chain-of-thought into thinking tags). When they were near merging in the RL process, they relocated to the next action. The outcome of this step is a strong thinking model but with weak basic abilities, e.g., poor format and language blending.
Rejection Sampling + general information: Create new SFT information through rejection sampling on the RL checkpoint (from action 2), integrated with monitored information from the DeepSeek-V3-Base model. They gathered around 600k premium reasoning samples.
Second Fine-Tuning: Fine-tune DeepSeek-V3-Base again on 800k overall samples (600k reasoning + 200k basic tasks) for wider abilities. This step resulted in a strong reasoning model with general abilities.
Second RL Stage: Add more reward signals (helpfulness, harmlessness) to fine-tune the final model, in addition to the reasoning benefits. The result is DeepSeek-R1.
They likewise did model distillation for numerous Qwen and Llama designs on the thinking traces to get distilled-R1 models.
Model distillation is a strategy where you utilize an instructor model to improve a trainee model by producing training information for the trainee design.
The instructor is generally a larger design than the trainee.
Group Relative Policy Optimization (GRPO)
The fundamental idea behind using reinforcement learning for LLMs is to fine-tune the model's policy so that it naturally produces more precise and helpful responses.
They used a benefit system that examines not only for correctness but likewise for correct format and language consistency, so the design gradually discovers to prefer actions that satisfy these quality requirements.
In this paper, they motivate the R1 model to create chain-of-thought thinking through RL training with GRPO.
Instead of adding a separate module at inference time, the training process itself nudges the model 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 upon expensive external models or human-graded examples as in standard RLHF, the RL used for R1 uses basic criteria: it might offer a higher benefit if the answer is right, if it follows the anticipated/ format, and if the language of the answer matches that of the prompt.
Not relying on a benefit design likewise implies you don't have to hang out and effort training it, and it doesn't take memory and compute away from your main model.
GRPO was presented in the DeepSeekMath paper. Here's how GRPO works:
1. For each input prompt, the model generates various actions.
2. Each action gets a scalar benefit based on aspects like precision, formatting, and language consistency.
3. Rewards are changed relative to the group's efficiency, library.kemu.ac.ke basically measuring just how much better each reaction is compared to the others.
4. The model updates its method a little to prefer reactions with higher relative advantages. It just makes minor adjustments-using techniques like clipping and macphersonwiki.mywikis.wiki a KL penalty-to guarantee the policy does not wander off too far from its original behavior.
A cool element of GRPO is its flexibility. You can utilize easy rule-based benefit functions-for circumstances, awarding a benefit when the model correctly uses the syntax-to guide the training.
While DeepSeek utilized GRPO, you could use alternative methods rather (PPO or PRIME).
For those aiming to dive deeper, Will Brown has composed quite a nice application of training an LLM with RL utilizing GRPO. GRPO has likewise already been added to the Transformer Reinforcement Learning (TRL) library, which is another good resource.
Finally, Yannic Kilcher has an excellent 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've presented in their paper, I want to highlight a passage from the DeepSeekMath paper, based on a point Yannic Kilcher made in his video.
These findings indicate that RL improves the design's total performance by rendering the output distribution more robust, to put it simply, it appears that the improvement is attributed to increasing the correct reaction from TopK instead of the improvement of basic capabilities.
Simply put, RL fine-tuning tends to form the output distribution so that the highest-probability outputs are more likely to be proper, despite the fact that the general capability (as measured by the variety 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 distribution of reactions instead of enhancing the model with totally brand-new abilities.
Consequently, while RL methods such as PPO and GRPO can produce substantial performance gains, there seems an inherent ceiling figured out by the underlying model's pretrained knowledge.
It is uncertain to me how far RL will take us. Perhaps it will be the stepping stone to the next big turning point. I'm thrilled to see how it unfolds!
Running DeepSeek-R1
I've utilized DeepSeek-R1 via the main chat user interface for various problems, which it appears to solve all right. The additional search performance makes it even better to use.
Interestingly, o3-mini(-high) was released as I was composing this post. From my initial testing, R1 seems stronger at mathematics than o3-mini.
I also rented a single H100 via Lambda Labs for $2/h (26 CPU cores, 214.7 GB RAM, systemcheck-wiki.de 1.1 TB SSD) to run some experiments.
The main objective was to see how the model would carry out when deployed on a single H100 GPU-not to extensively evaluate the design's abilities.
671B through Llama.cpp
DeepSeek-R1 1.58-bit (UD-IQ1_S) quantized model by Unsloth, with a 4-bit quantized KV-cache and partial GPU offloading (29 layers operating on the GPU), running via llama.cpp:
29 layers appeared 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 composed a complete guide on how to run Deepseek R1 671b totally locally on a $2000 EPYC server, botdb.win on which you can get ~ 4.25 to 3.5 tokens per second.
As you can see, the tokens/s isn't quite manageable for any major wiki.monnaie-libre.fr work, but it's fun to run these big models on available hardware.
What matters most to me is a combination of usefulness and time-to-usefulness in these designs. Since reasoning designs need to believe before addressing, their time-to-usefulness is typically greater than other models, but their usefulness is likewise typically greater.
We require to both take full advantage of usefulness 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 soars 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 by means of Reinforcement Learning
[2402.03300] DeepSeekMath: 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 duplicate 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 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 comprehend and create images.
DeepSeek-R1: Incentivizing Reasoning Capability in Large Language Models through Reinforcement Learning (January 2025) This paper presents DeepSeek-R1, an open-source thinking model that measures up to the performance of OpenAI's o1. It presents a detailed method for training such designs utilizing massive support learning techniques.
DeepSeek-V3 Technical Report (December 2024) This report talks about the implementation of an FP8 combined accuracy training structure verified on an incredibly 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 dives into scaling laws and presents findings that facilitate the scaling of massive models in open-source configurations. It presents the DeepSeek LLM project, devoted to advancing open-source language designs with a long-term perspective.
DeepSeek-Coder: classifieds.ocala-news.com When the Large Language Model Meets Programming-The Rise of Code Intelligence (January 2024) This research presents the DeepSeek-Coder series, yogaasanas.science a variety of open-source code models trained from scratch on 2 trillion tokens. The models are pre-trained on a premium project-level code corpus and employ a fill-in-the-blank task to improve 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 cost-effective training and efficient 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 efficiency similar to GPT-4 Turbo in code-specific tasks.
Interesting events
- Hong Kong University duplicates R1 outcomes (Jan 25, '25).
- Huggingface announces huggingface/open-r 1: Fully open reproduction of DeepSeek-R1 to duplicate R1, completely open source (Jan 25, '25).
- OpenAI scientist validates the DeepSeek team separately discovered and used some core ideas the OpenAI team used on the way to o1
Liked this post? Join the newsletter.