Fetching the paper…
Reading the bibliography…
Modern stochastic optimization methods often rely on uniform sampling which is agnostic to the underlying characteristics of the data.
On tail probabilities for martingales
D. A. Freedman · 1975
Earlier work this paper cites.
Convergence properties of the k-means algorithms
L. Bottou and Y. Bengio · 1995
Earlier work this paper cites.
Gradient-based learning applied to document recognition
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner · 1998
Earlier work this paper cites.
The nonstochastic multiarmed bandit problem
P. Auer, N. Cesa-Bianchi, Y. Freund, and R. E. Schapire · 2002
Earlier work this paper cites.
Smote: synthetic minority over-sampling technique
N. V. Chawla, K. W. Bowyer, L. O. Hall, and W. P. Kegelmeyer · 2002
Earlier work this paper cites.
On the generalization ability of on-line learning algorithms
N. Cesa-Bianchi, A. Conconi, and C. Gentile · 2004
Earlier work this paper cites.
Efficient algorithms for online decision problems
A. Kalai and S. Vempala · 2005
Earlier work this paper cites.
k-means++: The advantages of careful seeding
D. Arthur and S. Vassilvitskii · 2007
Earlier work this paper cites.
Competing in the dark: An efficient algorithm for bandit linear optimization
J. Abernethy, E. Hazan, and A. Rakhlin · 2008
Earlier work this paper cites.
On the generalization ability of online strongly convex programming algorithms
S. M. Kakade and A. Tewari · 2009
Earlier work this paper cites.
The pascal visual object classes (voc) challenge
M. Everingham, L. Van Gool, C. K. Williams, J. Winn, and A. Zisserman · 2010
Earlier work this paper cites.
Adaptive bound optimization for online convex optimization
H. B. McMahan and M. Streeter · 2010
Earlier work this paper cites.
Web-scale k-means clustering
D. Sculley · 2010
Cited alongside, same era.
Adaptive subgradient methods for online learning and stochastic optimization
J. Duchi, E. Hazan, and Y. Singer · 2011
Cited alongside, same era.
The next big one: Detecting earthquakes and other rare events from community-based sensors
M. Faulkner, M. Olson, R. Chandy, J. Krause, K. M. Chandy, and A. Krause · 2011
Cited alongside, same era.
A survey: The convex optimization approach to regret minimization
E. Hazan · 2011
Cited alongside, same era.
A random coordinate descent method on large optimization problems with linear constraints
I. Necoara, Y. Nesterov, and F. Glineur · 2011
Cited alongside, same era.
Efficiency of coordinate descent methods on huge-scale optimization problems
Y. Nesterov · 2012
Cited alongside, same era.
Very deep convolutional networks for large-scale image recognition
K. Simonyan and A. Zisserman · 2015
Later among the works it cites.
Stochastic optimization with importance sampling for regularized loss minimization
P. Zhao and T. Zhang · 2015
Later among the works it cites.
Even faster accelerated coordinate descent using non-uniform sampling
Z. Allen-Zhu, Z. Qu, P. Richtárik, and Y. Yuan · 2016
Later among the works it cites.
Importance sampling for minibatches
D. Csiba and P. Richtárik · 2016
Later among the works it cites.
KDD Cup 2004. Protein Homology Dataset
KDD Cup 2004 · 2016
Later among the works it cites.
Training region-based object detectors with online hard example mining
A. Shrivastava, A. Gupta, and R. Girshick · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Online learning and online convex optimization
S. Shalev-Shwartz et al · 2012
Cited alongside, same era.
Accelerating stochastic gradient descent using predictive variance reduction
R. Johnson and T. Zhang · 2013
Cited alongside, same era.
Saga: A fast incremental gradient method with support for non-strongly convex composite objectives
A. Defazio, F. Bach, and S. Lacoste-Julien · 2014
Cited alongside, same era.
Stochastic gradient descent, weighted sampling, and the randomized kaczmarz algorithm
D. Needell, R. Ward, and N. Srebro · 2014
Cited alongside, same era.
Variance reduction in sgd by distributed importance sampling
G. Alain, A. Lamb, C. Sankar, A. Courville, and Y. Bengio · 2015
Cited alongside, same era.
G. Bouchard, T. Trouillon, J. Perez, and A. Gaidon · 2015
Cited alongside, same era.
Later among the works it cites.
Adaptive sampling probabilities for non-smooth optimization
H. Namkoong, A. Sinha, S. Yadlowsky, and J. C. Duchi · 2017
Later among the works it cites.
Faster coordinate descent via adaptive importance sampling
D. Perekrestenko, V. Cevher, and M. Jaggi · 2017
Later among the works it cites.
Stochastic Optimization with Bandit Sampling
F. Salehi, L. E. Celis, and P. Thiran · 2017
Later among the works it cites.
Stochastic dual coordinate descent with bandit sampling
F. Salehi, P. Thiran, and L. E. Celis · 2017
Later among the works it cites.
Safe adaptive importance sampling
S. U. Stich, A. Raj, and M. Jaggi · 2017
Later among the works it cites.