RL based LLM post-training (part 1)
Soo Kyung Kim
Department of AI�Ewha Womans University
Agenda
�
How to train LLM?
GPT-3 base
GPT-3 �instruction-tuned
Online RL vs Offline RL
DPO
GRPO
PPO
On-policy RL
Imitation learning
Off-policy�(Hybrid btw �on and off policy)
(c) Imitation learning
RLHF – Reward Model
Bradley–Terry model:
Reward Model
Bradley–Terry model:
RLHF
LLM specific KL term
�In RLHF they used PPO
PPO (Proximal Policy Optimization)
Solve high-variance: �We don’t want
my policy becomes too different with old policy��🡪 Conservative update
PPO (Proximal Policy Optimization)
+ Pro, - Con
DPO (Deterministic Preference Optimization)
DPO (Deterministic Preference Optimization)
+ Pro, - Con
GRPO (Group Relative Policy Optimization)
Solve high-variance:�1. We don’t want
my policy becomes too different with old policy�🡪 Conservative update��2. Average-out in the group with same query �🡪 Unstable Trust-Region
LLM specific KL term
General RL-based post-training
�🡪 Conservative update
�🡪 Value-over estimation�🡪 Low Entropy of Policy�(Deterministic Policy Collapse, Reward Hacking)
�🡪 Unstable TR
GRPO (Group Relative Policy Optimization)
+ Pro, - Con
Problems in RL-based LLM post-training
| PPO (Online) | GRPO (Hybrid) | DPO (Imitation Learning) |
| ����� | | |
Cons | Stable Training | - Robust to reward-model calibration�- More sample-efficient | - Very sample-efficient |
Pros | - Slow, large computing cost - Conservative policy update�- Not robust to reward score (both preference or scalar) | - Conservative policy update, Limited exploration - Low entropy of policy (Deterministic policy collapse) | - Require pre-sampled data�Limited exploration�- Low entropy of policy�- Difficult to explore�- Value(Q) over-estimation� |
DAPO, GSPO,TR-GRPO
GoodLiar
(DA-ILQL)
DPO : Appendix - derivation