<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Sparse Models on Nalar</title>
    <link>https://nalar.dev/tags/sparse-models/</link>
    <description>Recent content in Sparse Models on Nalar</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Thu, 24 Sep 2026 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://nalar.dev/tags/sparse-models/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Expert Capacity Turns Uneven MoE Routing into Token Overflow</title>
      <link>https://nalar.dev/expert-capacity-turns-uneven-moe-routing-into-token-overflow/</link>
      <pubDate>Thu, 24 Sep 2026 00:00:00 +0000</pubDate>
      <guid>https://nalar.dev/expert-capacity-turns-uneven-moe-routing-into-token-overflow/</guid>
      <description>&lt;p&gt;A sparse Mixture-of-Experts layer can route many tokens toward the same expert even when every expert has identical nominal capacity. The router makes token-dependent choices, while distributed execution commonly allocates bounded token slots per expert. When those two mechanisms disagree, an expert can receive more assignments than its execution buffer admits.&lt;/p&gt;&#xA;&lt;p&gt;That boundary is not an inherent property of every MoE architecture. It is a property of capacity-constrained routing designs, including the routing formulation described for Switch Transformers. In such systems, expert capacity converts an uneven routing distribution into an operational event: some assignments fit, while assignments beyond the capacity limit require an explicit overflow policy.&lt;/p&gt;</description>
    </item>
    <item>
      <title>MoE Expert Capacity Bounds Token Routing</title>
      <link>https://nalar.dev/moe-expert-capacity-bounds-token-routing/</link>
      <pubDate>Thu, 24 Sep 2026 00:00:00 +0000</pubDate>
      <guid>https://nalar.dev/moe-expert-capacity-bounds-token-routing/</guid>
      <description>&lt;p&gt;A sparse Mixture-of-Experts layer can contain many expert networks while activating only a small subset for each token. That conditional computation depends on a router, but router scores alone do not determine the executed graph. In implementations with bounded expert batches, each expert also has a finite number of token slots.&lt;/p&gt;&#xA;&lt;p&gt;This creates a second boundary after expert selection: a token can prefer an expert that has no remaining capacity. The handling of that overflow is an implementation and architecture choice with direct consequences for training and serving.&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
