<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Speculative Decoding on Nalar</title>
    <link>https://nalar.dev/tags/speculative-decoding/</link>
    <description>Recent content in Speculative Decoding on Nalar</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Sat, 12 Sep 2026 00:00:00 +0700</lastBuildDate>
    <atom:link href="https://nalar.dev/tags/speculative-decoding/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Speculative Decoding Depends on Draft Acceptance</title>
      <link>https://nalar.dev/speculative-decoding-depends-on-draft-acceptance/</link>
      <pubDate>Sat, 12 Sep 2026 00:00:00 +0700</pubDate>
      <guid>https://nalar.dev/speculative-decoding-depends-on-draft-acceptance/</guid>
      <description>&lt;p&gt;Autoregressive generation normally commits one token after each model pass, creating a serial dependency across the output sequence. Speculative decoding changes that execution pattern. A cheaper draft process proposes several future tokens, then the target model evaluates those proposals together and determines which tokens can be committed.&lt;/p&gt;&#xA;&lt;p&gt;The attraction is fewer serial target-model iterations per generated token. That does not make speculative decoding an automatic latency reduction. Its useful operating point depends on how cheaply candidates are produced, how many survive verification, and how much extra work the target model performs while checking them.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
