NTH

Channel Selection for Mixture-of-Experts Decoding Needs No Calibration Data

AuthorsGeunhyoung Kim, Sung Ju Hwang

AffiliationsKAIST · DeepAuto.ai

October 29, 2026 2 min read
Watch on YouTube
The one-line take

A calibration-free way to skip most MoE expert-channel reads aims to make decoding faster while preserving model quality.

Key results

40
Top-k matches or beats calibrated thresholds

Of 43 comparisons at calibrated budgets.

98.1%
Accuracy retained

Mean full-model accuracy retained across three post-trained MoE models.

17.8%
Routed-expert reads

Read budget for the reader achieving 98.1% mean accuracy retention.

1.88
Maximum whole-model speedup

Peak decoding speedup over optimized vLLM.

2.69
Maximum MoE-block speedup

Peak decoding speedup over optimized vLLM.

What the paper found

Mixture-of-Experts decoding is often limited by the cost of fetching expert weights from memory, so channel selectors try to compute only the channels most relevant to each token. This paper finds that calibration is unnecessary: a fixed threshold does not guarantee a predictable read budget, and top-k selection—keeping a fixed number of highest-scoring channels—matched or beat calibrated thresholds in 40 of 43 comparisons. The authors also show that thresholds can trigger repetition loops in Gemma 4 during long reasoning. Their alternative, a reader built solely from model weights, ranks channels using a rotated ternary sketch and estimates skipped-channel contributions with a rank-32 low-rank recovery map. Across Qwen3-Thinking, Gemma 4, and Qwen3.5, it retains 98.1% of full-model accuracy while reading 17.8% of routed-expert weights. Triton kernels running in vLLM on NVIDIA hardware speed up whole-model decoding by up to 1.88× and MoE blocks by up to 2.69× compared with optimized vLLM. The results suggest that reliable channel ranking and recovery matter more than fitting selection thresholds to calibration data.

Original abstract

Mixture-of-Experts (MoE) models are bottlenecked by loading routed-expert weights from memory during interactive decoding at small batch sizes. Because most intermediate channels in a routed expert contribute little to any single token, channel selectors predict which channels matter and read only their weights, typically keeping channels above a threshold calibrated on offline data. We show that channel selection needs no calibration data. First, a calibrated threshold does not fix how much a selector reads, because the number of channels passing it varies across inputs; Prox with thresholds calibrated for an 18% read budget actually reads only 12.9% on average across our benchmarks. Second, top-k keeps each token's k highest-scoring channels and needs no calibration data. At the calibrated budget, a selector's top-k version matches or beats its threshold version on the same score in 40 of 43 comparisons at 13% and 18% budgets, including all 23 on generation tasks. The top-k versions also avoid the repetition-loop collapse that calibrated thresholds cause on Gemma 4. Calibrating a threshold thus provides neither of the two things selectors use it for: a known read budget and a consistent accuracy gain at that budget. We furthermore introduce a reader built entirely from the model's weights, which screens channels with a ternary sketch and recovers the skipped ones with a low-rank map. Across three post-trained MoE models, our reader retains 98.1% of full-model accuracy at 17.8% of routed-expert reads, with Triton kernels running MoE blocks 1.60 to 1.90x faster than optimized vLLM at batch one and up to 2.69x at larger batches on the same three models.

Read the original paper

More in Efficient AI

Browse all 70 papers →
03Efficiency

Rethinking Sequence Compression with Test-time Regression

Sihan Yang, Jie Huang, Hanxuan Li, Yifan Guo, Weigao Sun, Yiran Zhong, Weiyang Liu

A new regression-based compressor aims to keep language and vision models efficient while preserving more useful information in fewer tokens.

Read analysis