|  Post Reply

DeepSeek-R1 is an open-source language model built 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 numerous criteria, however it likewise comes with fully MIT-licensed weights. This marks it as the first non-OpenAI/Google model to deliver strong reasoning capabilities in an open and available manner.

What makes DeepSeek-R1 especially exciting is its openness. Unlike the less-open techniques from some industry leaders, DeepSeek has released a detailed training approach in their paper.
The model is likewise incredibly economical, 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 designs needed more data and calculate. While that's still valid, designs like o1 and R1 demonstrate an option: inference-time scaling through reasoning.

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 designs that, while fascinating, I won't go over here.

DeepSeek-R1 utilizes 2 major ideas:

1. A multi-stage pipeline where a little set of cold-start information kickstarts the model, followed by massive RL.
2. Group Relative Policy Optimization (GRPO), a reinforcement knowing approach that relies on comparing multiple model outputs per prompt to prevent the need for a different critic.

R1 and R1-Zero are both thinking models. This basically indicates they do Chain-of-Thought before answering. For the R1 series of designs, this takes type as thinking within a tag, before responding to with a final summary.

R1-Zero vs R1

R1-Zero applies Reinforcement Learning (RL) straight to DeepSeek-V3-Base with no monitored fine-tuning (SFT). RL is utilized to enhance the design's policy to optimize benefit.
R1-Zero attains excellent accuracy but in some cases produces confusing outputs, such as mixing several languages in a single response. R1 repairs that by including limited supervised fine-tuning and multiple RL passes, which improves both correctness and readability.

It is interesting how some languages may reveal certain concepts much better, which leads the model to choose the most expressive language for the task.

Training Pipeline

The training pipeline that DeepSeek released in the R1 paper is immensely intriguing. It showcases how they created such strong thinking designs, and what you can expect from each stage. This consists of the problems that the resulting designs from each phase have, utahsyardsale.com and how they fixed it in the next phase.

It's fascinating that their training pipeline differs from the usual:

The typical training strategy: Pretraining on big 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 numerous SFT and RL stages

Cold-Start Fine-Tuning: Fine-tune DeepSeek-V3-Base on a few thousand Chain-of-Thought (CoT) samples to make sure the RL procedure has a good beginning point. This gives a great design to begin RL.
First RL Stage: Apply GRPO with rule-based rewards to improve 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 action. The result of this action is a strong thinking design however with weak basic capabilities, e.g., poor formatting and language mixing.
Rejection Sampling + basic information: Create new SFT information through rejection tasting on the RL checkpoint (from step 2), integrated with supervised data from the DeepSeek-V3-Base design. They gathered around 600k top quality reasoning samples.
Second Fine-Tuning: Fine-tune DeepSeek-V3-Base again on 800k overall samples (600k thinking + 200k general jobs) for more comprehensive capabilities. This step led to a strong thinking model with basic abilities.
Second RL Stage: Add more benefit signals (helpfulness, harmlessness) to fine-tune the last design, in addition to the thinking benefits. The result is DeepSeek-R1.
They also did design distillation for numerous Qwen and Llama models on the reasoning traces to get distilled-R1 designs.

Model distillation is a strategy where you utilize an instructor design to enhance a trainee design by generating training information for the trainee model.
The instructor is usually a bigger model than the trainee.

Group Relative Policy Optimization (GRPO)

The standard idea behind utilizing support learning for LLMs is to tweak the model's policy so that it naturally produces more precise and beneficial answers.
They used a benefit system that checks not only for correctness but likewise for proper format and language consistency, so the model slowly finds out to favor reactions that fulfill these quality requirements.

In this paper, they encourage the R1 model to create chain-of-thought reasoning through RL training with GRPO.
Rather than adding a different module at inference time, the training process itself pushes the model to produce detailed, detailed outputs-making the chain-of-thought an emerging behavior of the optimized policy.

What makes their technique particularly intriguing is its reliance on straightforward, rule-based reward functions.
Instead of depending on costly external designs or human-graded examples as in standard RLHF, the RL used for R1 uses basic criteria: it may offer a higher reward if the response is correct, if it follows the anticipated/ formatting, and if the language of the answer matches that of the prompt.
Not depending on a reward model also indicates you do not have to hang around and effort training it, and it doesn't take memory and compute far from your main design.

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

