Your Transformer Is Secretly Elastic
Not on the map. Why?
Abstract (arXiv)
Scaling up transformers has produced models with broad capabilities, deployed across heterogeneous hardware and fluctuating workloads. Yet, model families offer only a few fixed sizes (e.g., S, B, L), forcing users to commit to a model based on hardware and latency constraints. This rigidity is often suboptimal under varying query loads. We introduce a retraining-free method that elastifies pre-trained transformers into a single model that adapts on-the-fly across a continuum of computational budgets. Our key contribution is a differentiable relaxation of the functional unit-ranking problem: unlike prior work, which optimizes a single importance weight per MLP block or attention head, we rank every individual MLP neuron and attention head jointly, on a common scale, by minimizing the model's loss under soft pruning across many sparsity targets, all at once. Across 27 vision and text transformer encoders ranging from 22M to 8B parameters, our method yields smooth degradation up to 60% sparsity and outperforms one-shot baselines under deep pruning. For example, pruning DINOv3 ViT-H+/16 to 50% sparsity removes 427M parameters while reducing ImageNet-1k linear-probing accuracy by only 0.8%, without the need for weight correction or retraining. At 60% sparsity, a pruned AugReg ViT-B/16 model achieves up to 1.80× higher throughput and 1.26× lower single-query latency on an A100 GPU. Elastic models are produced in minutes, with construction time scaling sub-linearly with parameter count.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 68 of its 82 references that are in the map. First posted on arXiv 14 Oct 2026.
Builds on
68 of 82 references.
References · 68
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,968
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
- 2023Sigmoid Loss for Language Image Pre-Trainingcited by 3,109
- 2017Billion-scale similarity search with GPUscited by 2,497
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
- 2013Describing Textures in the Wildcited by 2,125
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
- 2020GLU Variants Improve Transformercited by 1,804
- 2013Fine-Grained Visual Classification of Aircraftcited by 1,726
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,605
- 2025DINOv3cited by 1,414
38 more
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,346
- 2025Qwen3 Embedding: Advancing Text Embedding and Reranking Through Foundation Modelscited by 1,261
- 2022Text Embeddings by Weakly-Supervised Contrastive Pre-trainingcited by 1,253
- 2021BEIR: A Heterogenous Benchmark for Zero-shot Evaluation of Information Retrieval Modelscited by 1,252
- 2025SigLIP 2: Multilingual Vision-Language Encoders with Improved Semantic Understanding, Localization, and Dense Featurescited by 1,188
- 2016Pruning Filters for Efficient ConvNetscited by 1,143
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,121
- 2022Token Merging: Your ViT But Fastercited by 1,021
- 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 864
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 856
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 797
- 2022MTEB: Massive Text Embedding Benchmarkcited by 640
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
- 2023C-Pack: Packed Resources For General Chinese Embeddingscited by 578
- 2021How to train your ViT? Data, Augmentation, and Regularization in Vision Transformerscited by 569
- 2019Importance Estimation for Neural Network Pruningcited by 541
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 439
- 2022DeiT III: Revenge of the ViTcited by 419
- 2023Sheared LLaMA: Accelerating Language Model Pre-training via Structured Pruningcited by 415
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 403
- 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 332
- 2018Slimmable Neural Networkscited by 305
- 2023Improving Text Embeddings with Large Language Modelscited by 303
- 2020BERT Loses Patience: Fast and Robust Inference with Early Exitcited by 273
- 2019Universally Slimmable Networks and Improved Training Techniquescited by 221
- 2022Structured Pruning Learns Compact and Accurate Modelscited by 170
- 2021SPViT: Enabling Faster Vision Transformers via Soft Token Pruningcited by 167
- 2022A Fast Post-Training Pruning Framework for Transformerscited by 162
- 2020Soft Threshold Weight Reparameterization for Learnable Sparsitycited by 151
- 2021Patch Slimming for Efficient Vision Transformerscited by 133
- 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 126
- 2023Token Fusion: Bridging the Gap between Token Pruning and Token Mergingcited by 125
- 2023Jina Embeddings 2: 8192-Token General-Purpose Text Embeddings for Long Documentscited by 104
- 2019Winning the Lottery with Continuous Sparsificationcited by 100
- 2023MatFormer: Nested Transformer for Elastic Inferencecited by 85
- 2025Scaling Language-Free Visual Representation Learningcited by 66
- 2021Differentiable Subset Pruning of Transformer Headscited by 47
50 most cited of 68 All 68 (JSON)
Built on by
Not cited yet.