<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Top-P Sampling on Nalar</title>
    <link>https://nalar.dev/tags/top-p-sampling/</link>
    <description>Recent content in Top-P Sampling on Nalar</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Tue, 22 Sep 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://nalar.dev/tags/top-p-sampling/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Top-p Sampling Rebuilds Its Candidate Set at Every Token</title>
      <link>https://nalar.dev/top-p-sampling-rebuilds-its-candidate-set-at-every-token/</link>
      <pubDate>Tue, 22 Sep 2026 00:00:00 +0000</pubDate>
      <guid>https://nalar.dev/top-p-sampling-rebuilds-its-candidate-set-at-every-token/</guid>
      <description>&lt;p&gt;Top-p sampling does not keep a fixed shortlist of tokens throughout generation. At each decoding step, the model produces a new logit vector, that vector becomes a probability distribution, and the sampler forms a new candidate set whose cumulative probability mass reaches the configured threshold.&lt;/p&gt;&#xA;&lt;p&gt;The consequence is easy to miss in serving code: the same &lt;code&gt;top_p&lt;/code&gt; value can admit two tokens at one step and dozens at another. The parameter controls probability mass, not candidate count.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
