Signals 4 · free daily AI digest

How Sparse Probability Maps Shape Mixture-of-Experts Routing

Paper recorded by Signals 4 on 2026-10-05 in cs.CL. Abstract reproduced from arXiv; link to the original below.

Published 2026-10-05 on arXiv · recorded by Signals 4 on 2026-10-06

Category: cs.CL · 自然语言处理 · first seen 2026-10-06

Abstract

Mixture-of-experts (MoE) routers typically apply softmax to the router scores and keep the top-K experts, making every token use exactly K experts. Sparsity-inducing probability maps such as sparsemax, alpha-entmax and normmax can adaptively assign exact zeros to selected experts, and therefore appear to offer token-dependent expert participation, even when using the same top-K machinery. In this

Read on arXiv →

#330 most recent of 660 cs.CL papers we have recorded · ↑ newer: Aligning Multimodal Patient Evidence with Biomedical Knowledge Graphs · ↓ older: The Pushback Paradox: A Two-Probe Diagnostic for Language Model Compli
Cite this page: How Sparse Probability Maps Shape Mixture-of-Experts Routing: the #330 most recent of 660 cs.CL papers we have recorded (as of 2026-10-05). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/how-sparse-probability-maps-shape-mixture-of-experts-routing.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.CL papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions