<?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>Inference on SciDraft | A Hugo Theme</title><link>https://www.zhumengyao.com/scidraft/tags/inference/</link><description>Recent content in Inference on SciDraft | A Hugo Theme</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 22 Sep 2026 07:15:00 +0900</lastBuildDate><atom:link href="https://www.zhumengyao.com/scidraft/tags/inference/index.xml" rel="self" type="application/rss+xml"/><item><title>Autoregressive Generation (sequence diagram)</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-mermaid-sequence/</link><pubDate>Tue, 22 Sep 2026 07:15:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-mermaid-sequence/</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 language model writes one token at a time. The prompt is processed once, then
each new token is appended to the sequence and fed back in, so generation is a
loop between the model and the sampler rather than a single call. The sequence
diagram below shows the participants and the messages between them.&lt;/p&gt;</description></item><item><title>Decoding as a State Machine (state diagram)</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-mermaid-state/</link><pubDate>Mon, 21 Sep 2026 10:12:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-mermaid-state/</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 same generation loop can be described without messages, as a machine with
a small number of states. This view is useful when the interesting questions are
about &lt;em&gt;transitions&lt;/em&gt; — when decoding starts, what keeps it running, and which
conditions end it. The state diagram below is the whole lifecycle of one
completion.&lt;/p&gt;</description></item></channel></rss>