mlsanityData to 7 Oct 2026

Residual Advantage: Student-Relative Teacher Guidance for RL with Verifiable Rewards

arXiv 2610.11519 ↗First posted 8 Oct 2026cs.CLcited by 0

Not on the map. Why?

Abstract (arXiv)

Reinforcement learning with verifiable rewards (RLVR) and on-policy distillation (OPD) have become two main paradigms for post-training reasoning models. RLVR gives each response a single outcome label, leaving the steps inside it without separate credit. OPD provides token-level guidance at student-visited prefixes, but its pointwise signal does not directly reflect the pattern of teacher--student disagreement across the vocabulary. Dense, unbounded log-ratio supervision can amplify the teacher's influence, yet a strong solver is not necessarily a suitable guide when the student's solution paths depart from the teacher's. We propose Residual Advantage (RA), which treats the teacher--student probability residual as a bounded one-step reward, subtracts the corresponding state value under the student policy to form a standard advantage, and centers the result within each response before adding it to the verifier advantage. The guidance term has zero mean within each response, so the verifier advantage remains the response's mean label and the teacher only redistributes credit among the steps within it. CoRA further updates a teacher LoRA with verifier advantages on the same scored student batch and uses the updated teacher in the next iteration's residual, adapting guidance to the student's attempts. With Qwen3-1.7B-Base and Qwen3-4B-Base students and a Qwen3-8B teacher, RA combined with GRPO or REINFORCE++ improves the underlying sequence-advantage algorithm in all 24 comparisons on three mathematical benchmarks, raising macro Avg@8 by 1.7--3.6 points and Pass@8 by 3.9--6.3 points. Both combinations surpass teacher-only OPD, and CoRA adds a further 1.0--1.5 Avg@8 points.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 39 references that are in the map. First posted on arXiv 8 Oct 2026.

Builds on

14 of 39 references.

References · 14

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
  3. 2025Qwen3 Technical Reportcited by 8,195
  4. 2025DeepSeek-R1: Incentivizing Reasoning Capability in LLMs via Reinforcement Learningcited by 6,146
  5. 2025DAPO: An Open-Source LLM Reinforcement Learning System at Scalecited by 2,678
  6. 2019Advantage-Weighted Regression: Simple and Scalable Off-Policy Reinforcement Learningcited by 750
  7. 2025Beyond the 80/20 Rule: High-Entropy Minority Tokens Drive Effective Reinforcement Learning for LLM Reasoningcited by 540
  8. 2025Process Reinforcement through Implicit Rewardscited by 478
  9. 2024From r to Q^*: Your Language Model is Secretly a Q-Functioncited by 242
  10. 2025REINFORCE++: Stabilizing Critic-Free Policy Optimization with Global Advantage Normalizationcited by 233
  11. 2026On-policy Distillation with Verifiable Rewardcited by 10
  12. 2026OPD+: Rethinking the Advantage Design for On-Policy Distillationcited by 7
2 more
  1. 2026Sequential Beats Joint: On the Interplay between On-Policy Distillation and RLVRcited by 7
  2. 2026Learning from Language Feedback via Variational Policy Distillationcited by 6

Built on by

Not cited yet.