<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://marovi.ai/index.php?action=history&amp;feed=atom&amp;title=Translations%3AStochastic_Gradient_Descent%2F3%2Fzh</id>
	<title>Translations:Stochastic Gradient Descent/3/zh - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://marovi.ai/index.php?action=history&amp;feed=atom&amp;title=Translations%3AStochastic_Gradient_Descent%2F3%2Fzh"/>
	<link rel="alternate" type="text/html" href="https://marovi.ai/index.php?title=Translations:Stochastic_Gradient_Descent/3/zh&amp;action=history"/>
	<updated>2026-04-27T22:02:18Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.39.1</generator>
	<entry>
		<id>https://marovi.ai/index.php?title=Translations:Stochastic_Gradient_Descent/3/zh&amp;diff=5426&amp;oldid=prev</id>
		<title>DeployBot: Batch translate Stochastic Gradient Descent unit 3 → zh</title>
		<link rel="alternate" type="text/html" href="https://marovi.ai/index.php?title=Translations:Stochastic_Gradient_Descent/3/zh&amp;diff=5426&amp;oldid=prev"/>
		<updated>2026-04-27T03:38:12Z</updated>

		<summary type="html">&lt;p&gt;Batch translate Stochastic Gradient Descent unit 3 → zh&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;在经典的{{Term|gradient descent|梯度下降}}中，每次参数更新前都要在整个训练集上计算{{Term|loss function|损失函数}}的完整梯度。当数据集很大时，这种做法的代价高得难以承受。SGD 通过在每一步从单个随机选取的样本（或一个小的 &amp;#039;&amp;#039;&amp;#039;{{Term|mini-batch}}&amp;#039;&amp;#039;&amp;#039;）估计梯度来解决该问题，以较高噪声的估计换取每次迭代成本的大幅降低。&lt;/div&gt;</summary>
		<author><name>DeployBot</name></author>
	</entry>
</feed>