ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1709.03342
  4. Cited By
Optimal non-asymptotic bound of the Ruppert-Polyak averaging without
  strong convexity

Optimal non-asymptotic bound of the Ruppert-Polyak averaging without strong convexity

11 September 2017
S. Gadat
Fabien Panloup
ArXiv (abs)PDFHTML

Papers citing "Optimal non-asymptotic bound of the Ruppert-Polyak averaging without strong convexity"

7 / 7 papers shown
Title
Online estimation of the inverse of the Hessian for stochastic optimization with application to universal stochastic Newton algorithms
Online estimation of the inverse of the Hessian for stochastic optimization with application to universal stochastic Newton algorithms
Antoine Godichon-Baggioni
Wei Lu
Bruno Portier
110
1
0
15 Jan 2024
Stochastic Heavy Ball
Stochastic Heavy Ball
S. Gadat
Fabien Panloup
Sofiane Saadane
104
104
0
14 Sep 2016
From Averaging to Acceleration, There is Only a Step-size
From Averaging to Acceleration, There is Only a Step-size
Nicolas Flammarion
Francis R. Bach
94
139
0
07 Apr 2015
Online estimation of the geometric median in Hilbert spaces : non
  asymptotic confidence balls
Online estimation of the geometric median in Hilbert spaces : non asymptotic confidence balls
H. Cardot
P. Cénac
Antoine Godichon
119
55
0
27 Jan 2015
Adaptivity of averaged stochastic gradient descent to local strong
  convexity for logistic regression
Adaptivity of averaged stochastic gradient descent to local strong convexity for logistic regression
Francis R. Bach
96
165
0
25 Mar 2013
Efficient and fast estimation of the geometric median in Hilbert spaces
  with an averaged stochastic gradient algorithm
Efficient and fast estimation of the geometric median in Hilbert spaces with an averaged stochastic gradient algorithm
H. Cardot
P. Cénac
P. Zitt
81
123
0
22 Jan 2011
Information-theoretic lower bounds on the oracle complexity of
  stochastic convex optimization
Information-theoretic lower bounds on the oracle complexity of stochastic convex optimization
Alekh Agarwal
Peter L. Bartlett
Pradeep Ravikumar
Martin J. Wainwright
202
251
0
03 Sep 2010
1