mlsanityData to 14 Oct 2026

N-vium: Mixture-of-Exits Transformer for Accelerated Exact Generation

arXiv 2605.13190 ↗First posted 13 May 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Improving the inference efficiency of autoregressive transformers typically means reducing FLOPs per token, usually through approximations that degrade model quality. We introduce N-vium, a mixture-of-exits transformer that partially parallelizes computation across depth on standard hardware, increasing effective FLOPs per second rather than minimizing compute per token. N-vium attaches prediction heads at multiple depths and defines the next-token distribution as a learned mixture over these exits, with token-adaptive routing. This formulation strictly generalizes the standard transformer, which is recovered exactly when routing assigns zero mass to all intermediate heads. Sampling from the mixture is exact, and complete KV caches are recovered by deferring the upper-layer computation and batching it with later tokens. We pretrain N-vium at scales up to 1.5B parameters. Our largest model reaches 57.9% wall-clock speedup over a parameter- and data-matched standard transformer at no perplexity cost.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 50 of its 60 references that are in the map. First posted on arXiv 13 May 2026.

Builds on

50 of 60 references.

References · 50

  1. 2020Language Models are Few-Shot Learnerscited by 32,419
  2. 2022Training language models to follow instructions with human feedbackcited by 15,971
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
  4. 2015Distilling the Knowledge in a Neural Networkcited by 10,324
  5. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
  6. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  7. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
  8. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  9. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,307
  10. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  11. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
  12. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
38 more
  1. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
  2. 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,786
  3. 2022Fast Inference from Transformers via Speculative Decodingcited by 1,653
  4. 2020MiniLM: Deep Self-Attention Distillation for Task-Agnostic Compression of Pre-Trained Transformerscited by 1,463
  5. 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
  6. 2019TinyBERT: Distilling BERT for Natural Language Understandingcited by 1,167
  7. 2023Accelerating Large Language Model Decoding with Speculative Samplingcited by 1,006
  8. 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 897
  9. 2019Are Sixteen Heads Really Better than One?cited by 816
  10. 2018Universal Transformerscited by 647
  11. 2022Mixture-of-Experts with Expert Choice Routingcited by 623
  12. 2023Eliciting Latent Predictions from Transformers with the Tuned Lenscited by 623
  13. 2022Transformer Feed-Forward Layers Build Predictions by Promoting Concepts in the Vocabulary Spacecited by 532
  14. 2016Adaptive Computation Time for Recurrent Neural Networkscited by 506
  15. 2020MobileBERT: a Compact Task-Agnostic BERT for Resource-Limited Devicescited by 482
  16. 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 439
  17. 2021AdaViT: Adaptive Tokens for Efficient Vision Transformercited by 362
  18. 2019Q-BERT: Hessian Based Ultra Low Precision Quantization of BERTcited by 359
  19. 2017SkipNet: Learning Dynamic Routing in Convolutional Networkscited by 332
  20. 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 332
  21. 2018Blockwise Parallel Decoding for Deep Autoregressive Modelscited by 323
  22. 2022Confident Adaptive Language Modelingcited by 310
  23. 2024LayerSkip: Enabling Early Exit Inference and Self-Speculative Decodingcited by 307
  24. 2020BERT Loses Patience: Fast and Robust Inference with Early Exitcited by 273
  25. 2024Unlocking Efficiency in Large Language Model Inference: A Comprehensive Survey of Speculative Decodingcited by 269
  26. 2024Mixture-of-Depths: Dynamically allocating compute in transformer-based language modelscited by 258
  27. 2020DynaBERT: Dynamic BERT with Adaptive Width and Depthcited by 251
  28. 2019Depth-Adaptive Transformercited by 236
  29. 2020BinaryBERT: Pushing the Limit of BERT Quantizationcited by 178
  30. 2025Scaling Latent Reasoning via Looped Language Modelscited by 165
  31. 2025Mixture-of-Recursions: Learning Dynamic Recursive Depths for Adaptive Token-Level Computationcited by 133
  32. 2023SkipDecode: Autoregressive Skip Decoding with Batching and Caching for Efficient LLM Inferencecited by 89
  33. 2023Fast and Robust Early-Exiting Framework for Autoregressive Language Models with Synchronized Parallel Decodingcited by 80
  34. 2021Consistent Accelerated Inference via Confident Adaptive Transformerscited by 74
  35. 2023ConsistentEE: A Consistent and Hardness-Guided Early Exiting Method for Accelerating Language Models Inferencecited by 13
  36. 2024Early Exit Is a Natural Capability in Transformer-based Models: An Empirical Study on Early Exit without Joint Optimizationcited by 9
  37. 2023Sorted LLaMA: Unlocking the Potential of Intermediate Layers of Large Language Models for Dynamic Inferencecited by 7
  38. 2024Duo-LLM: A Framework for Studying Adaptive Computation in Large Language Modelscited by 7

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2022DeepSpeed Inference: Enabling Efficient Inference of Transformer Models at Unprecedented Scale
  2. 2026FlashLoop: Fast and Memory-Efficient Looped Transformers via Lazy Updates
  3. 2026The Recurrent Transformer: Greater Effective Depth and Efficient Decoding
  4. 2026SMELT: Scaling Laws for Compute-Matched MoE Looped Transformers
  5. 2026The Residual Stream Is All You Need: On the Redundancy of the KV Cache in Transformer Inference
  6. 2026Stochastic KV Routing: Enabling Adaptive Depth-Wise Cache Sharing
  7. 2026Beyond Token Eviction: Mixed-Dimension Budget Allocation for Efficient KV Cache Compression
  8. 2026LEAP: Layer-wise Exit-Aware Pretraining for Efficient Transformer Inference