Skip to content

Learning from Hard Prompts: Difficulty-aware Advantage Amplification in Dynamic Sampling

Aug 2026 · 0 citations · 19 references
Computer Science

TL;DR

Direct Advantage Amplification (DAA), which amplifies the advantages of hard-to-sample correct responses on hard prompts, as obtained by Dynamic Sampling, is proposed, which ensures that, when Dynamic Sampling is used, these hard-to-sample responses can be effectively capitalized on, implying higher training efficiency.

Abstract

Decoupled Clip and Dynamic Sampling Policy Optimization (DAPO) is a prominent variant of Group Relative Policy Optimization (GRPO). DAPO introduces several improvements over GRPO. Among these, Dynamic Sampling contributes the most to DAPO's accuracy gains relative to GRPO. To improve accuracy, Dynamic Sampling enhances training stability by eliminating zero policy gradients from zero advantages. Specifically, it avoids such zero gradients by filtering out prompts where sampled responses are either entirely correct or incorrect. However, our theoretical analysis shows that Dynamic Sampling decrease training efficiency as it cannot effectively utilize hard-to-sample correct responses on hard prompts. Formally, it asymmetrically amplifies the advantages of distinct responses to the same prompts. On hard prompts, incorrect responses undergo greater amplification than correct ones. This leads the model to avoid generating the observed incorrect responses rather than capitalizing on the hard-to-sample correct ones on hard prompts, resulting in low training efficiency. To improve training efficiency, we propose Direct Advantage Amplification (DAA), which amplifies the advantages of hard-to-sample correct responses on hard prompts, as obtained by Dynamic Sampling. This ensures that, when Dynamic Sampling is used, these hard-to-sample responses can be effectively capitalized on, implying higher training efficiency. By integrating DAA into DAPO, we obtain Difficulty-aware Advantage Amplification Policy Optimization (DA3PO), which is implemented with fewer than 30 lines of code from DAPO. Experiments show that DA3PO significantly outperforms GRPO and other classical GRPO variants.

View source

Similar papers

#machine learning Preprint Aug 2026

Group Adaptive Clipping Policy Optimization

Group Adaptive Clipping Policy Optimization (GAPO), a plug-in modification to GRPO methods that adapts the clipping boundary to the rollout advantage, is proposed, motivated by a reverse-KL trust-region perspective, which suggests that rollouts with larger learning signal should receive proportionally greater update he...

Sheng Jia, Xiao Wang, S. Kasiviswanathan et al. · 0 citations
Preprint Aug 2026

Critic-Free Pretraining for Efficient Online Reinforcement Learning Fine-Tuning

Critic-Free Pretraining is introduced: an efficient paradigm that completely abandons the approach of offline critic training, allowing a freshly initialized critic to adapt without inheriting biased estimates.

Daoyi Li, Yi-Xian Zhang, Wen-Bo Ding et al. · 0 citations
Preprint Aug 2026

SoftmaxGRPO: Learning to Reason using Softmax Advantage Group Estimation

Softmax Advantage Group Estimation (SoftmaxGRPO), a drop-in alternative that replaces z-score-normalized group advantages with temperature-scaled softmax advantages, keeping weights bounded regardless of prompt difficulty, is introduced.

Jefferson Hernandez, Jaywon Koo, Zi-Lin Xiao et al. · 0 citations
#artificial intelligence Preprint Sep 2026

GVPO++: Group Variance Policy Optimization for LLM Post-Training and On-Policy Distillation

Group Variance Policy Optimization is introduced, a novel post-training method that integrates the analytical solution of KL-constrained reward maximization into its gradient weighting scheme and establishes a new paradigm for reliable and versatile LLM post-training and on-policy distillation.

Kai-Chen Zhang, Yuzhong Hong, Jun-Wei Bao et al. · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.