A stochastic approximation method
Herbert Robbins and Sutton Monro · 1951
Earlier work this paper cites.
Learning to rank using gradient descent
Chris Burges, Tal Shaked, Erin Renshaw, Ari Lazier, Matt Deeds, Nicole Hamilton, and Greg Hullender · 2005
Earlier work this paper cites.
Learning to rank with nonsmooth cost functions
Christopher J. Burges, Robert Ragno, and Quoc V. Le · 2007
Earlier work this paper cites.
Smooth optimization with approximate gradient
Alexandre d’Aspremont · 2008
Earlier work this paper cites.
On rates of convergence for stochastic optimization problems under non–independent and identically distributed sampling
Tito Homem-de-Mello · 2008
Earlier work this paper cites.
Robust stochastic approximation approach to stochastic programming
A. Nemirovski, A. Juditsky, G. Lan, and A. Shapiro · 2009
Earlier work this paper cites.
From RankNet to LambdaRank to LambdaMART: An overview
Christopher J.C. Burges · 2010
Earlier work this paper cites.
Understanding the difficulty of training deep feedforward neural networks
Xavier Glorot and Yoshua Bengio · 2010
Earlier work this paper cites.
Convergence rates of inexact proximal-gradient methods for convex optimization
Mark Schmidt, Nicolas L. Roux, and Francis R. Bach · 2011
Earlier work this paper cites.
Hybrid deterministic-stochastic methods for data fitting
Michael P. Friedlander and Mark Schmidt · 2012
Earlier work this paper cites.