<?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>Pseudocode on SciDraft | A Hugo Theme</title><link>https://www.zhumengyao.com/scidraft/tags/pseudocode/</link><description>Recent content in Pseudocode on SciDraft | A Hugo Theme</description><generator>Hugo</generator><language>en</language><lastBuildDate>Mon, 21 Sep 2026 08:39:00 +0900</lastBuildDate><atom:link href="https://www.zhumengyao.com/scidraft/tags/pseudocode/index.xml" rel="self" type="application/rss+xml"/><item><title>Power Iteration with a Convergence Check (pseudocode)</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-pseudocode-power-iteration/</link><pubDate>Mon, 21 Sep 2026 08:39:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-pseudocode-power-iteration/</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 largest singular value of a weight matrix is one of the numbers used to
judge how a layer transforms its input, and it is usually estimated rather than
computed: repeated multiplication by the matrix makes any starting vector align
with the leading eigenvector, after which the Rayleigh quotient gives the value.&lt;/p&gt;</description></item><item><title>Layer Normalisation Written as a Function (pseudocode)</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-pseudocode-layer-norm/</link><pubDate>Mon, 21 Sep 2026 08:15:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-pseudocode-layer-norm/</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;Layer normalisation rescales each token&amp;rsquo;s activations using statistics computed
across the features of that token alone, which is what separates it from batch
normalisation: nothing in the computation depends on the other examples in the
batch.&lt;/p&gt;</description></item><item><title>Gradient Accumulation with an Input and Output Contract (pseudocode)</title><link>https://www.zhumengyao.com/scidraft/notes/demo-note-pseudocode-gradient-accumulation/</link><pubDate>Mon, 21 Sep 2026 07:47:00 +0900</pubDate><guid>https://www.zhumengyao.com/scidraft/notes/demo-note-pseudocode-gradient-accumulation/</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;Gradient accumulation is the standard way to train with a batch larger than
memory allows: several small batches are processed in turn and their gradients
added before any parameter moves. The gradient of a sum is the sum of the
gradients, so the result equals one step on the concatenated batch as long as the
per-batch losses are averaged.&lt;/p&gt;</description></item></channel></rss>