1. For each input timely, the model produces various actions.
2. Each response receives a scalar benefit based upon elements like accuracy, format, and language consistency.
3. Rewards are adjusted relative to the group's performance, essentially measuring just how much better each response is compared to the others.
4. The model updates its method a little to prefer reactions with higher relative benefits. It only makes small adjustments-using methods like clipping and a KL penalty-to make sure the policy doesn't wander off too far from its original behavior.

A cool aspect of GRPO is its versatility. You can utilize easy rule-based reward functions-for circumstances, granting a reward when the model correctly utilizes the syntax-to guide the training.

While DeepSeek utilized GRPO, you might utilize alternative techniques rather (PPO or PRIME).

For those aiming to dive much deeper, Will Brown has written quite a good execution of training an LLM with RL utilizing GRPO. GRPO has also currently 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 course to AGI?

As a final note on explaining DeepSeek-R1 and the approaches they have actually presented 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 indicate that RL enhances the model's overall efficiency by rendering the output distribution more robust, in other words, it seems that the improvement is attributed to improving the right action from TopK rather than the enhancement of basic capabilities.

Simply put, RL fine-tuning tends to form the output distribution so that the highest-probability outputs are most likely to be right, although the total capability (as determined by the diversity of appropriate responses) is mainly present in the pretrained model.

This recommends that reinforcement learning on LLMs is more about refining and "shaping" the existing distribution of reactions instead of enhancing the design with totally new capabilities.
Consequently, while RL strategies such as PPO and GRPO can produce considerable efficiency gains, there appears to be a fundamental 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 huge turning point. I'm excited to see how it unfolds!

Running DeepSeek-R1

I have actually used DeepSeek-R1 by means of the main chat user interface for different problems, which it seems to fix all right. The additional search performance makes it even nicer to utilize.

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

I likewise leased 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 goal 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 through llama.cpp:

29 layers appeared to be the sweet spot offered this configuration.

Performance:

A r/localllama user explained that they had the ability to get over 2 tok/sec with DeepSeek R1 671B, without utilizing their GPU on their local video gaming setup.
Digital Spaceport composed a full guide on how to run Deepseek R1 671b completely 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 quite manageable for wiki.die-karte-bitte.de any major work, however it's fun to run these large designs on available hardware.

What matters most to me is a combination of effectiveness and time-to-usefulness in these models. Since reasoning designs require to think before addressing, their time-to-usefulness is typically higher than other designs, however their usefulness is also typically greater.
We require to both optimize usefulness and reduce time-to-usefulness.

70B through Ollama

70.6 b params, 4-bit KM quantized DeepSeek-R1 running via Ollama:

GPU usage 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 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 recipe to reproduce 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 granny - 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 structure 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 presents DeepSeek-R1, an open-source reasoning design that matches the performance of OpenAI's o1. It provides a detailed approach for training such designs using large-scale support learning techniques.
DeepSeek-V3 Technical Report (December 2024) This report discusses the implementation of an FP8 combined precision training framework verified on an incredibly massive model, attaining both sped up training and decreased GPU memory use.
DeepSeek LLM: Scaling Open-Source Language Models with Longtermism (January 2024) This paper dives into scaling laws and presents findings that help with the scaling of large-scale designs in open-source setups. It introduces the DeepSeek LLM project, devoted to advancing open-source language designs with a long-lasting viewpoint.
DeepSeek-Coder: When the Large Language Model Meets Programming-The Rise of Code Intelligence (January 2024) This research presents the DeepSeek-Coder series, a range of open-source code models trained from scratch on 2 trillion tokens. The models are pre-trained on a high-quality project-level code corpus and employ a fill-in-the-blank job to boost 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 efficient inference.
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 model that attains efficiency similar to GPT-4 Turbo in code-specific jobs.

Interesting events

- Hong Kong University reproduces R1 results (Jan 25, '25).
- Huggingface announces huggingface/open-r 1: Fully open recreation of DeepSeek-R1 to duplicate R1, fully open source (Jan 25, '25).
- OpenAI scientist validates the DeepSeek group independently found and used some core ideas the OpenAI team used on the method to o1

Liked this post? Join the newsletter.

Add comment

INDEXING JOURNAL: