<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Stochastic gradient descent - Page 9 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Stochastic_gradient_descent&amp;p=8">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Stochastic_gradient_descent&amp;p=10">3.Next</a>
</p>
<p>in the case of large-scale machine learning problems.</p>

<p><big>Iterative method</big></p>
<p><a href="page.php?w=Image%3Astogra.png">thumb</a>In stochastic (or "on-line") gradient descent, the true gradient of  is approximated by a gradient at a single sample:</p>

<p>As the algorithm sweeps through the training set, it performs the above update for each training sample. Several passes can be made over the training set until the algorithm converges. If this is done, the data can be shuffled for each pass to prevent cycles. Typical implementations</p><p>
<a accesskey="1" href="page.php?w=Stochastic_gradient_descent&amp;p=8">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Stochastic_gradient_descent&amp;p=10">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
