Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
1901.11224
Cited By
Lower Bounds for Smooth Nonconvex Finite-Sum Optimization
International Conference on Machine Learning (ICML), 2019
31 January 2019
Dongruo Zhou
Quanquan Gu
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Lower Bounds for Smooth Nonconvex Finite-Sum Optimization"
25 / 25 papers shown
Variance Reduction Methods Do Not Need to Compute Full Gradients: Improved Efficiency through Shuffling
Daniil Medyakov
Gleb Molodtsov
S. Chezhegov
Alexey Rebrikov
Aleksandr Beznosikov
432
1
0
20 Feb 2025
On the Complexity of First-Order Methods in Stochastic Bilevel Optimization
International Conference on Machine Learning (ICML), 2024
Jeongyeol Kwon
Dohyun Kwon
Hanbaek Lyu
245
14
0
11 Feb 2024
On the Complexity of Finite-Sum Smooth Optimization under the Polyak-Łojasiewicz Condition
Yunyan Bai
Yuxing Liu
Luo Luo
196
1
0
04 Feb 2024
Lower Bounds and Accelerated Algorithms in Distributed Stochastic Optimization with Communication Compression
Yutong He
Xinmeng Huang
Yiming Chen
W. Yin
Kun Yuan
405
11
0
12 May 2023
Stochastic Distributed Optimization under Average Second-order Similarity: Algorithms and Analysis
Neural Information Processing Systems (NeurIPS), 2023
Dachao Lin
Yuze Han
Haishan Ye
Zhihua Zhang
305
15
0
15 Apr 2023
A Lower Bound and a Near-Optimal Algorithm for Bilevel Empirical Risk Minimization
International Conference on Artificial Intelligence and Statistics (AISTATS), 2023
Mathieu Dagréou
Thomas Moreau
Samuel Vaiter
Pierre Ablin
285
17
0
17 Feb 2023
Lower Bounds and Nearly Optimal Algorithms in Distributed Learning with Communication Compression
Neural Information Processing Systems (NeurIPS), 2022
Xinmeng Huang
Yiming Chen
W. Yin
Kun Yuan
364
37
0
08 Jun 2022
Distributionally Robust Optimization via Ball Oracle Acceleration
Neural Information Processing Systems (NeurIPS), 2022
Y. Carmon
Danielle Hausler
162
14
0
24 Mar 2022
Experimental Evaluation of Computational Complexity for Different Neural Network Equalizers in Optical Communications
Pedro J. Freire
Yevhenii Osadchuk
A. Napoli
B. Spinnler
W. Schairer
N. Costa
Jaroslaw E. Prilepsky
S. Turitsyn
103
1
0
17 Sep 2021
Near Optimal Stochastic Algorithms for Finite-Sum Unbalanced Convex-Concave Minimax Optimization
Luo Luo
Guangzeng Xie
Tong Zhang
Zhihua Zhang
199
20
0
03 Jun 2021
The Complexity of Nonconvex-Strongly-Concave Minimax Optimization
Conference on Uncertainty in Artificial Intelligence (UAI), 2021
Siqi Zhang
Junchi Yang
Cristóbal Guzmán
Negar Kiyavash
Niao He
209
66
0
29 Mar 2021
On the Oracle Complexity of Higher-Order Smooth Non-Convex Finite-Sum Optimization
International Conference on Artificial Intelligence and Statistics (AISTATS), 2021
N. Emmenegger
Rasmus Kyng
Ahad N. Zehmakan
204
2
0
08 Mar 2021
Stability of SGD: Tightness Analysis and Improved Bounds
Conference on Uncertainty in Artificial Intelligence (UAI), 2021
Yikai Zhang
Wenjia Zhang
Sammy Bald
Vamsi Pingali
Chao Chen
Mayank Goswami
MLT
152
40
0
10 Feb 2021
Recent Theoretical Advances in Non-Convex Optimization
Marina Danilova
Pavel Dvurechensky
Alexander Gasnikov
Eduard A. Gorbunov
Sergey Guminov
Dmitry Kamzolov
Innokentiy Shibaev
347
104
0
11 Dec 2020
Tight Lower Complexity Bounds for Strongly Convex Finite-Sum Optimization
Min Zhang
Yao Shu
Kun He
129
1
0
17 Oct 2020
Variance-Reduced Methods for Machine Learning
Proceedings of the IEEE (Proc. IEEE), 2020
Robert Mansel Gower
Mark Schmidt
Francis R. Bach
Peter Richtárik
279
146
0
02 Oct 2020
PAGE: A Simple and Optimal Probabilistic Gradient Estimator for Nonconvex Optimization
International Conference on Machine Learning (ICML), 2020
Zhize Li
Hongyan Bao
Xiangliang Zhang
Peter Richtárik
ODL
339
153
0
25 Aug 2020
Fast decentralized non-convex finite-sum optimization with recursive variance reduction
Ran Xin
U. Khan
S. Kar
440
47
0
17 Aug 2020
Optimal Complexity in Decentralized Training
International Conference on Machine Learning (ICML), 2020
Yucheng Lu
Christopher De Sa
455
92
0
15 Jun 2020
Adaptivity of Stochastic Gradient Methods for Nonconvex Optimization
SIAM Journal on Mathematics of Data Science (SIMODS), 2020
Samuel Horváth
Lihua Lei
Peter Richtárik
Sai Li
189
35
0
13 Feb 2020
Lower Bounds for Non-Convex Stochastic Optimization
Mathematical programming (Math. Program.), 2019
Yossi Arjevani
Y. Carmon
John C. Duchi
Dylan J. Foster
Nathan Srebro
Blake E. Woodworth
632
408
0
05 Dec 2019
A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization
Guangzeng Xie
Luo Luo
Zhihua Zhang
176
4
0
22 Aug 2019
A Hybrid Stochastic Optimization Framework for Stochastic Composite Nonconvex Optimization
Mathematical programming (Math. Program.), 2019
Quoc Tran-Dinh
Nhan H. Pham
T. Dzung
Lam M. Nguyen
243
63
0
08 Jul 2019
ProxSARAH: An Efficient Algorithmic Framework for Stochastic Composite Nonconvex Optimization
Nhan H. Pham
Lam M. Nguyen
Dzung Phan
Quoc Tran-Dinh
226
153
0
15 Feb 2019
Stochastic Nested Variance Reduction for Nonconvex Optimization
Dongruo Zhou
Pan Xu
Quanquan Gu
253
158
0
20 Jun 2018
1
