Fetching the paper…
Reading the bibliography…
We study the generalization properties of stochastic gradient methods for learning with convex loss functions and linearly parameterized functions.
Nonlinear Programming
Dimitri P Bertsekas · 1999
Earlier work this paper cites.
Rademacher and gaussian complexities: Risk bounds and structural results
Peter L Bartlett and Shahar Mendelson · 2003
Earlier work this paper cites.
Subgradient methods
Stephen Boyd, Lin Xiao, and Almir Mutapcic · 2003
Earlier work this paper cites.
Generalization error bounds for Bayesian mixture algorithms
Ron Meir and Tong Zhang · 2003
Earlier work this paper cites.
Local rademacher complexities
Peter L Bartlett, Olivier Bousquet, and Shahar Mendelson · 2005
Earlier work this paper cites.
Stochastic subgradient methods
Stephen Boyd and Almir Mutapcic · 2007
Earlier work this paper cites.
Learning Theory: an Approximation Theory Viewpoint
Felipe Cucker and Ding-Xuan Zhou · 2007
Earlier work this paper cites.
The tradeoffs of large scale learning
Olivier Bousquet and Léon Bottou · 2008
Cited alongside, same era.
Support Vector Machines
Ingo Steinwart and Andreas Christmann · 2008
Cited alongside, same era.
Online gradient descent learning algorithms
Yiming Ying and Massimiliano Pontil · 2008
Cited alongside, same era.
Robust stochastic approximation approach to stochastic programming
Arkadi Nemirovski, Anatoli Juditsky, Guanghui Lan, and Alexander Shapiro · 2009
Cited alongside, same era.
Incremental gradient, subgradient, and proximal methods for convex optimization: A survey
Dimitri P Bertsekas · 2011
Cited alongside, same era.
LIBSVM: A library for support vector machines
Chih-Chung Chang and Chih-Jen Lin · 2011
Cited alongside, same era.
Stochastic gradient descent for non-smooth optimization: Convergence results and optimal averaging schemes
Ohad Shamir and Tong Zhang · 2013
Later among the works it cites.
Non-parametric stochastic approximation with large step sizes
Aymeric Dieuleveut and Francis Bach · 2014
Later among the works it cites.
Simultaneous model selection and optimization through parameter-free stochastic learning
Francesco Orabona · 2014
Later among the works it cites.
Online learning as stochastic approximation of regularization paths: Optimality and almost-sure convergence
Pierre Tarres and Yuan Yao · 2014
Later among the works it cites.
Learning with incremental iterative regularization
Lorenzo Rosasco and Silvia Villa · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Mark Schmidt, Nicolas Le Roux, and Francis Bach · 2013
Cited alongside, same era.
Moritz Hardt, Benjamin Recht, and Yoram Singer · 2016
Closest in time.
Iterative regularization for learning with convex loss functions
Junhong Lin, Lorenzo Rosasco, and Ding-Xuan Zhou · 2016
Closest in time.