Learning rate adaptation in stochastic gradient descent.
From MaRDI portal
Recommendations
- Stochastic gradient descent with Polyak's learning rate
- A class of asymptotically stable algorithms for learning-rate adaptation
- On the adaptivity of stochastic gradient-based optimization
- On stochastic accelerated gradient with convergence rate of regression learning
- Resolving learning rates adaptively by locating stochastic non-negative associated gradient projection points using line searches
- On stochastic accelerated gradient with convergence rate
- Convergence results on stochastic adaptive learning
- Efficient learning rate adaptation based on hierarchical optimization approach
Cited in
(12)- Backpropagation and stochastic gradient descent method
- Convergence acceleration of ensemble Kalman inversion in nonlinear settings
- scientific article; zbMATH DE number 1569106 (Why is no real title available?)
- A class of adaptive learning rate algorithms derived by one-dimensional subminimization methods
- scientific article; zbMATH DE number 7583836 (Why is no real title available?)
- An adaptive adjustment method of learning rate in logistic regression
- Resolving learning rates adaptively by locating stochastic non-negative associated gradient projection points using line searches
- Method of Real Time Calculation of Learning Rate Value to Improve Convergence of Neural Network Training
- scientific article; zbMATH DE number 1928655 (Why is no real title available?)
- scientific article; zbMATH DE number 1928683 (Why is no real title available?)
- Adaptive step size rules for stochastic optimization in large-scale learning
- Approximate greatest descent in neural network optimization
This page was built for publication: Learning rate adaptation in stochastic gradient descent.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768062)
