TOAST: Transformer Optimization using Adaptive and Simple Transformations
Not on the map. Why?
Abstract (arXiv)
Foundation models achieve state-of-the-art performance across different tasks, but their size and computational demands raise concerns about accessibility and sustainability. Existing efficiency methods often require additional retraining or finetuning, limiting their practicality. Recent findings suggest that deep neural networks exhibit internal representation similarities. While such similarities across different models have been exploited for enabling techniques such as model stitching and merging, intra-network redundancy remains underexplored as a source for efficiency gains. In this paper, we introduce Transformer Optimization using Adaptive and Simple Transformations (TOAST), a framework that exploits these redundancies to approximate entire transformer blocks with lightweight closed-form mappings, such as linear transformations or even the identity function, without any additional training. Across state-of-the-art pretrained vision models (e.g., ViT, DINOv2, DeiT) and datasets ranging from MNIST to ImageNet-1k, TOAST reduces parameters and computation while preserving, and in some cases improving, downstream performance. These results show that large portions of transformer depth can be replaced by trivial functions, opening a new perspective on efficient foundation models.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 42 of its 54 references that are in the map. First posted on arXiv 7 Oct 2024.
Builds on
42 of 54 references.
References · 42
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,974
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2022LAION-5B: An open large-scale dataset for training next generation image-text modelscited by 4,152
- 2015Character-level Convolutional Networks for Text Classificationcited by 2,330
- 2019Similarity of Neural Network Representations Revisitedcited by 1,755
- 2016Semantic Understanding of Scenes through the ADE20K Datasetcited by 1,069
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 800
- 2023LLM-Pruner: On the Structural Pruning of Large Language Modelscited by 650
30 more
- 2019A Large-scale Study of Representation Learning with the Visual Task Adaptation Benchmarkcited by 425
- 2020DeeBERT: Dynamic Early Exiting for Accelerating BERT Inferencecited by 332
- 2018Insights on representational similarity in neural networks with canonical correlationcited by 324
- 2020BERT Loses Patience: Fast and Robust Inference with Early Exitcited by 273
- 2020Do Wide and Deep Networks Learn the Same Things? Uncovering How Neural Network Representations Vary with Width and Depthcited by 245
- 2022EfficientFormer: Vision Transformers at MobileNet Speedcited by 241
- 2022Relative representations enable zero-shot latent space communicationcited by 191
- 2017BlockDrop: Dynamic Inference Paths in Residual Networkscited by 189
- 2017Convolutional Networks with Adaptive Inference Graphscited by 148
- 2023Similarity of Neural Network Models: A Survey of Functional and Representational Measurescited by 131
- 2020On the Effect of Dropping Layers of Pre-trained Transformer Modelscited by 118
- 2022EdgeViTs: Competing Light-weight CNNs on Mobile Devices with Vision Transformerscited by 116
- 2023The geometry of hidden representations of large transformer modelscited by 112
- 2022Better plain ViT baselines for ImageNet-1kcited by 98
- 2020Accelerating Training of Transformer-Based Language Models with Progressive Layer Droppingcited by 93
- 2022Reliability of CKA as a Similarity Measure in Deep Learningcited by 87
- 2021Representation Topology Divergence: A Method for Comparing Neural Network Representationscited by 66
- 2023Latent Space Translation via Semantic Alignmentcited by 52
- 2022ASIF: Coupled Data Turns Unimodal Models to Multimodal Without Trainingcited by 47
- 2022You Need Multiple Exiting: Dynamic Early Exiting for Accelerating Unified Vision Language Modelcited by 43
- 2023Skip-Attention: Improving Vision Transformers by Paying Less Attentioncited by 24
- 2023Unified Data-Free Compression: Pruning and Quantization without Fine-Tuningcited by 23
- 2023From Bricks to Bridges: Product of Invariances to Enhance Latent Space Communicationcited by 21
- 2023Can Unstructured Pruning Reduce the Depth in Deep Neural Networks?cited by 20
- 2022Practical Network Acceleration with Tiny Setscited by 10
- 2023Topological Data Analysis for Neural Network Analysis: A Comprehensive Surveycited by 9
- 2024Dense Vision Transformer Compression with Few Samplescited by 9
- 2023Bootstrapping Parallel Anchors for Relative Representationscited by 8
- 2022Internal Representations of Vision Models Through the Lens of Frames on Data Manifoldscited by 3
- 2023From Charts to Atlas: Merging Latent Spaces into Onecited by 3
Built on by
Citing papers per year: 2026: 3.
3 papers.