Online Learning to Sample
arXiv:1506.09016
Abstract
Stochastic Gradient Descent (SGD) is one of the most widely used techniques for online optimization in machine learning. In this work, we accelerate SGD by adaptively learning how to sample the most useful training examples at each time step. First, we show that SGD can be used to learn the best possible sampling distribution of an importance sampling estimator. Second, we show that the sampling distribution of an SGD algorithm can be estimated online by incrementally minimizing the variance of the gradient. The resulting algorithm - called Adaptive Weighted SGD (AW-SGD) - maintains a set of parameters to optimize, as well as a set of parameters to sample learning examples. We show that AWSGD yields faster convergence in three different applications: (i) image classification with deep features, where the sampling of images depends on their labels, (ii) matrix factorization, where rows and columns are not sampled uniformly, and (iii) reinforcement learning, where the optimized and exploration policies are estimated at the same time, where our approach corresponds to an off-policy gradient algorithm.
Update: removed convergence theorem and proof as there is an error. Submitted to UAI 2016
References in corpus (2)
Cited by in corpus (10)
- Big Batch SGD: Automated Inference using Adaptive Batch Sizes
- Overdispersed Black-Box Variational Inference
- Federated Transfer Learning with Dynamic Gradient Aggregation
- Trading-off variance and complexity in stochastic gradient descent
- Online Deep Learning: Growing RBM on the fly
- Online Variance Reduction for Stochastic Optimization
- Adaptive Sampling Distributed Stochastic Variance Reduced Gradient for Heterogeneous Distributed Datasets
- Stochastic Reweighted Gradient Descent
- Adaptive Importance Sampling meets Mirror Descent: a Bias-variance tradeoff
- Dynamic Gradient Aggregation for Federated Domain Adaptation