Gradient-Momentum Coupling: A Parameter-Space Proxy for Learning Progress
Not on the map. Why?
Abstract (arXiv)
Measuring learning progress is at the core of curiosity-driven exploration, which rewards an agent for going where its model is still learning. However, the abstract notion of learning progress is not directly measurable, and existing methods often derive it from the prediction error in the output space. This paper proposes Gradient-Momentum Coupling (GMC), which measures how strongly a sample drives change in the parameter space, given by the normalized absolute product of its gradient with the momentum of previous gradients. Directions of change that persist across samples accumulate in momentum, while noise cancels out. In controlled experiments GMC allocates near uniform priority across tasks with varying levels of noise, where prediction error chases the noisiest, and orders learnable tasks by improvement speed rather than difficulty. On four MiniGrid MultiRoom tasks, substituting GMC for prediction error inside the Intrinsic Curiosity Module (ICM) recovers exploration ICM loses to unpredictable observations.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 41 references that are in the map. First posted on arXiv 7 May 2026.
Builds on
25 of 41 references.
References · 25
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2017What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?cited by 2,335
- 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 1,916
- 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2017Hindsight Experience Replaycited by 1,096
- 2018Exploration by Random Network Distillationcited by 966
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 599
- 2016Deep Exploration via Bootstrapped DQNcited by 518
- 2018Not All Samples Are Created Equal: Deep Learning with Importance Samplingcited by 323
13 more
- 2023Minigrid & Miniworld: Modular & Customizable Reinforcement Learning Environments for Goal-Oriented Taskscited by 320
- 2018Large-Scale Study of Curiosity-Driven Learningcited by 277
- 2019Self-Supervised Exploration via Disagreementcited by 263
- 2017Count-Based Exploration with Neural Density Modelscited by 255
- 2020Never Give Up: Learning Directed Exploration Strategiescited by 210
- 2019Go-Explore: a New Approach for Hard-Exploration Problemscited by 207
- 2017Teacher-Student Curriculum Learningcited by 197
- 2019Skew-Fit: State-Covering Self-Supervised Reinforcement Learningcited by 171
- 2014Stochastic Optimization with Importance Samplingcited by 91
- 2023Empirical Design in Reinforcement Learningcited by 54
- 2025CurES: From Gradient Analysis to Efficient Curriculum Learning for Reasoning LLMscited by 16
- 2022Agent-Controller Representations: Principled Offline RL with Rich Exogenous Informationcited by 15
- 2025Beyond Noisy-TVs: Noise-Robust Exploration Via Learning Progress Monitoringcited by 1
Built on by
Not cited yet.