<?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>Noise on Yuchen Du</title><link>https://dudusoar.github.io/tags/noise/</link><description>Recent content in Noise 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/noise/index.xml" rel="self" type="application/rss+xml"/><item><title>Where Stochastic Approximation Begins: Learning from a Noisy Target</title><link>https://dudusoar.github.io/posts/stochastic-approximation/01-learning-from-a-noisy-target/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/01-learning-from-a-noisy-target/</guid><description>Stochastic approximation begins when the true target is hidden and each update can use only a noisy estimate of it.</description></item><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>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>A Memoryless Update Is Not the Same as Markov Sufficiency</title><link>https://dudusoar.github.io/posts/stochastic-approximation/08-memoryless-updates-and-markov-sufficiency/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/08-memoryless-updates-and-markov-sufficiency/</guid><description>An update can erase the previous iterate without becoming Markov; Markov sufficiency is a property of the chosen state.</description></item><item><title>Expectation and Variance Explain Why History Stabilizes an Update</title><link>https://dudusoar.github.io/posts/stochastic-approximation/09-expectation-and-variance-of-two-updates/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/09-expectation-and-variance-of-two-updates/</guid><description>A direct derivation compares memoryless and history-preserving updates under zero-mean finite-variance noise.</description></item><item><title>What the Noise Assumptions Actually Buy Us</title><link>https://dudusoar.github.io/posts/stochastic-approximation/10-what-noise-assumptions-buy-us/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/10-what-noise-assumptions-buy-us/</guid><description>Zero mean, finite variance, independence, and identical distribution each support a different part of noise averaging.</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>Expand the Error into Initial Bias and Historical Noise</title><link>https://dudusoar.github.io/posts/stochastic-approximation/18-expanding-the-error-recursion/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/18-expanding-the-error-recursion/</guid><description>The explicit error formula separates the residual initial condition from the weighted sum of all past disturbances.</description></item><item><title>How Historical Noise Is Attenuated</title><link>https://dudusoar.github.io/posts/stochastic-approximation/20-how-noise-variance-decays/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/20-how-noise-variance-decays/</guid><description>Each disturbance is controlled twice: by its entry coefficient and by every contraction that follows it.</description></item></channel></rss>