Pith. sign in

REVIEW 24 cited by

KDRL: Post-Training Reasoning LLMs via Unified Knowledge Distillation and Reinforcement Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2506.02208 v1 pith:YH2KS66N submitted 2025-06-02 cs.LG cs.AIcs.CL

classification cs.LGcs.AIcs.CL
keywords reasoningkdrlpost-trainingefficiencylearningmodelteacherunified
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent advances in large language model (LLM) post-training have leveraged two distinct paradigms to enhance reasoning capabilities: reinforcement learning (RL) and knowledge distillation (KD). While RL enables the emergence of complex reasoning behaviors, it often suffers from low sample efficiency when the initial policy struggles to explore high-reward trajectories. Conversely, KD improves learning efficiency via mimicking the teacher model but tends to generalize poorly to out-of-domain scenarios. In this work, we present \textbf{KDRL}, a \textit{unified post-training framework} that jointly optimizes a reasoning model through teacher supervision (KD) and self-exploration (RL). Specifically, KDRL leverages policy gradient optimization to simultaneously minimize the reverse Kullback-Leibler divergence (RKL) between the student and teacher distributions while maximizing the expected rule-based rewards. We first formulate a unified objective that integrates GRPO and KD, and systematically explore how different KL approximations, KL coefficients, and reward-guided KD strategies affect the overall post-training dynamics and performance. Empirical results on multiple reasoning benchmarks demonstrate that KDRL outperforms GRPO and various KD baselines while achieving a favorable balance between performance and reasoning token efficiency. These findings indicate that integrating KD and RL serves as an effective and efficient strategy to train reasoning LLMs.

Discussion (0). Sign in to comment.

Forward citations

