Accelerated and nonaccelerated stochastic gradient descent with model conception
From MaRDI portal
Publication:6332633
Abstract: In this paper, we describe a new way to get convergence rates for optimal methods in smooth (strongly) convex optimization tasks. Our approach is based on results for tasks where gradients have nonrandom small noises. Unlike previous results, we obtain convergence rates with model conception.
This page was built for publication: Accelerated and nonaccelerated stochastic gradient descent with model conception
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6332633)
