← Keywords

stochastic optimization

1060 papers

Explore in graph

Also known as

SO SVRG SSO SGD

Co-occurring keywords

regret bound (1918) online learning (1770) variance reduction (520) multi-armed bandit (1091) convex optimization (1320) convergence rate (606) non-convex optimization (546) stochastic gradient descent (1088) gradient descent (1143) nonconvex optimization (316)

Papers

An Even More Optimal Stochastic Optimization Algorithm: Minibatching and Interpolation Learning NIPS 2021
Learning Complexity of Simulated Annealing AISTATS 2021
Sample Efficient Decentralized Stochastic Frank-Wolfe Methods for Continuous DR-Submodular Maximization IJCAI 2021
On Optimal Robustness to Adversarial Corruption in Online Decision Problems NIPS 2021
Differentiable Quality Diversity NIPS 2021
Fast margin maximization via dual acceleration ICML 2021
Generalization Bounds for Stochastic Saddle Point Problems AISTATS 2021
Online Graph Dictionary Learning ICML 2021
Information-constrained optimization: can adaptive processing of gradients help? NIPS 2021
An Online Method for A Class of Distributionally Robust Optimization with Non-convex Objectives NIPS 2021
Stochastic Iterative Graph Matching ICML 2021
Approximate Newton Methods JMLR 2021
Tight sampling and discarding bounds for scenario programs with an arbitrary number of removed samples L4DC 2021
Stochastic Proximal Methods for Non-Smooth Non-Convex Constrained Sparse Optimization JMLR 2021
Private Stochastic Non-convex Optimization with Improved Utility Rates IJCAI 2021
ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learning AAAI 2021
Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization NIPS 2021
On the Bias-Variance-Cost Tradeoff of Stochastic Optimization NIPS 2021
Efficient debiased evidence estimation by multilevel Monte Carlo sampling UAI 2021
Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex Optimization NIPS 2021
Stochastic bandits with groups of similar arms. NIPS 2021
A Regression Approach to Learning-Augmented Online Algorithms NIPS 2021
Three Operator Splitting with a Nonconvex Loss Function ICML 2021
Stochastic optimization under time drift: iterate averaging, step-decay schedules, and high probability guarantees NIPS 2021
Convergence of adaptive algorithms for constrained weakly convex optimization NIPS 2021