<?xml version="1.0"?>
<!-- name="generator" content="blosxom/2.0" -->
<!DOCTYPE rss PUBLIC "-//Netscape Communications//DTD RSS 0.91//EN" "http://my.netscape.com/publish/formats/rss-0.91.dtd">

<rss version="0.91">
  <channel>
    <title>Notebooks   </title>
    <link>http://bactra.org/notebooks</link>
    <description>Cosma's Notebooks</description>
    <language>en</language>

  <item>
    <title>Stochastic Approximation Algorithms</title>
    <link>http://bactra.org/notebooks/2009/04/10#stochastic-approximation</link>
    <description>
&lt;P&gt;Logically, &quot;stochastic approximation&quot; could refer to a great range of
things, but in practice it has become something of a technical term for
procedures that approximate the solution of an equation, observed through
noise, or which try to minimize a function, again observed through noise.  The
former --- root-finding --- is sometimes known as the Robbins-Monro problem,
and the latter --- minimization --- as the Kiefer-Wolfowitz problem.
(Tangentially, that Wolfowitz is the father of the Wolfowitz who helped drag us
into the invasion of Iraq.)  This turns out to be a subject with deep
connections to the theory of on-line learning algorithms and recursive
estimation, which is really how I became interested in it, but I also like it
nowadays because it provides some very cute, yet powerful, probability
examples...

&lt;P&gt;See also:
	&lt;a href=&quot;monte-carlo.html&quot;&gt;Monte Carlo&lt;/a&gt;;
	&lt;a href=&quot;sequential-decisions.html&quot;&gt;Sequential Decision-Making Under Uncertainty&lt;/a&gt;

&lt;ul&gt;Recommended:
	&lt;li&gt;Michel Bena&amp;iuml;m, &quot;Dynamics of stochastic approximation
algorithms&quot;, &lt;cite&gt;S&amp;eacute;minaire de probabilit&amp;eacute;s (Strasbourg)&lt;/cite&gt; 
&lt;strong&gt;33&lt;/strong&gt; (1999): 1--68
[&lt;a href=&quot;http://www.numdam.org/item?id=SPS_1999__33__1_0&quot;&gt;Link to full text,
bibliography, etc.&lt;/a&gt;]
	&lt;li&gt;M. B. Nevel'son and R. Z. Hasminskii, &lt;cite&gt;Stochastic
Approximation and Recursive Estimation&lt;/cite&gt; [A truly excellent book; I don't
suppose anyone has a copy they'd like to sell?]
	&lt;li&gt;Robin Pemantle, &quot;A Survey of Random Processes with Reinforcement&quot;,
&lt;a href=&quot;http://arxiv.org/abs/math.PR/0610076&quot;&gt;math.PR/0610076&lt;/a&gt;
	&lt;li&gt;H. Robbins and S. Monro, &quot;A Stochastic Approximation Method&quot;,
&lt;a href=&quot;http://projecteuclid.org/euclid.aoms/1177729586&quot;&gt;&lt;cite&gt;Annals of
Mathematical Statistics&lt;/cite&gt; &lt;strong&gt;22&lt;/strong&gt; (1951): 400--407&lt;/a&gt;
	&lt;/ul&gt;

&lt;ul&gt;To read:
	&lt;li&gt;Arthur E. Albert and Leland A. Gardner, Jr., &lt;cite&gt;Stochastic
Approximation and Nonlinear Regression&lt;/cite&gt;
	&lt;li&gt;Vivek S. Borkar, &lt;cite&gt;Stochastic Approxmation: A Dynamical
Systems Viewpoint&lt;/cite&gt;
	&lt;li&gt;D. L. Burkholder, &quot;On a Class of Stochastic Approximation
Processes&quot;, &lt;cite&gt;Annals of Mathematical Statistics&lt;/cite&gt; &lt;strong&gt;27&lt;/strong&gt;
(1956): 1044--1059
	&lt;li&gt;Sebastien Gadat and Laurent Younnes, &quot;A Stochastic Algorithm for
Feature Selection in Pattern Recognition&quot;, &lt;a
href=&quot;http://jmlr.csail.mit.edu/papers/volume8/gadat07a/gadat07a.pdf&quot;&gt;&lt;cite&gt;Journal
of Machine Learning Research&lt;/cite&gt; &lt;strong&gt;8&lt;/strong&gt; (2007): 509--547&lt;/a&gt;
	&lt;li&gt;H. J. Kushner and G. G. Yin, &lt;cite&gt;Stochastic Approximation
Algorithms and Applications&lt;/cite&gt;
	&lt;li&gt;Abdelkader Mokkadem and Mariane Pelletier
		&lt;ul&gt;
		&lt;li&gt;&quot;Convergence rate and
averaging of nonlinear two-time-scale stochastic approximation
algorithms&quot;, &lt;a href=&quot;http://arxiv.org/abs/math.PR/0610329&quot;&gt;math.PR/0610329&lt;/a&gt;
= &lt;cite&gt;Annals of Applied Probability&lt;/cite&gt; &lt;strong&gt;16&lt;/strong&gt; (2006):
1671--1702
		&lt;li&gt;&quot;A companion for the Kiefer-Wolfowitz-Blum stochastic
approximation algorithm&quot;, &lt;a
href=&quot;http://arxiv.org/abs/math.ST/0610487&quot;&gt;math.ST/0610487&lt;/a&gt;
[Simultaneously estimating both the location and the magnitude of the
maximum]
		&lt;/ul&gt;
	&lt;li&gt;Abdelkader Mokkadem, Mariane Pelletier, Yousri Slaoui, &quot;Revisiting
R&amp;eacute;v&amp;eacute;sz's stochastic approximation method for the estimation of a
regression
function&quot;, &lt;a href=&quot;http://arxiv.org/abs/0812.3973&quot;&gt;arxiv:0812.3973&lt;/a&gt;
	&lt;li&gt;Mariane Pelletier, &quot;Weak Convergence Rates for Stochastic
Approximation with Applications to Multiple Targets and Simulated Annealing&quot;,
&lt;a href=&quot;http://dx.doi.org/10.1214/aoap/1027961032&quot;&gt;&lt;cite&gt;Annals of Applied Probability&lt;/cite&gt; &lt;strong&gt;8&lt;/strong&gt; (1998): 10--44&lt;/a&gt;
	&lt;li&gt;D. Saad (ed.), &lt;cite&gt;Online Learning of Neural Networks&lt;/cite&gt;
	&lt;/ul&gt;
</description>
  </item>
  </channel>
</rss>