<?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>Robbins-Monro on Yuchen Du</title><link>https://dudusoar.github.io/tags/robbins-monro/</link><description>Recent content in Robbins-Monro 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/robbins-monro/index.xml" rel="self" type="application/rss+xml"/><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><item><title>Dvoretzky's Theorem Turns Noisy Contraction into Pathwise Convergence</title><link>https://dudusoar.github.io/posts/stochastic-approximation/15-dvoretzky-convergence-theorem/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/15-dvoretzky-convergence-theorem/</guid><description>Dvoretzky generalizes the stochastic-approximation error recursion and gives conditions for almost-sure convergence.</description></item><item><title>How the Initial Error Disappears in Expectation</title><link>https://dudusoar.github.io/posts/stochastic-approximation/19-how-initial-error-disappears-in-expectation/</link><pubDate>Fri, 17 Jul 2026 00:00:00 +0000</pubDate><guid>https://dudusoar.github.io/posts/stochastic-approximation/19-how-initial-error-disappears-in-expectation/</guid><description>Zero-mean noise removes the disturbance terms from the expectation, leaving a product that vanishes when the step sizes sum to infinity.</description></item></channel></rss>