<?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>Theorem on SciDraft | A Hugo Theme</title><link>https://www.zhumengyao.com/scidraft/tags/theorem/</link><description>Recent content in Theorem on SciDraft | A Hugo Theme</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 21 Sep 2026 09:22:00 +0900</lastBuildDate><atom:link href="https://www.zhumengyao.com/scidraft/tags/theorem/index.xml" rel="self" type="application/rss+xml"/><item><title>Maximum Entropy Gives the Softmax (theorem)</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-theorem-max-entropy/</link><pubDate>Mon, 21 Sep 2026 09:22:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-theorem-max-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;The exponential form of a language model&amp;rsquo;s output is not a design choice made for
convenience; it is forced by an optimisation over distributions. Maximise entropy subject
to matching a set of expected features, and the solution is always of the form
\(\exp(\theta^{\top} f(x))\), normalised.&lt;/p&gt;</description></item></channel></rss>