<?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>Probability on SciDraft | A Hugo Theme</title><link>https://www.zhumengyao.com/scidraft/tags/probability/</link><description>Recent content in Probability on SciDraft | A Hugo Theme</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 21 Sep 2026 16:12:00 +0900</lastBuildDate><atom:link href="https://www.zhumengyao.com/scidraft/tags/probability/index.xml" rel="self" type="application/rss+xml"/><item><title>Bayes' Rule (rule)</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-rule-bayes/</link><pubDate>Mon, 21 Sep 2026 16:12:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-rule-bayes/</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;Bayes&amp;rsquo; rule is the rule for turning a model&amp;rsquo;s likelihood into a statement about
hypotheses, and it is used twice in a language-model workflow: once to reason about
uncertainty in evaluation, and once whenever a prior over prompts or parameters is
combined with observed data.&lt;/p&gt;</description></item><item><title>Kolmogorov Axioms for a Token Distribution (axiom)</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-axiom-probability/</link><pubDate>Mon, 21 Sep 2026 13:32:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-axiom-probability/</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;An axiom is an assumption taken as given, and the ones that hold up a language model
are Kolmogorov&amp;rsquo;s three: probabilities are non-negative, the whole space has probability
one, and disjoint events add. Everything else about token distributions is derived from
them rather than assumed.&lt;/p&gt;</description></item><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>Cross-Entropy (definition)</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-definition-cross-entropy/</link><pubDate>Mon, 21 Sep 2026 09:02:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-definition-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;The training objective of a language model has a name and a formula, and both matter
when the loss curve is read: cross-entropy is the expected negative log-probability of
what actually happened, measured in nats.&lt;/p&gt;</description></item></channel></rss>