<?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>Deep-Learning on The Standard Error</title><link>https://jongha-jeon-dev.github.io/standarderror/tags/deep-learning/</link><description>Recent content in Deep-Learning on The Standard Error</description><generator>Hugo -- 0.123.7</generator><language>en-gb</language><lastBuildDate>Tue, 13 Oct 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://jongha-jeon-dev.github.io/standarderror/tags/deep-learning/index.xml" rel="self" type="application/rss+xml"/><item><title>Gradients 1: Backprop Is the Chain Rule, and the Chain Rule Has Hypotheses</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/gradients-1-kinks/</link><pubDate>Thu, 10 Sep 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/gradients-1-kinks/</guid><description>Autodiff returns a float at every point where the derivative does not exist, and the float is a choice. The choices disagree inside one library, which makes differentiation a function of the expression rather than of the function - and then almost none of it turns out to happen in a real transformer.</description></item><item><title>Gradients 2: A Confident Attention Head Passes Almost No Gradient</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/gradients-2-saturation/</link><pubDate>Thu, 10 Sep 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/gradients-2-saturation/</guid><description>The softmax Jacobian&amp;#39;s norm is fixed within a factor of two by its largest probability alone, no matter how many positions it has. So one head of this model has committed hard enough that the gradient which could change its mind is gone - and it is the head the model cannot do without.</description></item><item><title>Gradients 3: LayerNorm Deletes Exactly Two Directions of Your Gradient</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/gradients-3-layernorm/</link><pubDate>Fri, 11 Sep 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/gradients-3-layernorm/</guid><description>Its Jacobian has rank exactly d minus 2, and the two missing directions are the invariances the layer was built to have. Then the residual connection restores the rank everywhere except the last norm, where it becomes an exact invariance of the entire network.</description></item><item><title>Gradients 4: You Cannot Differentiate Through a Sampled Token</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/gradients-4-sampling/</link><pubDate>Fri, 11 Sep 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/gradients-4-sampling/</guid><description>A sampled token is a step function of its logits, so the derivative is zero almost everywhere and undefined elsewhere. On a decision small enough to enumerate, the three things people return instead can be compared against the gradient that does exist.</description></item><item><title>Gradients 5: The Gradient in Embedding Space Does Not Point at a Token</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/gradients-5-embeddings/</link><pubDate>Fri, 11 Sep 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/gradients-5-embeddings/</guid><description>The embedding table is 65 near-orthogonal points on a sphere, so there is no local neighbourhood and a descent step leaves you nearest to the token you started from. The same gradient, asked to rank five candidates instead of to point, recovers almost all of the available gain.</description></item><item><title>ML 21: Initialisation Must Break Symmetry, at the Right Scale</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-21-init-scale/</link><pubDate>Tue, 13 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-21-init-scale/</guid><description>Equal initial weights never become different, so they have to be random. In a deep network, random at the wrong scale fails just as completely.</description></item><item><title>ML 22: Learning Rate and Batch Size Are One Knob, Until the Rate Hits a Wall</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-22-lr-batch/</link><pubDate>Tue, 13 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-22-lr-batch/</guid><description>With plain SGD and a fixed number of examples, multiplying the batch size and the learning rate by the same factor gives the same training run, until the learning rate reaches the point where training fails.</description></item><item><title>ML 23: Adam Is a Little Faster and No Better</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-23-adam-sgd/</link><pubDate>Tue, 13 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-23-adam-sgd/</guid><description>Tuned on validation data and run over twenty splits, Adam and SGD with momentum reach the same test accuracy. Adam&amp;#39;s speed is real but small, and belongs to its learning rate.</description></item><item><title>ML 24: Batch Normalisation Normalises the Batch, Not the Example</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-24-batchnorm/</link><pubDate>Tue, 13 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-24-batchnorm/</guid><description>In training mode, a normalised network&amp;#39;s answer for one digit depends on which other digits share its batch. That is fine in large, mixed batches and breaks in small or uniform ones.</description></item><item><title>ML 25: Weight Scaling Keeps Dropout's Answers, Not Its Doubts</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-25-dropout/</link><pubDate>Tue, 13 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-25-dropout/</guid><description>Switching dropout off and scaling the weights gives almost the same labels as averaging many dropout masks. It does not give the same probabilities.</description></item><item><title>ML 26: The Network That Memorises Noise Learns the Signal First</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-26-random-labels/</link><pubDate>Tue, 13 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-26-random-labels/</guid><description>A network that reaches 97% on test digits also fits random labels perfectly. Capacity cannot explain the first; the order in which it learns does.</description></item><item><title>ML 27: Perfect Training Accuracy Was Not the End of Learning</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-27-grokking/</link><pubDate>Tue, 13 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-27-grokking/</guid><description>A network trained on part of a modular-addition table memorises it at once, scores nothing on the rest, and finds the rule thousands of steps later, while its training accuracy sits at 100% the whole time.</description></item><item><title>ML 30: A Power Law Fitted on Small Models Cannot See the Floor</title><link>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-30-scaling/</link><pubDate>Tue, 13 Oct 2026 00:00:00 +0000</pubDate><guid>https://jongha-jeon-dev.github.io/standarderror/lectures/ml-30-scaling/</guid><description>Eight character transformers, one budget of data and steps. The law fitted to the five smallest predicts the next size almost exactly and the largest too optimistically.</description></item></channel></rss>