<?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>Gradients on SciDraft | A Hugo Theme</title><link>https://www.zhumengyao.com/scidraft/tags/gradients/</link><description>Recent content in Gradients on SciDraft | A Hugo Theme</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 21 Sep 2026 16:02:00 +0900</lastBuildDate><atom:link href="https://www.zhumengyao.com/scidraft/tags/gradients/index.xml" rel="self" type="application/rss+xml"/><item><title>The Chain Rule (rule)</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-rule-chain/</link><pubDate>Mon, 21 Sep 2026 16:02:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-rule-chain/</guid><description>&lt;p&gt;&lt;strong&gt;Demo note.&lt;/strong&gt; This note demonstrates what the &lt;strong&gt;SciDraft&lt;/strong&gt; Hugo theme can do
for academic and scientific publishing — for research institutions, researchers
and students. Its content is demonstration material only: readers should ignore
whether the demo content is correct.&lt;/p&gt;
&lt;p&gt;A rule is a procedure applied so often that it stops looking like a theorem, and the
chain rule is the extreme case: every backward pass through a stacked model is one long
application of it.&lt;/p&gt;</description></item><item><title>Softmax Cross-Entropy and Its Gradient in Python (advanced)</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-cross-entropy-gradient-python/</link><pubDate>Mon, 21 Sep 2026 12:52:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-cross-entropy-gradient-python/</guid><description>&lt;p&gt;&lt;strong&gt;Demo note.&lt;/strong&gt; This note demonstrates what the &lt;strong&gt;SciDraft&lt;/strong&gt; Hugo theme can do
for academic and scientific publishing — for research institutions, researchers
and students. Its content is demonstration material only: readers should ignore
whether the demo content is correct.&lt;/p&gt;
&lt;p&gt;The number a language model reports while training is the mean negative
log-likelihood of the token that actually came next: softmax cross-entropy over
the vocabulary at every position. Its backward pass has an unusually clean
closed form — the softmax Jacobian and the logarithm cancel, leaving the
probabilities minus the one-hot target, divided by the number of predictions.&lt;/p&gt;</description></item><item><title>The Gradient of Cross-Entropy Through Softmax (proposition)</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-proposition-gradient-cross-entropy/</link><pubDate>Mon, 21 Sep 2026 09:32:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-proposition-gradient-cross-entropy/</guid><description>&lt;p&gt;&lt;strong&gt;Demo note.&lt;/strong&gt; This note demonstrates what the &lt;strong&gt;SciDraft&lt;/strong&gt; Hugo theme can do
for academic and scientific publishing — for research institutions, researchers
and students. Its content is demonstration material only: readers should ignore
whether the demo content is correct.&lt;/p&gt;
&lt;p&gt;A proposition is a proved statement of moderate weight; this one is the reason the
training loss needs no special treatment in the backward pass. Composing softmax with
negative log-likelihood, the Jacobian of the softmax and the derivative of the logarithm
cancel almost completely.&lt;/p&gt;</description></item></channel></rss>