DeepSeek-R1 is an open-source language design constructed 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 lots of standards, however it likewise comes with totally MIT-licensed weights. This marks it as the very first non-OpenAI/Google design to deliver strong thinking capabilities in an open and available way.

What makes DeepSeek-R1 especially amazing is its openness. Unlike the less-open approaches from some industry leaders, DeepSeek has actually released a detailed training approach in their paper.
The design is also incredibly 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 typical wisdom was that better models needed more data and compute. While that's still legitimate, designs like o1 and R1 show an option: 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 fascinating, I won't talk about here.

DeepSeek-R1 utilizes 2 significant concepts:

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

R1 and R1-Zero are both reasoning designs. This essentially suggests they do Chain-of-Thought before answering. For the R1 series of designs, this takes form as believing within a tag, before responding to with a final summary.

R1-Zero vs R1

R1-Zero uses Reinforcement Learning (RL) straight to DeepSeek-V3-Base with no monitored fine-tuning (SFT). RL is used to optimize the model's policy to optimize benefit.
R1-Zero attains excellent precision however in some cases produces confusing outputs, such as mixing multiple languages in a single response. R1 repairs that by incorporating restricted monitored fine-tuning and several RL passes, which improves both accuracy and readability.

It is intriguing how some languages might express certain concepts better, which leads the design to choose the most expressive language for the job.

Training Pipeline

The training pipeline that DeepSeek published in the R1 paper is tremendously intriguing. It showcases how they produced such strong thinking 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 resolved it in the next phase.

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

The normal training method: Pretraining on large dataset (train to forecast 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 several SFT and RL stages

Cold-Start Fine-Tuning: Fine-tune DeepSeek-V3-Base on a few thousand Chain-of-Thought (CoT) samples to guarantee the RL procedure has a good starting point. This gives a great design to begin RL.
First RL Stage: Apply GRPO with rule-based benefits to improve reasoning accuracy and format (such as forcing chain-of-thought into thinking tags). When they were near merging in the RL procedure, they relocated to the next action. The result of this action is a strong reasoning design 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 action 2), combined with supervised information from the DeepSeek-V3-Base model. They collected around 600k premium reasoning samples.
Second Fine-Tuning: Fine-tune DeepSeek-V3-Base again on 800k total samples (600k reasoning + 200k basic tasks) for wider capabilities. This action resulted in a strong thinking design with general capabilities.
Second RL Stage: Add more reward signals (helpfulness, harmlessness) to fine-tune the last design, in addition to the thinking benefits. The outcome is DeepSeek-R1.
They likewise did design distillation for several Qwen and Llama models on the thinking traces to get distilled-R1 designs.

Model distillation is a technique where you use an instructor design to improve a trainee design by creating training information for the trainee design.
The instructor is usually a bigger design than the trainee.

Group Relative Policy Optimization (GRPO)

The fundamental concept behind using reinforcement knowing for LLMs is to tweak the design's policy so that it naturally produces more accurate and useful answers.
They used a benefit system that examines not only for correctness but also for proper formatting and language consistency, so the design gradually finds out to favor actions that fulfill these quality criteria.

In this paper, they encourage the R1 design to produce chain-of-thought reasoning through RL training with GRPO.
Rather than adding a different module at inference time, the training procedure itself nudges the design 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 reliance on straightforward, rule-based benefit functions.
Instead of depending on costly external models or human-graded examples as in conventional RLHF, the RL used for R1 utilizes simple criteria: it might offer a higher reward if the answer is proper, addsub.wiki if it follows the anticipated/ formatting, and if the language of the answer matches that of the timely.
Not counting on a reward model likewise suggests you do not have to spend time and effort training it, and it does not take memory and calculate far from your main model.

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

1. For each input prompt, the design generates different reactions.
2. Each response receives a scalar reward based upon aspects like precision, format, and language consistency.
3. Rewards are adjusted relative to the group's efficiency, essentially determining how much better each action is compared to the others.
4. The design updates its strategy a little to favor actions with greater relative benefits. It just makes minor adjustments-using strategies like clipping and a KL penalty-to make sure the policy does not wander off too far from its initial behavior.

A cool aspect of GRPO is its versatility. You can utilize simple rule-based benefit functions-for instance, awarding a benefit when the design properly utilizes the syntax-to guide the training.

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

For those aiming to dive much deeper, Will Brown has actually written quite a good implementation of training an LLM with RL utilizing GRPO. GRPO has also already been added to the Transformer Reinforcement Learning (TRL) library, which is another excellent 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 last note on explaining DeepSeek-R1 and the methodologies they have actually presented in their paper, I wish to highlight a passage from the DeepSeekMath paper, based on a point Yannic Kilcher made in his video.

These findings indicate that RL boosts the model's overall efficiency by rendering the output distribution more robust, to put it simply, it seems that the enhancement is attributed to enhancing the proper action from TopK instead of the improvement of basic abilities.

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

This recommends that support learning on LLMs is more about refining and "shaping" the existing circulation of actions rather than enhancing the design with completely new capabilities.
Consequently, while RL strategies such as PPO and GRPO can produce substantial efficiency gains, there appears to be an inherent ceiling determined 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 huge turning point. I'm excited to see how it unfolds!

Running DeepSeek-R1

I have actually utilized DeepSeek-R1 by means of the main chat user interface for various issues, which it appears to fix well enough. The additional search functionality makes it even nicer to utilize.

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

I also rented 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 design's capabilities.

671B via 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 had the ability to overcome 2 tok/sec with DeepSeek R1 671B, without using their GPU on their local video gaming setup.
Digital Spaceport composed a complete 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 severe work, however it's enjoyable to run these big 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 believe before responding to, their time-to-usefulness is normally greater than other models, however their effectiveness is also typically higher.
We require to both maximize 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: 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 completely local "deep researcher" with DeepSeek-R1 - YouTube).
DeepSeek R1's recipe to reproduce 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 structure that combines multimodal understanding and generation. It can both understand and produce images.
DeepSeek-R1: Incentivizing Reasoning Capability in Large Language Models via Reinforcement Learning (January 2025) This paper introduces DeepSeek-R1, an open-source reasoning design that matches the performance of OpenAI's o1. It presents a detailed approach for training such designs using massive support learning techniques.
DeepSeek-V3 Technical Report (December 2024) This report goes over the execution of an FP8 combined accuracy training structure verified on a very massive model, attaining both accelerated training and decreased GPU memory usage.
DeepSeek LLM: Scaling Open-Source Language Models with Longtermism (January 2024) This paper delves into scaling laws and presents findings that facilitate the scaling of large-scale designs in open-source configurations. It presents the DeepSeek LLM project, committed 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 presents 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 premium project-level code corpus and use a fill-in-the-blank task to boost code generation and infilling.
DeepSeek-V2: forum.altaycoins.com 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 effective inference.
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 efficiency similar 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: Fully open recreation of DeepSeek-R1 to duplicate R1, users.atw.hu completely open source (Jan 25, '25).
- OpenAI scientist validates the DeepSeek team individually found and used some core ideas the OpenAI group utilized en route to o1

Liked this post? Join the newsletter.