Early Memory Selection for Balanced Adam
cs.LG, cs.AI, stat.ML
Submitted: 2026-10-06
Updated: 2026-10-06
Comments: Includes theoretical proofs and reproducibility appendices. Code and data: https://github.com/AlbertoFdezHdez/Adam_beta_rule_cubic
Code: https://github.com/AlbertoFdezHdez/Adam_beta_rule_cubic
License: http://creativecommons.org/licenses/by/4.0/
The gist: We propose a method for choosing the shared memory parameter β 1=β 2=β in Adam from a short pilot training.
Terminology
Abstract
We propose a method for choosing the shared memory parameter β 1=β 2=β in Adam from a short pilot training. The selected β remains fixed during the subsequent full training. A local model of Adam's normalized direction balances sampling variability against the delay introduced by averaging past gradients. This balance gives a cubic memory rule, whose two coefficients are estimated from gradient probes at a few pilot checkpoints. The estimator uses the numerator and denominator jointly, preserving their covariance. With a 200-update pilot and sixteen probe gradients at each of four checkpoints, a seed-matched retrospective evaluation on eleven vision and language workloads reduces mean relative validation gap by 40.7% and worst-quarter mean gap by 44.3% against the grid representative of shared β=0.95. The mean gap is also 32.3% lower than that of the best constant β chosen across all eleven workloads.
Sources
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks