Non-strongly-convex smooth stochastic approximation with convergence rate O(1/n)

Abstract

We consider the stochastic approximation problem where a convex function has to be minimized, given only the knowledge of unbiased estimates of its gradients at certain points, a framework which includes machine learning methods based on the minimization of the empirical risk. We focus on problems without strong convexity, for which all previously known… (More)

9 Figures and Tables

Topics

  • Blog articles referencing this paper

  • Presentations referencing similar topics