DeepSeek-R1 is an open-source language model constructed on DeepSeek-V3-Base that's been making waves in the AI community. Not only does it match-or even surpass-OpenAI's o1 model in many standards, but it likewise comes with fully MIT-licensed weights. This marks it as the very first non-OpenAI/Google model to provide strong thinking capabilities in an open and available manner.

What makes DeepSeek-R1 especially amazing is its openness. Unlike the less-open approaches from some industry leaders, DeepSeek has published a detailed training methodology in their paper. The model is likewise incredibly 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 typical wisdom was that much better models needed more information and compute. While that's still valid, models like o1 and R1 demonstrate an alternative: inference-time scaling through thinking.

The Essentials

The DeepSeek-R1 paper provided numerous designs, however main among them were R1 and R1-Zero. Following these are a series of distilled designs that, while fascinating, I won't talk about here.

DeepSeek-R1 utilizes 2 major concepts:

1. A multi-stage pipeline where a small set of cold-start information kickstarts the model, followed by massive RL.

1. Group Relative Policy Optimization (GRPO), a support knowing approach that relies on comparing numerous model outputs per timely to avoid the need for a separate critic.
   
   R1 and R1-Zero are both thinking designs. This essentially 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 last summary.
   
   R1-Zero vs R1
   
   R1-Zero uses Reinforcement Learning (RL) straight to DeepSeek-V3-Base without any supervised fine-tuning (SFT). RL is utilized to optimize the design's policy to optimize reward. R1-Zero attains exceptional precision but often produces complicated outputs, such as mixing several languages in a single action. R1 repairs that by including restricted monitored fine-tuning and passes, which enhances both accuracy and readability.
   
   It is intriguing how some languages may reveal certain ideas much better, which leads the model to select the most expressive language for the task.
   
   Training Pipeline
   
   The training pipeline that DeepSeek published in the R1 paper is profoundly intriguing. It showcases how they developed such strong thinking designs, and what you can expect from each stage. This consists of the problems that the resulting models from each phase have, and how they solved it in the next stage.
   
   It's intriguing that their training pipeline varies from the usual:
   
   The usual training technique: Pretraining on big dataset (train to anticipate next word) to get the base design → supervised fine-tuning → preference tuning by means of RLHF R1-Zero: Pretrained → RL R1: Pretrained → Multistage training pipeline with numerous 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 procedure has a good beginning point. This gives an excellent model to start RL. First RL Stage: Apply GRPO with rule-based rewards to enhance thinking accuracy and formatting (such as requiring chain-of-thought into thinking tags). When they were near convergence in the RL process, they relocated to the next step. The outcome of this action is a strong thinking model however with weak general abilities, e.g., poor formatting and language mixing. Rejection Sampling + general data: Create new SFT information through rejection sampling on the RL checkpoint (from step 2), combined with monitored data from the DeepSeek-V3-Base design. They collected around 600k high-quality thinking samples. Second Fine-Tuning: Fine-tune DeepSeek-V3-Base again on 800k overall samples (600k thinking + 200k general jobs) for broader capabilities. This action led to a strong reasoning design with general capabilities. Second RL Stage: Add more benefit signals (helpfulness, harmlessness) to fine-tune the final model, in addition to the reasoning benefits. The outcome is DeepSeek-R1. They likewise did design distillation for numerous Qwen and Llama models on the thinking traces to get distilled-R1 designs.
   
   Model distillation is a technique where you use a teacher model to enhance a trainee model by producing training information for the trainee design. The teacher is normally a larger model than the trainee.
   
   Group Relative Policy Optimization (GRPO)
   
   The fundamental idea behind using support knowing for LLMs is to tweak the model's policy so that it naturally produces more accurate and helpful responses. They utilized a reward system that inspects not only for correctness however likewise for proper format and language consistency, so the design gradually finds out to prefer responses that satisfy these quality criteria.
   
   In this paper, they encourage the R1 design to generate chain-of-thought reasoning through RL training with GRPO. Instead of including a different module at reasoning time, the training procedure itself pushes the model to produce detailed, detailed outputs-making the chain-of-thought an emergent habits of the optimized policy.
   
   What makes their technique particularly intriguing is its reliance on straightforward, rule-based benefit functions. Instead of depending upon expensive external designs or human-graded examples as in conventional RLHF, the RL used for R1 utilizes basic criteria: it might give a greater benefit if the answer is proper, if it follows the expected/ formatting, and if the language of the answer matches that of the prompt. Not depending on a benefit model also means you don't have to hang out and effort training it, and it does not take memory and calculate away from your main design.
   
   GRPO was introduced in the DeepSeekMath paper. Here's how GRPO works:
   
   1. For each input prompt, the design creates different actions.
2. Each reaction gets a scalar reward based upon aspects like accuracy, format, and language consistency.
3. Rewards are changed relative to the group's efficiency, basically determining just how much better each reaction is compared to the others.
4. The model updates its method a little to favor actions with higher relative benefits. It only makes slight adjustments-using techniques like clipping and a KL penalty-to guarantee the policy does not stray too far from its initial habits.
   
   A cool element of GRPO is its versatility. You can use easy rule-based benefit functions-for instance, granting a perk when the model correctly uses the syntax-to guide the training.
   
   While DeepSeek used GRPO, you might use alternative methods instead (PPO or PRIME).
   
   For those aiming to dive much deeper, Will Brown has written rather a good application of training an LLM with RL using GRPO. GRPO has actually also already been added to the Transformer Reinforcement Learning (TRL) library, which is another good resource. Finally, Yannic Kilcher has a fantastic 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 approaches they have actually provided 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 suggest that RL enhances the design's total efficiency by rendering the output distribution more robust, simply put, it seems that the enhancement is attributed to boosting the proper action from TopK rather than the enhancement of basic abilities.
   
   In other words, RL fine-tuning tends to shape the output distribution so that the highest-probability outputs are most likely to be right, even though the total capability (as determined by the diversity of correct answers) is mainly present in the pretrained model.
   
   This suggests that support learning on LLMs is more about refining and "shaping" the existing distribution of actions instead of enhancing the model with completely brand-new capabilities. Consequently, while RL strategies such as PPO and GRPO can produce considerable efficiency gains, there seems an inherent 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 big turning point. I'm thrilled to see how it unfolds!
   
   Running DeepSeek-R1
   
   I've used DeepSeek-R1 by means of the main chat interface for different problems, which it appears to fix well enough. The additional search performance makes it even better to use.
   
   Interestingly, o3-mini(-high) was launched as I was writing this post. From my initial testing, R1 appears stronger at mathematics than o3-mini.
   
   I likewise 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 model would carry out when deployed on a single H100 GPU-not to extensively evaluate the design's capabilities.
   
   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 seemed to be the sweet area offered this setup.
   
   Performance:
   
   A r/localllama user explained that they were able to get over 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, however it's fun to run these big designs on available hardware.
   
   What matters most to me is a combination of effectiveness and time-to-usefulness in these models. Since reasoning models need to believe before answering, their time-to-usefulness is normally higher than other designs, however their usefulness is likewise generally higher. We need to both optimize usefulness and lessen time-to-usefulness.
   
   70B by means of Ollama
   
   70.6 b params, 4-bit KM quantized DeepSeek-R1 running via Ollama:
   
   GPU usage soars 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 by means of Reinforcement Learning [2402.03300] DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models DeepSeek R1 - Notion (Building a completely regional "deep researcher" with DeepSeek-R1 - YouTube). DeepSeek R1's recipe to replicate 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 an unique autoregressive framework that unifies 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 introduces DeepSeek-R1, an open-source thinking design that rivals the performance of OpenAI's o1. It provides a detailed method for training such designs utilizing large-scale reinforcement knowing methods. DeepSeek-V3 Technical Report (December 2024) This report goes over the application of an FP8 mixed accuracy training framework validated on a very massive design, attaining both sped up training and lowered GPU memory use. DeepSeek LLM: Scaling Open-Source Language Models with Longtermism (January 2024) This paper digs into scaling laws and provides findings that help with the scaling of large-scale designs in open-source setups. It presents the DeepSeek LLM job, dedicated to advancing open-source language designs with a long-lasting perspective. DeepSeek-Coder: When the Large Language Model Meets Programming-The Rise of Code Intelligence (January 2024) This research presents the DeepSeek-Coder series, a variety of open-source code designs trained from scratch on 2 trillion tokens. The models are pre-trained on a top quality project-level code corpus and use 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 model characterized by affordable training and effective reasoning. DeepSeek-Coder-V2: Breaking the Barrier of Closed-Source Models in Code Intelligence (June 2024) This research study introduces DeepSeek-Coder-V2, an open-source Mixture-of-Experts (MoE) code language design that attains efficiency equivalent to GPT-4 Turbo in code-specific jobs.
   
   Interesting events
   
   - Hong Kong University reproduces R1 outcomes (Jan 25, '25). - Huggingface announces huggingface/open-r 1: oke.zone Fully open recreation of DeepSeek-R1 to duplicate R1, fully open source (Jan 25, '25).
5. OpenAI scientist validates the DeepSeek group separately discovered and utilized some core ideas the OpenAI group utilized en route to o1
   
   Liked this post? Join the newsletter.