Pages that link to "Item:Q1983178"
From MaRDI portal
The following pages link to Stochastic gradient descent with Polyak's learning rate (Q1983178):
Displaying 19 items.
- Convergence of stochastic gradient descent in deep neural network (Q2025203) (← links)
- Stopping criteria for, and strong convergence of, stochastic gradient descent on Bottou-Curtis-Nocedal functions (Q2089787) (← links)
- An adaptive Polyak heavy-ball method (Q2102380) (← links)
- Laplacian smoothing gradient descent (Q2168883) (← links)
- Why random reshuffling beats stochastic gradient descent (Q2227529) (← links)
- Accelerating deep neural network training with inconsistent stochastic gradient descent (Q2292210) (← links)
- Lower error bounds for the stochastic gradient descent optimization algorithm: sharp convergence rates for slowly and fast decaying learning rates (Q2303416) (← links)
- On the linear convergence of the stochastic gradient method with constant step-size (Q2311205) (← links)
- Learning rate adaptation in stochastic gradient descent. (Q2768062) (← links)
- (Q5054606) (← links)
- Scheduled Restart Momentum for Accelerated Stochastic Gradient Descent (Q5094616) (← links)
- The Stochastic Delta Rule: Faster and More Accurate Deep Learning Through Adaptive Weight Noise (Q5131130) (← links)
- Stability and optimization error of stochastic gradient descent for pairwise learning (Q5132230) (← links)
- An Adaptive Gradient Method with Energy and Momentum (Q5865911) (← links)
- Adaptive moment estimation for universal portfolio selection strategy (Q6088522) (← links)
- A novel stepsize for gradient descent method (Q6564290) (← links)
- Greedy randomized sampling nonlinear Kaczmarz methods (Q6566100) (← links)
- The accelerated tensor Kaczmarz algorithm with adaptive parameters for solving tensor systems (Q6577586) (← links)
- Polyak minorant method for convex optimization (Q6655787) (← links)
