<?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>Gradient-Descent on The Standard Error</title><link>https://jongha-jeon-dev.github.io/standarderror/tags/gradient-descent/</link><description>Recent content in Gradient-Descent on The Standard Error</description><generator>Hugo -- 0.123.7</generator><language>en-gb</language><lastBuildDate>Thu, 03 Sep 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://jongha-jeon-dev.github.io/standarderror/tags/gradient-descent/index.xml" rel="self" type="application/rss+xml"/><item><title>Numerical Analysis 1: Your Learning Rate Is a Step Size</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/numerical-analysis-1-step-size/</link><pubDate>Thu, 03 Sep 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/numerical-analysis-1-step-size/</guid><description>Gradient descent is forward Euler on the gradient flow, so the learning rate is a discretisation step with a stability limit — exactly 2/λ_max on a quadratic, and on a network 2.04 times larger than that formula says, because the curvature moves to meet whatever step you chose.</description></item></channel></rss>