This is an old revision of the document!


Stochastic Algorithms for One Pass Learning

Summary

The goal of the presentation is to describe practical stochastic gradient algorithms that process each training example only once, yet asymptotically match the performance of the true optimum. This statement needs, of course, to be made more precise. To achieve this, we'll review the works of Nevel'son and Has'minskij (1972), Fabian (1973, 1978), Murata & Amari (1998), Bottou & LeCun (2004), Polyak & Juditsky (1992), Wei Xu (2010), and Bach & Moulines (2011). We will then show how these ideas lead to practical algorithms and new challenges.

talks/onepass.1328055631.txt.gz · Last modified: 2012/01/31 19:20 by leonb
Driven by DokuWiki Recent changes RSS feed Valid CSS Valid XHTML 1.0