The reviewed record of science sign in
Pith

arxiv: 2409.15314 · v1 · pith:EJ52X3RJ · submitted 2024-09-05 · cs.LG

Reducing Bias in Deep Learning Optimization: The RSGDM Approach

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:EJ52X3RJrecord.jsonopen to challenge →

classification cs.LG
keywords algorithmlearningrsgdmsgdmbiasexponentialgradientmoving
0
0 comments X
read the original abstract

Currently, widely used first-order deep learning optimizers include non-adaptive learning rate optimizers and adaptive learning rate optimizers. The former is represented by SGDM (Stochastic Gradient Descent with Momentum), while the latter is represented by Adam. Both of these methods use exponential moving averages to estimate the overall gradient. However, estimating the overall gradient using exponential moving averages is biased and has a lag. This paper proposes an RSGDM algorithm based on differential correction. Our contributions are mainly threefold: 1) Analyze the bias and lag brought by the exponential moving average in the SGDM algorithm. 2) Use the differential estimation term to correct the bias and lag in the SGDM algorithm, proposing the RSGDM algorithm. 3) Experiments on the CIFAR datasets have proven that our RSGDM algorithm is superior to the SGDM algorithm in terms of convergence accuracy.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.