When Does Momentum Help in Reinforcement Learning with Verifiable Rewards?
Yet recent empirical work has questioned the usefulness of first-moment momentum in reinforcement learning with verifiable rewards (RLVR).
ProofPaper ↗
Key points
- Momentum is a classical tool for accelerating convex optimization and a standard component of modern large language model training.
- We study this question through a bandit formulation of RLVR with bias-corrected exponential moving average (EMA) momentum, where the EMA coefficient $β$ controls how quickly the weights on past gradients decay.
- When policy gradients are evaluated exactly, we prove that increasing $β$ within a range that prevents overshoot strictly accelerates optimization.
- We show that as the learning rate $η$ decreases, the expected gain with fixed $β$ vanishes faster than these fluctuations, whereas increasing $β$ to keep $η/(1-β)$ within the safe regime preserves a nonvanishing gain that eventually dominates them.
Sources (1)
- [1]When Does Momentum Help in Reinforcement Learning with Verifiable Rewards?arXiv (AI, ML, NLP, CV, robotics, multi-agent) · Oct 14, 04:11 PM
Yet recent empirical work has questioned the usefulness of first-moment momentum in reinforcement learning with verifiable rewards (RLVR).
Momentum is a classical tool for accelerating convex optimization and a standard component of modern large language model training.
Extractive summary: sentences quoted from the sources.
Before this
- Oct 14, 2026Player-1: Learning to Play from Synthetic Experience
- Oct 14, 2026The Design Space of Tri-Modal Masked Diffusion Models
- Oct 13, 2026Two Clocks: Why Larger Rollout Batches Learn Slower but Fail on Schedule in Reinforcement Learning with Verifiable Rewards
- Oct 13, 2026Run fast, private agents on-device with LFM2.5-24B-A2B
- Oct 13, 2026Gemini 4 Argon: Built to solve your hardest problems
- Oct 13, 2026black-forest-labs/flux-3-image-klein-comfy