← 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

Problem Dependent View on Structured Thresholding Bandit Problems ICML 2021
Dual-Mandate Patrols: Multi-Armed Bandits for Green Security AAAI 2021
Fast Learning for Renewal Optimization in Online Task Scheduling JMLR 2021
Achieving Near Instance-Optimality and Minimax-Optimality in Stochastic and Adversarial Linear Bandits Simultaneously ICML 2021
Adaptive Proximal Gradient Methods for Structured Neural Networks NIPS 2021
Stochastic Anderson Mixing for Nonconvex Stochastic Optimization NIPS 2021
An Inertial Newton Algorithm for Deep Learning JMLR 2021
Optimal Complexity in Decentralized Training ICML 2021
Training a Single Bandit Arm AISTATS 2021
Optimal Algorithms for Stochastic Contextual Preference Bandits NIPS 2021
Stochastic $L^\natural$-convex Function Minimization NIPS 2021
From Low Probability to High Confidence in Stochastic Convex Optimization JMLR 2021
Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights NIPS 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
ErrorCompensatedX: error compensation for variance reduced algorithms NIPS 2021
Stochastic Proximal Methods for Non-Smooth Non-Convex Constrained Sparse Optimization JMLR 2021
Stochastic bandits with groups of similar arms. NIPS 2021
PROMPT: Probabilistic Motion Primitives based Trajectory Planning RSS 2021
Stochastic Bias-Reduced Gradient Methods NIPS 2021
Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization NIPS 2021
An Even More Optimal Stochastic Optimization Algorithm: Minibatching and Interpolation Learning NIPS 2021
On Optimal Robustness to Adversarial Corruption in Online Decision Problems NIPS 2021
STEM: A Stochastic Two-Sided Momentum Algorithm Achieving Near-Optimal Sample and Communication Complexities for Federated Learning NIPS 2021
High-probability Bounds for Non-Convex Stochastic Optimization with Heavy Tails NIPS 2021