ResearchTrend.AI
Lower Bounds for Smooth Nonconvex Finite-Sum Optimization

Lower Bounds for Smooth Nonconvex Finite-Sum Optimization

Dongruo Zhou
Quanquan Gu
ArXivPDFHTML

Papers citing "Lower Bounds for Smooth Nonconvex Finite-Sum Optimization"

17 / 17 papers shown
Title
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
52
7
0
12 May 2023
SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator
SPIDER: Near-Optimal Non-Convex Optimization via Stochastic Path Integrated Differential Estimator
Cong Fang
C. J. Li
Zhouchen Lin
Tong Zhang
79
572
0
04 Jul 2018
Katyusha X: Practical Momentum Method for Stochastic Sum-of-Nonconvex Optimization
Katyusha X: Practical Momentum Method for Stochastic Sum-of-Nonconvex Optimization
Zeyuan Allen-Zhu
ODL
60
52
0
12 Feb 2018
Lower Bounds for Higher-Order Convex Optimization
Lower Bounds for Higher-Order Convex Optimization
Naman Agarwal
Elad Hazan
34
45
0
27 Oct 2017
Stochastic Optimization with Variance Reduction for Infinite Datasets with Finite-Sum Structure
Stochastic Optimization with Variance Reduction for Infinite Datasets with Finite-Sum Structure
A. Bietti
Julien Mairal
78
36
0
04 Oct 2016
LazySVD: Even Faster SVD Decomposition Yet Without Agonizing Pain
LazySVD: Even Faster SVD Decomposition Yet Without Agonizing Pain
Zeyuan Allen-Zhu
Yuanzhi Li
53
129
0
12 Jul 2016
Dimension-Free Iteration Complexity of Finite Sum Optimization Problems
Dimension-Free Iteration Complexity of Finite Sum Optimization Problems
Yossi Arjevani
Ohad Shamir
33
24
0
30 Jun 2016
Efficient Estimation of Partially Linear Models for Spatial Data over Complex Domain
Efficient Estimation of Partially Linear Models for Spatial Data over Complex Domain
Elad Hazan
Chi Jin
Cameron Musco
Praneeth Netrapalli
48
78
0
27 May 2016
Tight Complexity Bounds for Optimizing Composite Objectives
Tight Complexity Bounds for Optimizing Composite Objectives
Blake E. Woodworth
Nathan Srebro
109
185
0
25 May 2016
Katyusha: The First Direct Acceleration of Stochastic Gradient Methods
Katyusha: The First Direct Acceleration of Stochastic Gradient Methods
Zeyuan Allen-Zhu
ODL
85
580
0
18 Mar 2016
SDCA without Duality, Regularization, and Individual Convexity
SDCA without Duality, Regularization, and Individual Convexity
Shai Shalev-Shwartz
29
104
0
04 Feb 2016
An optimal randomized incremental gradient method
An optimal randomized incremental gradient method
Guanghui Lan
Yi Zhou
101
220
0
08 Jul 2015
SDCA without Duality
SDCA without Duality
Shai Shalev-Shwartz
39
47
0
22 Feb 2015
A Lower Bound for the Optimization of Finite Sums
A Lower Bound for the Optimization of Finite Sums
Alekh Agarwal
Léon Bottou
122
124
0
02 Oct 2014
SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives
SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives
Aaron Defazio
Francis R. Bach
Simon Lacoste-Julien
ODL
97
1,817
0
01 Jul 2014
A Proximal Stochastic Gradient Method with Progressive Variance Reduction
A Proximal Stochastic Gradient Method with Progressive Variance Reduction
Lin Xiao
Tong Zhang
ODL
138
738
0
19 Mar 2014
Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning
Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning
Julien Mairal
129
317
0
18 Feb 2014