Beyond Variance: Prompt-Efficient RLVR via Rare-Event Amplification and Bidirectional Pairing
Yujuan Pang, Jiaxin Li, Xin Sheng, Ran Peng, Yong Ma

TL;DR
This paper introduces a novel prompt selection method for reinforcement learning with verifiable rewards, leveraging rare-event amplification and bidirectional pairing to enhance sample efficiency and transferability.
Contribution
It proposes positive--negative pairing and Weighted GRPO to improve prompt efficiency by providing both positive and negative learning signals from rare events.
Findings
Outperforms variance-based prompt selection heuristics on Qwen2.5-Math-7B.
Achieves higher Pass@8 and Pass@64 metrics with fewer prompts.
Maintains competitiveness with large-scale RLVR trained on many prompts.
Abstract
Reinforcement learning with verifiable rewards (RLVR) is effective for training large language models on deterministic outcome reasoning tasks. Prior work shows RLVR works with few prompts, but prompt selection is often based only on training-accuracy variance, leading to unstable optimization directions and weaker transfer. We revisit prompt selection from a mechanism-level view and argue that an effective minibatch should provide both (i) a reliable positive anchor and (ii) explicit negative learning signals from rare failures. Based on this principle, we propose \emph{positive--negative pairing}: at each update, we sample a hard-but-solvable and an easy-but-brittle prompt (high success rate but not perfect), characterized by low and high empirical success rates under multiple rollouts. We further introduce Weighted GRPO, which reweights binary outcomes at the pair…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