Cited by 24 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Weak-to-Strong Generalization via Direct On-Policy Distillation

    cs.LG 2026-07 conditional novelty 7.0 of 10

    Transferring the log-ratio of a small model's pre-RL and post-RL checkpoints provides a dense implicit reward that improves stronger student models at a fraction of the cost of direct RL.

  2. Zone of Proximal Policy Optimization: Teacher in Prompts, Not Gradients

    cs.CL 2026-06 unverdicted novelty 7.0 of 10

    ZPPO improves distillation to small vision-language models by using binary and negative candidate prompts plus a replay buffer for hard questions, outperforming standard distillation and GRPO on a 31-benchmark suite w...

  3. Multi-Rollout On-Policy Distillation via Peer Successes and Failures

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    MOPD improves on-policy distillation for LLMs by using peer successes for positive patterns and failures for negative examples to create more informative teacher signals.

  4. CoDistill-GRPO: A Co-Distillation Recipe for Efficient Group Relative Policy Optimization

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    CoDistill-GRPO lets small and large models mutually improve via co-distillation in GRPO, raising small-model math accuracy by over 11 points while cutting large-model training time by about 18%.

  5. Structured Role-Aware Policy Optimization for Multimodal Reasoning

    cs.AI 2026-05 unverdicted novelty 7.0 of 10

    SRPO refines GRPO into role-aware token-level advantages by emphasizing perception tokens based on visual dependency (original vs. corrupted inputs) and reasoning tokens based on consistency with perception, unified v...

  6. SAF-OPD: Stable Advantage Fusion for On-Policy Distillation

    cs.LG 2026-07 conditional novelty 6.0 of 10

    SAF stabilizes RLVR+on-policy-distillation training by sparsifying, bounding, warming up, and annealing the teacher-token advantage, improving aggregate math/code scores by 0.51–2.70% over fixed-coefficient fusion.

  7. Weak-to-Strong Generalization via Direct On-Policy Distillation

    cs.LG 2026-07 conditional novelty 6.0 of 10

    Transferring a weak model’s RL-induced log-ratio policy shift on a strong student’s own rollouts raises AIME accuracy more cheaply than imitating the weak teacher or running matched-step RL on the student.

  8. Cross-lingual Self-Consistency for Multilingual Reasoning with Language Models

    cs.CL 2026-05 unverdicted novelty 6.0 of 10

    Unsupervised RL enforces cross-lingual self-consistency to improve multilingual math reasoning by up to 21.7% on MGSM without gold answers or parallel data, with generalization to unseen languages.

  9. Teacher-Guided Policy Optimization for On-Policy Reasoning Distillation under Large Policy Divergence

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    TGPO improves on-policy LLM distillation by using teacher predictions conditioned on student rollouts to supply informative guidance when the two distributions diverge.

  10. Teacher-Guided Policy Optimization for On-Policy Reasoning Distillation under Large Policy Divergence

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    TGPO improves on-policy reasoning distillation in LLMs by using teacher-guided token generation conditioned on student contexts together with trajectory rewards, outperforming RKL-based methods under large policy divergence.

  11. Multi-Rollout On-Policy Distillation via Peer Successes and Failures

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    MOPD improves on-policy distillation by using peer successes and failures from multiple rollouts to construct more informative teacher signals, yielding consistent gains over baselines on reasoning benchmarks.

  12. AIPO: Learning to Reason from Active Interaction

    cs.CL 2026-05 unverdicted novelty 6.0 of 10

    AIPO trains LLMs to expand their reasoning capability boundary via active multi-agent interaction with Verify, Knowledge, and Reasoning agents during RLVR, using importance sampling and clipping to handle feedback, th...

  13. AIPO: Learning to Reason from Active Interaction

    cs.CL 2026-05 unverdicted novelty 6.0 of 10

    AIPO adds active multi-agent consultation (Verify, Knowledge, Reasoning agents) plus custom importance sampling to RLVR training so LLMs expand their reasoning boundary and then operate without the agents.

  14. Characterizing Model-Native Skills

    cs.AI 2026-04 conditional novelty 6.0 of 10

    Recovering an orthogonal basis from model activations yields a model-native skill characterization that improves reasoning Pass@1 by up to 41% via targeted data selection and supports inference steering, outperforming...

  15. SCOPE: Signal-Calibrated On-Policy Distillation Enhancement with Dual-Path Adaptive Weighting

    cs.LG 2026-04 conditional novelty 6.0 of 10

    Routing on-policy rollouts by correctness and weighting them with teacher/student perplexity improves Avg@32 and Pass@32 over uniform OPD and GRPO on reasoning tasks.

  16. Skill-SD: Skill-Conditioned Self-Distillation for Multi-turn LLM Agents

    cs.LG 2026-04 unverdicted novelty 6.0 of 10

    Skill-SD turns an agent's completed trajectories into dynamic natural-language skills that condition only the teacher in self-distillation, yielding 14-42% gains over RL and OPSD baselines on multi-turn agent benchmarks.

  17. VOLD: Reasoning Transfer from LLMs to Vision-Language Models via On-Policy Distillation

    cs.CV 2025-10 conditional novelty 6.0 of 10

    VOLD transfers text-only LLM reasoning to a 3B VLM via teacher-trace SFT followed by GRPO plus on-policy distillation, improving visual-math accuracy over GRPO-alone and prior text-only baselines (e.g., MathVision 28....

  18. Toward Better EHR Reasoning in LLMs: Reinforcement Learning with Expert Attention Guidance

    cs.AI 2025-08 conditional novelty 6.0 of 10

    EAG-RL improves LLM performance on EHR mortality and readmission prediction by training on expert-generated reasoning traces and an attention-alignment RL reward.

  19. Agentic Reinforcement Learning with Self-Distilled Reward Shaping

    cs.LG 2026-08 conditional novelty 5.0 of 10

    ADRS converts a frozen model's privileged skill-conditioned token scores into calibrated, return-gated reward shaping for agentic reinforcement learning, reporting consistent long-horizon gains.

  20. Distill Where You Fail: Recovering Learning Signals of Negative RL-Groups from Adaptive Teacher Guidance

    cs.CL 2026-08 conditional novelty 5.0 of 10

    RSTG selectively distills a teacher on negative zero-variance prompts, with confidence weighting, token-level selection, and auxiliary SFT, improving math and code RL post-training over naive GRPO+OPD.

  21. One-Way Policy Optimization for Self-Evolving LLMs

    cs.LG 2026-05 unverdicted novelty 5.0 of 10

    OWPO decouples optimization direction from magnitude via asymmetric reweighting (Accelerated Alignment for inferior deviations, Gain Locking for superior) plus iterative references to create a ratchet effect for conti...

  22. Signal Reshaping for GRPO in Weak-Feedback Agentic Code Repair

    cs.AI 2026-05 unverdicted novelty 5.0 of 10

    Reshaping outcome rewards, process signals, and rollout comparability in GRPO raises strict compile-and-semantic accuracy in agentic code repair from 0.385 to 0.535 under weak feedback.

  23. SCOPE: Signal-Calibrated On-Policy Distillation Enhancement with Dual-Path Adaptive Weighting

    cs.LG 2026-04 unverdicted novelty 5.0 of 10

    SCOPE routes LLM on-policy rollouts by correctness into teacher-perplexity-weighted KL for errors and student-perplexity-weighted MLE for successes, with group normalization, yielding 11.42% relative Avg@32 gain on re...

  24. Reinforcement Learning Meets Large Language Models: A Survey of Advancements and Applications Across the LLM Lifecycle

    cs.CL 2025-09 conditional novelty 3.0 of 10

    A survey that maps reinforcement learning methods, datasets, benchmarks, and open-source tools across the full training lifecycle of large language models, focusing on verifiable-reward reasoning.

Pith tools