<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[Speculative decoding: why repetitive text suddenly runs faster]]></title><description><![CDATA[<p dir="auto">You may notice Caterpillar getting noticeably quicker on some kinds of output — lists, structured text, anything repetitive — and behaving normally on ordinary prose. That's deliberate.</p>
<p dir="auto"><strong>The short version:</strong> generating a word normally means reading the whole model from memory once. If the next few words are predictable, Caterpillar drafts a guess and checks several words in a <em>single</em> pass instead of one pass each.</p>
<p dir="auto">Two things worth knowing:</p>
<ol>
<li><strong>It is lossless.</strong> You get exactly the same words you would have got anyway — it's verified against the real model, not an approximation. If a guess is wrong it's thrown away.</li>
<li><strong>It steps aside when it isn't helping.</strong> On normal prose, guesses rarely land, so it stops trying rather than making you pay for failed guesses.</li>
</ol>
<p dir="auto">So the honest summary is: sometimes much faster, never slower in a way you'd notice, never different output.</p>
<p dir="auto">Anyone seen a big speed-up on a particular kind of prompt?</p>
]]></description><link>https://community.lizard-llm.qendryx.com/topic/8/speculative-decoding-why-repetitive-text-suddenly-runs-faster</link><generator>RSS for Node</generator><lastBuildDate>Mon, 24 Aug 2026 01:37:03 GMT</lastBuildDate><atom:link href="https://community.lizard-llm.qendryx.com/topic/8.rss" rel="self" type="application/rss+xml"/><pubDate>Tue, 14 Jul 2026 10:59:00 GMT</pubDate><ttl>60</ttl></channel></rss>