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. 1902.04686
  4. Cited By
The Complexity of Making the Gradient Small in Stochastic Convex
  Optimization

The Complexity of Making the Gradient Small in Stochastic Convex Optimization

13 February 2019
Dylan J. Foster
Ayush Sekhari
Ohad Shamir
Nathan Srebro
Karthik Sridharan
Blake E. Woodworth
ArXivPDFHTML

Papers citing "The Complexity of Making the Gradient Small in Stochastic Convex Optimization"

12 / 12 papers shown
Title
Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance
Convergence Guarantees for RMSProp and Adam in Generalized-smooth Non-convex Optimization with Affine Noise Variance
Qi Zhang
Yi Zhou
Shaofeng Zou
42
4
0
01 Apr 2024
Stochastic Halpern iteration in normed spaces and applications to reinforcement learning
Stochastic Halpern iteration in normed spaces and applications to reinforcement learning
Mario Bravo
Juan Pablo Contreras
48
3
0
19 Mar 2024
Lower Bounds and Accelerated Algorithms in Distributed Stochastic Optimization with Communication Compression
Lower Bounds and Accelerated Algorithms in Distributed Stochastic Optimization with Communication Compression
Yutong He
Xinmeng Huang
Yiming Chen
W. Yin
Kun Yuan
36
7
0
12 May 2023
Two Losses Are Better Than One: Faster Optimization Using a Cheaper
  Proxy
Two Losses Are Better Than One: Faster Optimization Using a Cheaper Proxy
Blake E. Woodworth
Konstantin Mishchenko
Francis R. Bach
47
6
0
07 Feb 2023
Smooth Monotone Stochastic Variational Inequalities and Saddle Point
  Problems: A Survey
Smooth Monotone Stochastic Variational Inequalities and Saddle Point Problems: A Survey
Aleksandr Beznosikov
Boris Polyak
Eduard A. Gorbunov
D. Kovalev
Alexander Gasnikov
44
31
0
29 Aug 2022
The Complexity of Nonconvex-Strongly-Concave Minimax Optimization
The Complexity of Nonconvex-Strongly-Concave Minimax Optimization
Siqi Zhang
Junchi Yang
Cristóbal Guzmán
Negar Kiyavash
Niao He
35
61
0
29 Mar 2021
Second-Order Information in Non-Convex Stochastic Optimization: Power
  and Limitations
Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitations
Yossi Arjevani
Y. Carmon
John C. Duchi
Dylan J. Foster
Ayush Sekhari
Karthik Sridharan
90
53
0
24 Jun 2020
Optimal Complexity in Decentralized Training
Optimal Complexity in Decentralized Training
Yucheng Lu
Christopher De Sa
38
72
0
15 Jun 2020
The Complexity of Finding Stationary Points with Stochastic Gradient
  Descent
The Complexity of Finding Stationary Points with Stochastic Gradient Descent
Yoel Drori
Shigehito Shimizu
28
64
0
04 Oct 2019
A Hybrid Stochastic Optimization Framework for Stochastic Composite
  Nonconvex Optimization
A Hybrid Stochastic Optimization Framework for Stochastic Composite Nonconvex Optimization
Quoc Tran-Dinh
Nhan H. Pham
T. Dzung
Lam M. Nguyen
27
49
0
08 Jul 2019
Accelerate Stochastic Subgradient Method by Leveraging Local Growth
  Condition
Accelerate Stochastic Subgradient Method by Leveraging Local Growth Condition
Yi Tian Xu
Qihang Lin
Tianbao Yang
28
11
0
04 Jul 2016
Optimal Distributed Online Prediction using Mini-Batches
Optimal Distributed Online Prediction using Mini-Batches
O. Dekel
Ran Gilad-Bachrach
Ohad Shamir
Lin Xiao
182
683
0
07 Dec 2010
1