<?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>Pseudo-Algorithm on SciDraft | A Hugo Theme</title><link>https://www.zhumengyao.com/scidraft/tags/pseudo-algorithm/</link><description>Recent content in Pseudo-Algorithm on SciDraft | A Hugo Theme</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 21 Sep 2026 15:42:00 +0900</lastBuildDate><atom:link href="https://www.zhumengyao.com/scidraft/tags/pseudo-algorithm/index.xml" rel="self" type="application/rss+xml"/><item><title>Backpropagation Through a Dense Layer</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-backpropagation-pseudocode/</link><pubDate>Mon, 21 Sep 2026 15:42:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-backpropagation-pseudocode/</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;Backpropagation computes, for one layer, three gradients: one for each parameter
of the layer and one to hand to the layer before it. The third is what makes deep
networks trainable — without it, error could not travel past the last layer. The
procedure below is the backward pass of a single dense layer.&lt;/p&gt;</description></item><item><title>Attention Mechanism: Pseudocode</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-attention-pseudocode/</link><pubDate>Mon, 21 Sep 2026 15:32:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-attention-pseudocode/</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;Attention lets a model decide, for each position it is processing, which
other positions to draw information from. This note states the &lt;strong&gt;scaled
dot-product&lt;/strong&gt; form as an algorithm rather than as an equation, so the
sequence of operations — and the shape of each intermediate result — is
explicit.&lt;/p&gt;</description></item><item><title>Nucleus (Top-p) Sampling</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-top-p-sampling-pseudocode/</link><pubDate>Mon, 21 Sep 2026 06:52:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-top-p-sampling-pseudocode/</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 does not emit a token; it emits a probability for every token
in the vocabulary, and something has to choose one. Choosing the single most
probable token makes output repetitive, while sampling from the full distribution
occasionally picks from its long tail of near-zero probabilities. Nucleus
sampling keeps the smallest set of tokens whose combined probability reaches a
threshold and samples only from those.&lt;/p&gt;</description></item></channel></rss>