strongly convex

How Good is SGD with Random Shuffling? COLT 2020 Hybrid Stochastic-Deterministic Minibatch Proximal Gradient: Less-Than-Single-Pass Optimization with Nearly Optimal Generalization ICML 2020 IDEAL: Inexact DEcentralized Accelerated Augmented Lagrangian Method NeurIPS 2020 Locally Accelerated Conditional Gradients AISTATS 2020 Obtaining Adjustable Regularization for Free via Iterate Averaging ICML 2020 On the Convergence of SARAH and Beyond AISTATS 2020 Optimal and Practical Algorithms for Smooth and Strongly Convex Decentralized Optimization NeurIPS 2020 Random Reshuffling: Simple Analysis with Vast Improvements NeurIPS 2020 Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clipping NeurIPS 2020 Accelerated Decentralized Optimization with Local Updates for Smooth and Strongly Convex Objectives AISTATS 2019 Accelerated Incremental Gradient Descent using Momentum Acceleration with Scaling Factor IJCAI 2019 Adaptive and Safe Bayesian Optimization in High Dimensions via One-Dimensional Subspaces ICML 2019 A Generic Acceleration Framework for Stochastic Composite Optimization NeurIPS 2019 A Universally Optimal Multistage Accelerated Stochastic Gradient Method NeurIPS 2019 Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization NeurIPS 2019 Communication-Efficient Distributed Learning via Lazily Aggregated Quantized Gradients NeurIPS 2019 Efficient Algorithms for Smooth Minimax Optimization NeurIPS 2019 On the Curved Geometry of Accelerated Optimization NeurIPS 2019 Projection onto Minkowski Sums with Application to Constrained Learning ICML 2019 SGD without Replacement: Sharper Rates for General Smooth Convex Functions ICML 2019 Stochastic Variance Reduced Primal Dual Algorithms for Empirical Composition Optimization NeurIPS 2019 Tight analyses for non-smooth stochastic gradient descent COLT 2019 A Simple Stochastic Variance Reduced Algorithm with Fast Convergence Rates ICML 2018 Efficient online algorithms for fast-rate regret bounds under sparsity NeurIPS 2018 On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization JMLR 2018