Pages that link to "Item:Q5214284"

The following pages link to New Convergence Aspects of Stochastic Gradient Algorithms (Q5214284):

Displaying 10 items.

• Performance analysis of stochastic gradient algorithms under weak conditions (Q948509) (← links)
• Stochastic gradient descent with Polyak's learning rate (Q1983178) (← links)
• Convergence of stochastic proximal gradient algorithm (Q2019902) (← links)
• A sharp convergence rate for a model equation of the asynchronous stochastic gradient descent (Q2057038) (← links)
• Finite-sum smooth optimization with SARAH (Q2149950) (← links)
• On the linear convergence of the stochastic gradient method with constant step-size (Q2311205) (← links)
• Strong error analysis for stochastic gradient descent optimization algorithms (Q4964091) (← links)
• A Convergence Study of SGD-Type Methods for Stochastic Optimization (Q6151338) (← links)
• Nonexpansive Markov operators and random function iterations for stochastic fixed point problems (Q6178237) (← links)
• Random-reshuffled SARAH does not need full gradient computations (Q6204201) (← links)