conftrace_

oracle complexity

65 papers

Explore in graph

Co-occurring keywords

stochastic optimization (1060) convex optimization (1321) variance reduction (523) nonconvex optimization (316) non-convex optimization (547) gradient descent (1144) lower bound (173) convergence rate (607) stationary point (44) stochastic gradient (296)

Papers

An Optimal Algorithm for Strongly Convex Minimization under Affine Constraints AISTATS 2022
SAPD+: An Accelerated Stochastic Method for Nonconvex-Concave Minimax Problems NIPS 2022
On Biased Stochastic Gradient Estimation JMLR 2022
Kill a Bird with Two Stones: Closing the Convergence Gaps in Non-Strongly Convex Optimization by Directly Accelerated SVRG with Double Compensation and Snapshots ICML 2022
Smooth Convex Optimization Using Sub-Zeroth-Order Oracles AAAI 2021
Oracle Complexity in Nonsmooth Nonconvex Optimization NIPS 2021
A Hybrid Variance-Reduced Method for Decentralized Stochastic Non-Convex Optimization ICML 2021
On the Bias-Variance-Cost Tradeoff of Stochastic Optimization NIPS 2021
Approximate optimization of convex functions with outlier noise NIPS 2021
Near-Optimal Lower Bounds For Convex Optimization For All Orders of Smoothness NIPS 2021
Thinking Inside the Ball: Near-Optimal Minimization of the Maximal Loss COLT 2021
Stochastic Gauss-Newton Algorithms for Nonconvex Compositional Optimization ICML 2020
Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitations COLT 2020
Projection Efficient Subgradient Method and Optimal Nonsmooth Frank-Wolfe Method NIPS 2020
How to Trap a Gradient Flow COLT 2020
ProxSARAH: An Efficient Algorithmic Framework for Stochastic Composite Nonconvex Optimization JMLR 2020
Acceleration with a Ball Optimization Oracle NIPS 2020
Hybrid Variance-Reduced SGD Algorithms For Minimax Problems with Nonconvex-Linear Function NIPS 2020
Lower Bounds for Parallel and Randomized Convex Optimization JMLR 2020
Variance Reduced Coordinate Descent with Acceleration: New Method With a Surprising Application to Finite-Sum Problems ICML 2020
Highly smooth minimization of non-smooth problems COLT 2020
Lower Bounds for Parallel and Randomized Convex Optimization COLT 2019
Accelerated Incremental Gradient Descent using Momentum Acceleration with Scaling Factor IJCAI 2019
The Complexity of Making the Gradient Small in Stochastic Convex Optimization COLT 2019
Open Problem: The Oracle Complexity of Convex Optimization with Limited Memory COLT 2019