← 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

Stochastic Proximal AUC Maximization JMLR 2021
Approximate Newton Methods JMLR 2021
Stochastic Proximal Methods for Non-Smooth Non-Convex Constrained Sparse Optimization JMLR 2021
Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex Optimization NIPS 2021
On the Bias-Variance-Cost Tradeoff of Stochastic Optimization NIPS 2021
A Regression Approach to Learning-Augmented Online Algorithms NIPS 2021
On Optimal Robustness to Adversarial Corruption in Online Decision Problems NIPS 2021
Enhance Curvature Information by Structured Stochastic Quasi-Newton Methods CVPR 2021
Stochastic bandits with groups of similar arms. NIPS 2021
On the Verification of Neural ODEs with Stochastic Guarantees AAAI 2021
Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization NIPS 2021
Differentiable Quality Diversity NIPS 2021
Convergence of adaptive algorithms for constrained weakly convex optimization NIPS 2021
Fast margin maximization via dual acceleration ICML 2021
Nearest Neighbour Based Estimates of Gradients: Sharp Nonasymptotic Bounds and Applications AISTATS 2021
Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights NIPS 2021
Online Graph Dictionary Learning ICML 2021
Information-constrained optimization: can adaptive processing of gradients help? NIPS 2021
Stochastic Iterative Graph Matching ICML 2021
ErrorCompensatedX: error compensation for variance reduced algorithms NIPS 2021
Linear Bandits on Uniformly Convex Sets JMLR 2021
Dual-Mandate Patrols: Multi-Armed Bandits for Green Security AAAI 2021
An Even More Optimal Stochastic Optimization Algorithm: Minibatching and Interpolation Learning NIPS 2021
An Online Method for A Class of Distributionally Robust Optimization with Non-convex Objectives NIPS 2021
Asynchronous Stochastic Optimization Robust to Arbitrary Delays NIPS 2021