← 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

Near-Optimal Policies for Dynamic Multinomial Logit Assortment Selection Models NIPS 2018
Contextual Bandits with Stochastic Experts AISTATS 2018
Bandits with Delayed, Aggregated Anonymous Feedback ICML 2018
Differentially Private Contextual Linear Bandits NIPS 2018
Zeroth-Order Stochastic Variance Reduction for Nonconvex Optimization NIPS 2018
Zeroth-Order Online Alternating Direction Method of Multipliers: Convergence Analysis and Applications AISTATS 2018
Online Adaptive Methods, Universality and Acceleration NIPS 2018
Stochastic Expectation Maximization with Variance Reduction NIPS 2018
Shampoo: Preconditioned Stochastic Tensor Optimization ICML 2018
Third-order Smoothness Helps: Faster Stochastic Optimization Algorithms for Finding Local Minima NIPS 2018
Profitable Bandits ACML 2018
Efficient Online Portfolio with Logarithmic Regret NIPS 2018
Methods for off-line/on-line optimization under uncertainty IJCAI 2018
Online convex optimization for cumulative constraints NIPS 2018
Adaptive Methods for Nonconvex Optimization NIPS 2018
A PID Controller Approach for Stochastic Optimization of Deep Networks CVPR 2018
Stochastic Fractional Hamiltonian Monte Carlo IJCAI 2018
Horizon-Independent Minimax Linear Regression NIPS 2018
Asynchronous Doubly Stochastic Group Regularized Learning AISTATS 2018
Adaptation to Easy Data in Prediction with Limited Advice NIPS 2018
Lightweight Stochastic Optimization for Minimizing Finite Sums with Infinite Data ICML 2018
Feature-correlation-aware Gaussian Process Latent Variable Model ACML 2018
Stochastic Second-Order Method for Large-Scale Nonconvex Sparse Learning Models IJCAI 2018
Efficient online algorithms for fast-rate regret bounds under sparsity NIPS 2018
SEGA: Variance Reduction via Gradient Sketching NIPS 2018