STAPLE: Static Sparse Upcycling of Pretrained Checkpoints via Embedding Modules
In this work, we introduce STAPLE, a recipe built upon STEM for integrating static sparse memory into pretrained models.
ProofPaper ↗
Key points
- Sparse computation can scale the parametric capacity of LLMs without proportionally increasing active computation, but pretraining sparse architectures remains expensive and data-hungry.
- Existing sparse upcycling methods mainly target Mixture-of-Experts models, where expert homogeneity, sample inefficiency, and system overheads can limit practical scalability.
- Static sparse memory offers predictable access and token-specific updates that can help address these challenges, but naively integrating it into pretrained computation yields poor returns.
- Importantly, despite introducing billions of parameters late in training, our host-offloaded implementation keeps generation throughput within 1.5% and training throughput within 3% of the dense baseline, while caching only the 5% most frequent embeddings on GPU.
Sources (1)
- [1]STAPLE: Static Sparse Upcycling of Pretrained Checkpoints via Embedding ModulesarXiv (AI, ML, NLP, CV, robotics, multi-agent) · Oct 8, 06:21 PM
In this work, we introduce STAPLE, a recipe built upon STEM for integrating static sparse memory into pretrained models.
Sparse computation can scale the parametric capacity of LLMs without proportionally increasing active computation, but pretraining sparse architectures remains expensive and data-hungry.
Extractive summary: sentences quoted from the sources.
Before this
- Oct 8, 2026Understanding Jev, the new model everyone is talking about
- Oct 8, 2026MiMo-V2.6: Scaling Reinforcement Learning Towards Self-Improvement
- Oct 8, 2026One Block, Multiple Depths: Recurrent Vision Transformers with Depth-Programmed Experts
- Oct 8, 2026Launching an opt-in vulnerability-finding service for open-source software
- Oct 8, 2026Reflex: Visually Grounded Reactive Humanoid Control
- Oct 7, 2026browser-use/browser-use 0.13.11