FLORA: Fine-grained Low-Rank Architecture Search for Vision Transformer
Not on the map. Why?
Abstract (arXiv)
Vision Transformers (ViT) have recently demonstrated success across a myriad of computer vision tasks. However, their elevated computational demands pose significant challenges for real-world deployment. While low-rank approximation stands out as a renowned method to reduce computational loads, efficiently automating the target rank selection in ViT remains a challenge. Drawing from the notable similarity and alignment between the processes of rank selection and One-Shot NAS, we introduce FLORA, an end-to-end automatic framework based on NAS. To overcome the design challenge of supernet posed by vast search space, FLORA employs a low-rank aware candidate filtering strategy. This method adeptly identifies and eliminates underperforming candidates, effectively alleviating potential undertraining and interference among subnetworks. To further enhance the quality of low-rank supernets, we design a low-rank specific training paradigm. First, we propose weight inheritance to construct supernet and enable gradient sharing among low-rank modules. Secondly, we adopt low-rank aware sampling to strategically allocate training resources, taking into account inherited information from pre-trained models. Empirical results underscore FLORA's efficacy. With our method, a more fine-grained rank configuration can be generated automatically and yield up to 33% extra FLOPs reduction compared to a simple uniform configuration. More specific, FLORA-DeiT-B/FLORA-Swin-B can save up to 55%/42% FLOPs almost without performance degradtion. Importantly, FLORA boasts both versatility and orthogonality, offering an extra 21%-26% FLOPs reduction when integrated with leading compression techniques or compact hybrid structures. Our code is publicly available at https://github.com/shadowpa0327/FLORA.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 39 of its 51 references that are in the map. First posted on arXiv 7 Nov 2023.
Builds on
39 of 51 references.
References · 39
- 2017Attention Is All You Needcited by 60,361
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
- 2018DARTS: Differentiable Architecture Searchcited by 1,798
- 2021Scaling Vision Transformerscited by 999
- 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 864
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 787
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 676
- 2018ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardwarecited by 673
- 2021MobileViT: Light-weight, General-purpose, and Mobile-friendly Vision Transformercited by 642
- 2019Reducing Transformer Depth on Demand with Structured Dropoutcited by 439
27 more
- 2019Single Path One-Shot Neural Architecture Search with Uniform Samplingcited by 414
- 2021AdaViT: Adaptive Tokens for Efficient Vision Transformercited by 362
- 2018Slimmable Neural Networkscited by 305
- 2021Post-Training Quantization for Vision Transformercited by 278
- 2020DynaBERT: Dynamic BERT with Adaptive Width and Depthcited by 251
- 2022TinyViT: Fast Pretraining Distillation for Small Vision Transformerscited by 234
- 2019Universally Slimmable Networks and Improved Training Techniquescited by 221
- 2014Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decompositioncited by 203
- 2017SMASH: One-Shot Model Architecture Search through HyperNetworkscited by 202
- 2020BigNAS: Scaling Up Neural Architecture Search with Big Single-Stage Modelscited by 188
- 2021AutoFormer: Searching Transformers for Visual Recognitioncited by 188
- 2021Chasing Sparsity in Vision Transformers: An End-to-End Explorationcited by 183
- 2015Compression of Deep Convolutional Neural Networks for Fast and Low Power Mobile Applicationscited by 162
- 2021Patch Slimming for Efficient Vision Transformerscited by 133
- 2021Scatterbrain: Unifying Sparse and Low-rank Attention Approximationcited by 130
- 2015Convolutional neural networks with low-rank regularizationcited by 103
- 2022Contrastive Learning Rivals Masked Image Modeling in Fine-tuning via Feature Distillationcited by 93
- 2019Single-Path NAS: Designing Hardware-Efficient ConvNets in less than 4 Hourscited by 87
- 2022Unified Visual Transformer Compressioncited by 79
- 2021GLiT: Neural Architecture Search for Global and Local Image Transformercited by 53
- 2019Lightweight and Efficient End-to-End Speech Recognition Using Low-Rank Transformercited by 47
- 2020TRP: Trained Rank Pruning for Efficient Deep Neural Networkscited by 32
- 2021OmniNet: Omnidirectional Representations from Transformerscited by 23
- 2023HALOC: Hardware-Aware Automatic Low-Rank Compression for Compact Neural Networkscited by 20
- 2019Understanding Neural Architecture Search Techniquescited by 12
- 2019Learning Low-Rank Approximation for CNNscited by 7
- 2022SVD-NAS: Coupling Low-Rank Approximation and Neural Architecture Searchcited by 3
Built on by
Citing papers per year: 2024: 1; 2025: 1; 2026: 1.
3 papers.
- 2026Mind the Approximation: Fisher-Weighted SVD Compression for ViTs7 Sep 2026
- 2025Data Efficient Adaptation in Large Language Models via Continuous Low-Rank Fine-Tuning23 Sep 2025
- 2024Unified Framework for Pre-trained Neural Network Compression via Decomposition and Optimized Rank Selection5 Sep 2024