← 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

Taming Fat-Tailed (“Heavier-Tailed” with Potentially Infinite Variance) Noise in Federated Learning NIPS 2022
Multi-block Min-max Bilevel Optimization with Applications in Multi-task Deep AUC Maximization NIPS 2022
Multiplicative Noise and Heavy Tails in Stochastic Optimization ICML 2021
Regret Minimization in Stochastic Non-Convex Learning via a Proximal-Gradient Approach ICML 2021
The Power of Adaptivity for Stochastic Submodular Cover ICML 2021
Bilevel Optimization: Convergence Analysis and Enhanced Design ICML 2021
Stochastic Online Optimization using Kalman Recursion JMLR 2021
A Unified Convergence Analysis for Shuffling-Type Gradient Methods JMLR 2021
Evaluating Meta-Reinforcement Learning through a HVAC Control Benchmark (Student Abstract) AAAI 2021
Stochastic bandits with groups of similar arms. NIPS 2021
Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization NIPS 2021
ACMo: Angle-Calibrated Moment Methods for Stochastic Optimization AAAI 2021
Predictive Job Scheduling under Uncertain Constraints in Cloud Computing IJCAI 2021
Beyond Variance Reduction: Understanding the True Impact of Baselines on Policy Optimization ICML 2021
On the Bias-Variance-Cost Tradeoff of Stochastic Optimization NIPS 2021
Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex Optimization NIPS 2021
Sample Efficient Decentralized Stochastic Frank-Wolfe Methods for Continuous DR-Submodular Maximization IJCAI 2021
ErrorCompensatedX: error compensation for variance reduced algorithms NIPS 2021
Differentially Private Stochastic Optimization: New Results in Convex and Non-Convex Settings NIPS 2021
Stochastic Bias-Reduced Gradient Methods NIPS 2021
SUPER-ADAM: Faster and Universal Framework of Adaptive Gradients NIPS 2021
High Probability Complexity Bounds for Line Search Based on Stochastic Oracles NIPS 2021
Stochastic optimization under time drift: iterate averaging, step-decay schedules, and high probability guarantees NIPS 2021
Stochastic Proximal Methods for Non-Smooth Non-Convex Constrained Sparse Optimization JMLR 2021
Problem Dependent View on Structured Thresholding Bandit Problems ICML 2021