@maximelabonne: This is so neat! Dynamic Fine-Tuning (DFT) reweights the SFT loss by the model's own token probability, which creates a…

X AI KOLs Following Papers

Summary

Dynamic Fine-Tuning (DFT) is introduced as a method that reweights the SFT loss using the model's own token probability, creating a feedback loop, and adds forward KL to penalize tokens the base model finds likely but the policy has pushed toward zero probability. The tweet expresses skepticism about SFT papers in practice but praises the attempt.

This is so neat! Dynamic Fine-Tuning (DFT) reweights the SFT loss by the model's own token probability, which creates a feedback loop. So they added forward KL to penalize any token the base finds likely, but the policy has pushed toward zero probability. DFT and forward KL have opposite failure modes, so they kind of fix each other (in theory). SFT papers never work in practice, but I love this attempt!
Original Article
View Cached Full Text

Cached at: 05/21/26, 07:37 PM

This is so neat!

Dynamic Fine-Tuning (DFT) reweights the SFT loss by the model’s own token probability, which creates a feedback loop.

So they added forward KL to penalize any token the base finds likely, but the policy has pushed toward zero probability.

DFT and forward KL have opposite failure modes, so they kind of fix each other (in theory).

SFT papers never work in practice, but I love this attempt!

Similar Articles

GFT: From Imitation to Reward Fine-Tuning with Unbiased Group Advantages and Dynamic Coefficient Rectification

Hugging Face Daily Papers

GFT (Group Fine-Tuning) is a unified post-training framework for LLMs that addresses limitations of supervised fine-tuning by using Group Advantage Learning and Dynamic Coefficient Rectification to improve training stability and generalization. The paper shows SFT can be interpreted as a special case of policy gradient optimization with sparse implicit rewards, and GFT consistently outperforms SFT-based methods while integrating more smoothly with subsequent RL training.