oracle complexity

Stochastic Gauss-Newton Algorithms for Nonconvex Compositional Optimization ICML 2020 Variance Reduced Coordinate Descent with Acceleration: New Method With a Surprising Application to Finite-Sum Problems ICML 2020 Accelerated Incremental Gradient Descent using Momentum Acceleration with Scaling Factor IJCAI 2019 An Inexact Augmented Lagrangian Framework for Nonconvex Optimization with Nonlinear Constraints NeurIPS 2019 Direct Acceleration of SAGA using Sampled Negative Momentum AISTATS 2019 Lower Bounds for Parallel and Randomized Convex Optimization COLT 2019 Near Optimal Methods for Minimizing Convex Functions with Lipschitz p-th Derivatives COLT 2019 Open Problem: The Oracle Complexity of Convex Optimization with Limited Memory COLT 2019 Oracle-Efficient Algorithms for Online Linear Optimization with Bandit Feedback NeurIPS 2019 SpiderBoost and Momentum: Faster Variance Reduction Algorithms NeurIPS 2019 The Complexity of Making the Gradient Small in Stochastic Convex Optimization COLT 2019 ASVRG: Accelerated Proximal SVRG ACML 2018 Graph Oracle Models, Lower Bounds, and Gaps for Parallel Stochastic Optimization NeurIPS 2018 Natasha 2: Faster Non-Convex Optimization Than SGD NeurIPS 2018 The Edge Density Barrier: Computational-Statistical Tradeoffs in Combinatorial Inference ICML 2018 Efficient Online Linear Optimization with Approximation Algorithms NeurIPS 2017 Oracle Complexity of Second-Order Methods for Finite-Sum Problems ICML 2017 Minding the Gaps for Block Frank-Wolfe Optimization of Structured SVMs ICML 2016 Tight Complexity Bounds for Optimizing Composite Objectives NeurIPS 2016 Open Problem: The Oracle Complexity of Smooth Convex Optimization in Nonstandard Settings COLT 2015 Optimal rates for stochastic convex optimization under Tsybakov noise condition ICML 2013 Information-theoretic lower bounds on the oracle complexity of convex optimization NeurIPS 2009