<?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>Lemma on SciDraft | A Hugo Theme</title><link>https://www.zhumengyao.com/scidraft/tags/lemma/</link><description>Recent content in Lemma on SciDraft | A Hugo Theme</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 21 Sep 2026 12:02:00 +0900</lastBuildDate><atom:link href="https://www.zhumengyao.com/scidraft/tags/lemma/index.xml" rel="self" type="application/rss+xml"/><item><title>Log-Sum-Exp Bounds (lemma)</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-lemma-logsumexp/</link><pubDate>Mon, 21 Sep 2026 12:02:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-lemma-logsumexp/</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 log-partition function appears wherever a normalising constant is needed, and it is
trapped between two elementary bounds that are enough for most arguments: the largest term
below, the largest term plus the log of the number of terms above.&lt;/p&gt;</description></item><item><title>Softmax Is Invariant to a Shift (lemma)</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-lemma-softmax-shift/</link><pubDate>Mon, 21 Sep 2026 10:52:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-lemma-softmax-shift/</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 lemma is a small result proved on the way to something larger, and this one is proved
in two lines yet carries most of the numerical stability of a softmax: adding the same
constant to every score changes nothing.&lt;/p&gt;</description></item></channel></rss>