<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Step Size on Yuchen Du</title><link>https://dudusoar.github.io/tags/step-size/</link><description>Recent content in Step Size on Yuchen Du</description><generator>Hugo -- 0.164.0</generator><language>en-us</language><lastBuildDate>Fri, 17 Jul 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://dudusoar.github.io/tags/step-size/index.xml" rel="self" type="application/rss+xml"/><item><title>What a Noisy Iteration Needs in Order to Converge</title><link>https://dudusoar.github.io/posts/stochastic-approximation/03-what-convergence-requires/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/03-what-convergence-requires/</guid><description>A compact map of the step-size and noise assumptions behind stochastic-approximation convergence.</description></item><item><title>What the Step Size Really Means</title><link>https://dudusoar.github.io/posts/stochastic-approximation/04-what-the-step-size-means/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/04-what-the-step-size-means/</guid><description>The step size is simultaneously a movement ratio, a trust coefficient, and a weight on new information.</description></item><item><title>Why the Step Size Must Stay Below One under Noise</title><link>https://dudusoar.github.io/posts/stochastic-approximation/05-why-the-step-size-stays-below-one/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/05-why-the-step-size-stays-below-one/</guid><description>Step sizes between zero and one are the only range that combines monotone error contraction with attenuation of new noise.</description></item><item><title>Why Alpha Cannot Equal One Under Persistent Noise</title><link>https://dudusoar.github.io/posts/stochastic-approximation/06-why-alpha-cannot-equal-one/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/06-why-alpha-cannot-equal-one/</guid><description>With alpha equal to one, every update discards history and inherits the full error of the latest noisy target.</description></item><item><title>The Same Step Size Behaves Differently with and without Noise</title><link>https://dudusoar.github.io/posts/stochastic-approximation/07-noiseless-versus-noisy-updates/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/07-noiseless-versus-noisy-updates/</guid><description>Alpha equal to one is optimal for an exact target but accepts the full disturbance when the target is noisy.</description></item><item><title>Alpha Equal to One Requires the Noise to Vanish</title><link>https://dudusoar.github.io/posts/stochastic-approximation/11-alpha-one-requires-vanishing-noise/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/11-alpha-one-requires-vanishing-noise/</guid><description>If every update fully replaces the current position, convergence requires the river-location judgment error itself to disappear.</description></item><item><title>The Robbins–Monro Conditions Balance Learning and Noise</title><link>https://dudusoar.github.io/posts/stochastic-approximation/12-robbins-monro-conditions/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/12-robbins-monro-conditions/</guid><description>The step sizes must remain large enough to keep correcting error and become small enough to suppress accumulated noise.</description></item><item><title>Why the Step Sizes Must Sum to Infinity</title><link>https://dudusoar.github.io/posts/stochastic-approximation/13-why-step-sizes-must-sum-to-infinity/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/13-why-step-sizes-must-sum-to-infinity/</guid><description>A finite total step size can make an iteration stop moving before its error has disappeared.</description></item><item><title>Why the Squared Step Sizes Must Be Summable</title><link>https://dudusoar.github.io/posts/stochastic-approximation/14-why-squared-step-sizes-must-be-summable/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/14-why-squared-step-sizes-must-be-summable/</guid><description>For a changing step-size sequence, square summability bounds the total variance injected by noisy observations.</description></item></channel></rss>