conftrace_

strongly convex

89 papers

Explore in graph

Co-occurring keywords

convex optimization (1321) stochastic optimization (1060) stochastic gradient descent (1091) regret bound (1926) convergence rate (607) variance reduction (523) online convex optimization (165) online learning (1777) strong convexity (59) gradient descent (1144)

Papers

Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints ICML 2021
Stability and Deviation Optimal Risk Bounds with Convergence Rate $O(1/n)$ NIPS 2021
From Low Probability to High Confidence in Stochastic Convex Optimization JMLR 2021
The Lazy Online Subgradient Algorithm is Universal on Strongly Convex Domains NIPS 2021
A Class of Parallel Doubly Stochastic Algorithms for Large-Scale Learning JMLR 2020
Random Reshuffling: Simple Analysis with Vast Improvements NIPS 2020
How Good is SGD with Random Shuffling? COLT 2020
Locally Accelerated Conditional Gradients AISTATS 2020
Hybrid Stochastic-Deterministic Minibatch Proximal Gradient: Less-Than-Single-Pass Optimization with Nearly Optimal Generalization ICML 2020
An Improved Analysis of Stochastic Gradient Descent with Momentum NIPS 2020
Optimal and Practical Algorithms for Smooth and Strongly Convex Decentralized Optimization NIPS 2020
Exploiting Higher Order Smoothness in Derivative-free Optimization and Continuous Bandits NIPS 2020
High probability guarantees for stochastic convex optimization COLT 2020
Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clipping NIPS 2020
IDEAL: Inexact DEcentralized Accelerated Augmented Lagrangian Method NIPS 2020
On the Convergence of SARAH and Beyond AISTATS 2020
Obtaining Adjustable Regularization for Free via Iterate Averaging ICML 2020
Adapting to Smoothness: A More Universal Algorithm for Online Convex Optimization AAAI 2020
Stochastic Variance Reduced Primal Dual Algorithms for Empirical Composition Optimization NIPS 2019
Adaptive and Safe Bayesian Optimization in High Dimensions via One-Dimensional Subspaces ICML 2019
On the Curved Geometry of Accelerated Optimization NIPS 2019
Communication-Efficient Distributed Learning via Lazily Aggregated Quantized Gradients NIPS 2019
Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization NIPS 2019
SGD without Replacement: Sharper Rates for General Smooth Convex Functions ICML 2019
Projection onto Minkowski Sums with Application to Constrained Learning ICML 2019