On Higher-order Moments in Adam
Zhanhong Jiang, Aditya Balu, Sin Yong Tan, Young M Lee, Chinmay Hegde,, Soumik Sarkar

TL;DR
This paper introduces HAdam, an extension of Adam that incorporates higher-order moments of stochastic gradients, leading to improved performance in deep learning optimization.
Contribution
We propose HAdam, a novel optimizer utilizing higher-order moments of stochastic gradients, and analyze its empirical and theoretical advantages over Adam.
Findings
Higher-order moments improve optimization performance.
HAdam outperforms Adam in experiments.
Odd and even moments have distinct effects.
Abstract
In this paper, we investigate the popular deep learning optimization routine, Adam, from the perspective of statistical moments. While Adam is an adaptive lower-order moment based (of the stochastic gradient) method, we propose an extension namely, HAdam, which uses higher order moments of the stochastic gradient. Our analysis and experiments reveal that certain higher-order moments of the stochastic gradient are able to achieve better performance compared to the vanilla Adam algorithm. We also provide some analysis of HAdam related to odd and even moments to explain some intriguing and seemingly non-intuitive empirical results.
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.
Taxonomy
TopicsStochastic Gradient Optimization Techniques · Advanced Bandit Algorithms Research · Neural Networks and Applications
MethodsAdam
