
<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://ricefriedegg.com:80/mediawiki/index.php?action=history&amp;feed=atom&amp;title=Stochastic_Gradient_Descent</id>
	<title>Stochastic Gradient Descent - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://ricefriedegg.com:80/mediawiki/index.php?action=history&amp;feed=atom&amp;title=Stochastic_Gradient_Descent"/>
	<link rel="alternate" type="text/html" href="http://ricefriedegg.com:80/mediawiki/index.php?title=Stochastic_Gradient_Descent&amp;action=history"/>
	<updated>2026-05-26T21:42:11Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.41.0</generator>
	<entry>
		<id>http://ricefriedegg.com:80/mediawiki/index.php?title=Stochastic_Gradient_Descent&amp;diff=507&amp;oldid=prev</id>
		<title>Rice: Created page with &quot; = How it works = First, a weight &lt;math&gt;\bf{w}&lt;/math&gt; is selected. This is the starting point from which we iteratively improve the solution.  For &#039;&#039;each datapoint&#039;&#039; in the dataset, the &#039;&#039;gradient&#039;&#039; of the loss function with respect to weights is computed and a learning rate is selected. These two statistics determine the speed and direction the model &lt;math&gt;\bf{w}&lt;/math&gt; converges to.  Then, a &#039;&#039;&#039;GD update rule&#039;&#039;&#039; is used to converge the weights to the desired outcome ba...&quot;</title>
		<link rel="alternate" type="text/html" href="http://ricefriedegg.com:80/mediawiki/index.php?title=Stochastic_Gradient_Descent&amp;diff=507&amp;oldid=prev"/>
		<updated>2024-04-15T18:25:30Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot; = How it works = First, a weight &amp;lt;math&amp;gt;\bf{w}&amp;lt;/math&amp;gt; is selected. This is the starting point from which we iteratively improve the solution.  For &amp;#039;&amp;#039;each datapoint&amp;#039;&amp;#039; in the dataset, the &amp;#039;&amp;#039;gradient&amp;#039;&amp;#039; of the loss function with respect to weights is computed and a learning rate is selected. These two statistics determine the speed and direction the model &amp;lt;math&amp;gt;\bf{w}&amp;lt;/math&amp;gt; converges to.  Then, a &amp;#039;&amp;#039;&amp;#039;GD update rule&amp;#039;&amp;#039;&amp;#039; is used to converge the weights to the desired outcome ba...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
= How it works =&lt;br /&gt;
First, a weight &amp;lt;math&amp;gt;\bf{w}&amp;lt;/math&amp;gt; is selected. This is the starting point from which we iteratively improve the solution.&lt;br /&gt;
&lt;br /&gt;
For &amp;#039;&amp;#039;each datapoint&amp;#039;&amp;#039; in the dataset, the &amp;#039;&amp;#039;gradient&amp;#039;&amp;#039; of the loss function with respect to weights is computed and a learning rate is selected. These two statistics determine the speed and direction the model &amp;lt;math&amp;gt;\bf{w}&amp;lt;/math&amp;gt; converges to.&lt;br /&gt;
&lt;br /&gt;
Then, a &amp;#039;&amp;#039;&amp;#039;GD update rule&amp;#039;&amp;#039;&amp;#039; is used to converge the weights to the desired outcome based on the gradient and learning rate.&lt;br /&gt;
&lt;br /&gt;
After processing all data points, all weights are updated and 1 &amp;#039;&amp;#039;&amp;#039;epoch&amp;#039;&amp;#039;&amp;#039; is completed. MSE is then measured.&lt;br /&gt;
&lt;br /&gt;
== GD Update Rule ==&lt;br /&gt;
The &amp;#039;&amp;#039;&amp;#039;GD update rule&amp;#039;&amp;#039;&amp;#039; is used to update the weights after an iteration.&lt;br /&gt;
[[Category:Machine Learning]]&lt;/div&gt;</summary>
		<author><name>Rice</name></author>
	</entry>
</feed>