This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | |||
papers:bottou-murata-2002 [2006/04/18 17:58] leonb |
papers:bottou-murata-2002 [2006/04/20 11:04] leonb |
||
---|---|---|---|
Line 1: | Line 1: | ||
- | ===== Stochastic Approximations and Efficient Learning ===== | ||
- | |||
- | // | ||
- | The analysis of online algorithms is much more difficult than that of | ||
- | ordinary optimization algorithms. | ||
- | processing (Widrow and Stearns, 1985) motivated the creation of | ||
- | sophisticated mathematical tools known as {\em stochastic | ||
- | approximations} (Ljung and Soderstrom, 1983; Benveniste, Metivier and Priouret, 1990) | ||
- | [...] | ||
- | The first section describes and illustrates a general framework for | ||
- | neural network learning algorithms based on stochastic gradient | ||
- | descent. | ||
- | describing the //final phase// | ||
- | conceptual aspects of the //search phase// and comments some of the | ||
- | newest results. | ||
- | |||
- | <box 99% orange> | ||
- | Léon Bottou and Noboru Murata: Stochastic Approximations and Efficient Learning, | ||
- | |||
- | [[http:// | ||
- | [[http:// | ||
- | [[http:// | ||
- | </ | ||
- | |||
- | @incollection{bottou-murata-2002, | ||
- | author = {Bottou, L\' | ||
- | title = {Stochastic Approximations and Efficient Learning}, | ||
- | booktitle = {The Handbook of Brain Theory and Neural Networks, Second edition,}, | ||
- | editor = {Arbib, M. A.}, | ||
- | publisher = {The MIT Press}, | ||
- | address = {Cambridge, MA}, | ||
- | year = {2002}, | ||
- | url = {http:// | ||
- | } | ||