DeepSeek Trained R1 Without a Critic Network.Here Is the Actual Gradient.

· Source: AI on Medium · Field: Technology & Digital — Artificial Intelligence & Machine Learning · Depth: Advanced, quick

Summary

Group Relative Policy Optimisation (GRPO) is the algorithm behind DeepSeek-R1, a prominent reasoning model. GRPO replaced the widely used PPO algorithm by eliminating the expensive critic network, which previously doubled memory and compute requirements. In PPO, the critic network, having as many parameters as the policy, estimates future rewards at every token, necessitating its own forward and backward passes. By removing this component, GRPO significantly reduces computational overhead. This innovation enabled the training of models like DeepSeek-R1, which garnered significant attention for open-source reasoning capabilities. The article aims to demystify GRPO by detailing its actual gradient step-by-step, both manually and through code, moving beyond mere equation presentation.

Key takeaway

For Machine Learning Engineers optimizing large language models, understanding Group Relative Policy Optimisation (GRPO) is crucial. If you are currently using PPO, GRPO presents a compelling alternative by eliminating the resource-intensive critic network, effectively halving your compute and memory requirements. This efficiency gain, demonstrated by models like DeepSeek-R1, allows for more cost-effective and faster training of advanced reasoning capabilities. You should explore GRPO to enhance your model training workflows.

Key insights

GRPO replaces PPO by eliminating the critic network, significantly reducing computational demands for policy optimization.

Principles

Method

GRPO asks "how good is this..." instead of using a critic to estimate future reward at every token.

In practice

Topics

Best for: AI Scientist, Machine Learning Engineer

Related on AIssential

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by AI on Medium.