DeepSeek-R1 is an open-source language design developed 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 numerous standards, however it also features totally MIT-licensed weights. This marks it as the first non-OpenAI/Google design to deliver strong reasoning capabilities in an open and available manner.

What makes DeepSeek-R1 especially amazing is its openness. Unlike the less-open methods from some market leaders, DeepSeek has released a detailed training method in their paper. The model is also remarkably cost-effective, 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 typical wisdom was that better models required more information and compute. 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 several designs, however main amongst them were R1 and R1-Zero. Following these are a series of distilled models that, while intriguing, I won't go over here.

DeepSeek-R1 utilizes 2 major ideas:

1. A multi-stage pipeline where a little set of cold-start data kickstarts the design, followed by large-scale RL.

1. Group Relative Policy Optimization (GRPO), a support learning method that relies on comparing numerous design outputs per timely to prevent the need for a separate critic.
   
   R1 and R1-Zero are both . This essentially means they do Chain-of-Thought before addressing. For the R1 series of designs, this takes form as believing within a tag, before addressing with a final 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 optimize reward. R1-Zero attains excellent accuracy however sometimes produces complicated outputs, such as mixing multiple languages in a single action. R1 repairs that by including restricted monitored fine-tuning and several RL passes, which enhances both accuracy and readability.
   
   It is fascinating how some languages may reveal certain ideas much better, which leads the model to select the most expressive language for the job.
   
   Training Pipeline
   
   The training pipeline that DeepSeek published in the R1 paper is profoundly fascinating. It showcases how they produced such strong reasoning models, and what you can expect from each phase. This includes the problems that the resulting designs from each stage have, and how they solved it in the next phase.
   
   It's intriguing that their training pipeline differs from the normal:
   
   The typical training method: Pretraining on large dataset (train to forecast next word) to get the base model → monitored fine-tuning → choice tuning via RLHF R1-Zero: Pretrained → RL R1: Pretrained → Multistage training pipeline with several SFT and RL stages
   
   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 decent starting point. This provides an excellent design to begin RL. First RL Stage: Apply GRPO with rule-based benefits to enhance thinking accuracy and formatting (such as requiring chain-of-thought into thinking tags). When they were near merging in the RL procedure, they relocated to the next step. The outcome of this action is a strong thinking model however with weak basic abilities, e.g., poor format and language blending. Rejection Sampling + general information: Create new SFT data through rejection sampling on the RL checkpoint (from step 2), integrated with supervised information from the DeepSeek-V3-Base model. They gathered around 600k top quality thinking samples. Second Fine-Tuning: Fine-tune DeepSeek-V3-Base again on 800k total samples (600k reasoning + 200k general tasks) for wider abilities. This step resulted in a strong reasoning model with general abilities. Second RL Stage: Add more benefit signals (helpfulness, harmlessness) to refine the last design, in addition to the reasoning rewards. The outcome is DeepSeek-R1. They also did model distillation for numerous Qwen and Llama designs on the reasoning traces to get distilled-R1 designs.
   
   Model distillation is a technique where you utilize an instructor design to enhance a trainee design by producing training data for the trainee model. The instructor is generally a larger design than the trainee.
   
   Group Relative Policy Optimization (GRPO)
   
   The basic concept behind utilizing reinforcement knowing for LLMs is to fine-tune the design's policy so that it naturally produces more precise and helpful responses. They used a benefit system that examines not just for accuracy but also for proper format and language consistency, so the design slowly finds out to prefer actions that meet these quality criteria.
   
   In this paper, they encourage the R1 model to create chain-of-thought thinking through RL training with GRPO. Rather than including a different 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 optimized policy.
   
   What makes their approach particularly interesting is its dependence on straightforward, rule-based benefit functions. Instead of depending on costly external designs or human-graded examples as in conventional RLHF, the RL utilized for R1 utilizes simple criteria: it may provide a greater benefit if the answer is right, if it follows the anticipated/ formatting, and if the language of the answer matches that of the timely. Not depending on a reward design also means you do not have to hang out and effort training it, and it doesn't take memory and calculate far from your main model.
   
   GRPO was presented in the DeepSeekMath paper. Here's how GRPO works:
   
   1. For each input timely, the model creates different reactions.
2. Each reaction gets a scalar reward based upon elements like precision, formatting, and language consistency.
3. Rewards are changed relative to the group's efficiency, basically measuring just how much better each response is compared to the others.
4. The design updates its method a little to favor actions with higher relative advantages. It just makes slight adjustments-using methods like clipping and a KL penalty-to ensure the policy doesn't stray too far from its original habits.
   
   A cool aspect of GRPO is its flexibility. You can utilize basic rule-based reward functions-for instance, awarding a perk when the model correctly uses the syntax-to guide the training.
   
   While DeepSeek utilized GRPO, you might utilize alternative techniques instead (PPO or PRIME).
   
   For those aiming to dive much deeper, Will Brown has written rather a good execution of training an LLM with RL utilizing GRPO. GRPO has actually also currently been added to the Transformer Reinforcement Learning (TRL) library, which is another great resource. Finally, Yannic Kilcher has a fantastic video explaining GRPO by going through the DeepSeekMath paper.
   
   Is RL on LLMs the course to AGI?
   
   As a final note on explaining DeepSeek-R1 and the methods they've provided 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 show that RL improves the model's total efficiency by rendering the output distribution more robust, to put it simply, it seems that the enhancement is associated to enhancing the proper response from TopK rather than the improvement of fundamental capabilities.
   
   In other words, RL fine-tuning tends to shape the output distribution so that the highest-probability outputs are most likely to be right, despite the fact that the overall ability (as determined by the diversity of proper responses) is mainly present in the pretrained model.
   
   This recommends that reinforcement knowing on LLMs is more about refining and "shaping" the existing circulation of responses rather than enhancing the design with completely brand-new abilities. Consequently, while RL methods such as PPO and GRPO can produce considerable efficiency gains, there appears to be a fundamental ceiling determined 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 huge turning point. I'm excited to see how it unfolds!
   
   Running DeepSeek-R1
   
   I've utilized DeepSeek-R1 via the main chat user interface for various problems, which it seems to solve all right. The additional search performance makes it even nicer to use.
   
   Interestingly, o3-mini(-high) was launched as I was composing this post. From my initial screening, R1 appears stronger at math than o3-mini.
   
   I likewise rented a single H100 by means of 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 design'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 running on the GPU), running by means of llama.cpp:
   
   29 layers seemed to be the sweet spot provided 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 wrote a full guide on how to run Deepseek R1 671b fully in your area 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 major work, wiki.tld-wars.space however it's fun to run these large models on available hardware.
   
   What matters most to me is a mix of effectiveness and time-to-usefulness in these designs. Since reasoning designs require to believe before addressing, their time-to-usefulness is normally higher than other designs, but their usefulness is also typically greater. We require to both take full advantage of usefulness and reduce time-to-usefulness.
   
   70B by means of Ollama
   
   70.6 b params, 4-bit KM quantized DeepSeek-R1 running by means of Ollama:
   
   GPU usage soars here, as anticipated when compared to the mainly CPU-powered run of 671B that I showcased above.
   
   Resources
   
   DeepSeek-R1: imoodle.win Incentivizing Reasoning Capability in LLMs through Reinforcement Learning [2402.03300] DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Models DeepSeek R1 - Notion (Building a totally local "deep scientist" with DeepSeek-R1 - YouTube). DeepSeek R1's recipe to replicate 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 grandma - 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 merges multimodal understanding and generation. It can both comprehend and produce 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 reasoning model that rivals the performance of OpenAI's o1. It presents a detailed approach for training such designs utilizing massive support knowing strategies. DeepSeek-V3 Technical Report (December 2024) This report discusses the implementation of an FP8 combined accuracy training framework verified on an extremely large-scale model, attaining both sped up training and decreased GPU memory use. DeepSeek LLM: Scaling Open-Source Language Models with Longtermism (January 2024) This paper looks into scaling laws and provides findings that assist in the scaling of massive designs in open-source setups. It introduces the DeepSeek LLM task, devoted to advancing open-source language designs with a long-term 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 series of open-source code designs trained from scratch on 2 trillion tokens. The designs are pre-trained on a top quality project-level code corpus and utilize a fill-in-the-blank task 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 cost-effective 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 performance similar to GPT-4 Turbo in code-specific jobs.
   
   Interesting events
   
   - Hong Kong University reproduces R1 outcomes (Jan 25, '25).
5. Huggingface announces huggingface/open-r 1: Fully open recreation of DeepSeek-R1 to reproduce R1, completely open source (Jan 25, '25).
6. OpenAI researcher confirms the DeepSeek team separately found and used some core ideas the OpenAI team used on the way to o1
   
   Liked this post? Join the newsletter.