Model Casting and Low-Parameter Gating: Towards More Sparsely Activated FFNs
Not on the map. Why?
Abstract (arXiv)
This paper introduces model casting, a mid-training recipe that drastically sparsifies the activations within the Feed-Forward Network (FFN) layer. With this strategy, at inference time, we first compute the output of the gating matrix and, thanks to its high sparsity, we avoid computations with the two other matrices, reducing the FLOP count by up to 3x. While this theoretical speedup is an upper bound, model casting translates into significant speedups both on CPU and GPU. We then introduce LoPA Gating, a new FFN design that increases the maximum theoretical speedup. It is a low-FLOPs parameterization of the gating matrix that overcomes the 3x cap by allocating fewer FLOPs and parameters to the gating matrix, compared to the two other FFN matrices that are sparsely activated. We consider two cases: (i) we cast a pre-trained model with a sparsity inducing activation; (ii) we train with LoPA from scratch. In all settings, we significantly outperform existing pruning solutions and regular RELU-fication. For instance, at matched quality, we achieve a 3.2x FLOP speedup with LoPA Casting, against 1.6x at best for competing methods top-p and TEAL. Using dedicated kernels, we achieve an actual 3.31x speed-up on GPU at 90% sparsity, past the 3x ceiling of standard gating; RELU-fication, meanwhile, plateaus below 80% sparsity.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 41 of its 49 references that are in the map. First posted on arXiv 25 Sep 2026.
Builds on
41 of 49 references.
References · 41
- 2017Attention Is All You Needcited by 60,361
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2024Qwen2.5 Technical Reportcited by 4,942
- 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
- 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
- 2021Program Synthesis with Large Language Modelscited by 3,637
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,512
29 more
- 2022Training Compute-Optimal Large Language Modelscited by 3,019
- 2017TriviaQA: A Large Scale Distantly Supervised Challenge Dataset for Reading Comprehensioncited by 2,955
- 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,883
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,164
- 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,998
- 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,822
- 2020GLU Variants Improve Transformercited by 1,804
- 2019Root Mean Square Layer Normalizationcited by 1,480
- 2023Is Your Code Generated by ChatGPT Really Correct? Rigorous Evaluation of Large Language Models for Code Generationcited by 1,391
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
- 2023Instruction-Following Evaluation for Large Language Modelscited by 1,228
- 2017RACE: Large-scale ReAding Comprehension Dataset From Examinationscited by 861
- 2016Language Modeling with Gated Convolutional Networkscited by 702
- 2023Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Timecited by 252
- 2023PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPUcited by 217
- 2022The Lazy Neuron Phenomenon: On Emergence of Activation Sparsity in Transformerscited by 122
- 2023ReLU Strikes Back: Exploiting Activation Sparsity in Large Language Modelscited by 94
- 2024ReLU2 Wins: Discovering Efficient Activation Functions for Sparse LLMscited by 67
- 2024Skywork-MoE: A Deep Dive into Training Techniques for Mixture-of-Experts Language Modelscited by 59
- 2024Training-Free Activation Sparsity in Large Language Modelscited by 55
- 2024ReMoE: Fully Differentiable Mixture-of-Experts with ReLU Routingcited by 54
- 2024SLTrain: a sparse plus low-rank approach for parameter and memory efficient pretrainingcited by 45
- 2024Sparsing Law: Towards Large Language Models with Greater Activation Sparsitycited by 22
- 2025R-Sparse: Rank-Aware Activation Sparsity for Efficient LLM Inferencecited by 21
- 2025Universal Properties of Activation Sparsity in Modern Large Language Modelscited by 7
- 2025La RoSA: Enhancing LLM Efficiency via Layerwise Rotated Sparse Activationcited by 6
- 2026Self-Pruned Key-Value Attention: Learning When to Write by Predicting Future Utilitycited by 2
- 2026Structural Correspondence and Universal Approximation in Diagonal plus Low-Rank Neural Networkscited by 1
Built on by
Not cited yet.