WeSearch

Sticky Routing: Training MoE Models for Memory-Efficient Inference

·2 min read · 0 reactions · 0 comments · 1 view
#sticky#routing#training#models#memory-efficient
Sticky Routing: Training MoE Models for Memory-Efficient Inference
TL;DR · WeSearch summary

Existing remedies are either system-level (caching heuristics) or post-hoc (router fine-tuning), leaving the root cause unchanged during pretraining. We propose StickyMoE, a differentiable routing consistency loss that penalises abrupt expert switches between adjacent tokens, encouraging the router to maintain the same expert assignment across semantically coherent spans. StickyMoE requires no architectural changes, adds a single hyperparameter lambda, and unlike post-hoc methods, allows expert representations and routing decisions to co-adapt from the first training step.

Key facts
Original article
arXiv cs.AI
Read full at arXiv cs.AI →
Opening excerpt (first ~120 words) tap to expand

Computer Science > Machine Learning arXiv:2607.08780 (cs) [Submitted on 12 Jun 2026] Title:Sticky Routing: Training MoE Models for Memory-Efficient Inference Authors:Ali Kayyam View a PDF of the paper titled Sticky Routing: Training MoE Models for Memory-Efficient Inference, by Ali Kayyam View PDF HTML (experimental) Abstract:Mixture-of-Experts (MoE) models activate only a sparse subset of experts per token, yet consecutive tokens frequently activate different experts -- causing constant weight swapping between slow storage and fast memory on edge devices. Existing remedies are either system-level (caching heuristics) or post-hoc (router fine-tuning), leaving the root cause unchanged during pretraining.

Excerpt limited to ~120 words for fair-use compliance. The full article is at arXiv cs.AI.

Anonymous · no account needed
Share 𝕏 Facebook Reddit LinkedIn Threads WhatsApp Bluesky Mastodon Email

Discussion

0 comments

More from arXiv cs.AI