BALF: Budgeted Activation-Aware Low-Rank Factorization for Fine-Tuning-Free Model Compression
Not on the map. Why?
Abstract (arXiv)
Activation-aware low-rank factorization techniques yield strong compression results but are generally confined to linear layers, while existing whitening-based theory typically makes an implicit full-rank assumption on activations. We introduce a layer representation framework that extends activation-aware factorization beyond linear layers, including standard and grouped convolutions. Within this framework, our whitening-based formulation is more general than prior ones, naturally covering rank-deficient activations, and yields an optimal low-rank projection that attains the reconstruction error of the best low-rank approximation to layer activations. The resulting singular spectrum provides a closed-form per-layer distortion proxy, which we use to allocate per-layer ranks under explicit FLOP or parameter-count budgets via a Lagrangian relaxation with negligible overhead. Together, these components form BALF, an end-to-end pipeline for efficient vision model compression. Across CNNs and vision transformers on CIFAR-10 and ImageNet-1K, BALF generally achieves higher accuracy than SVD-based factorization baselines at matched FLOP or parameter count targets and remains competitive with other fine-tuning-free compression techniques.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 37 of its 66 references that are in the map. First posted on arXiv 29 Sep 2025.
Builds on
37 of 66 references.
References · 37
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,795
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
- 2016Gaussian Error Linear Units (GELUs)cited by 3,502
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
- 2016Aggregated Residual Transformations for Deep Neural Networkscited by 2,546
- 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,593
- 2019Do ImageNet Classifiers Generalize to ImageNet?cited by 1,515
25 more
- 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 815
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 527
- 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 322
- 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 306
- 2017Parseval Networks: Improving Robustness to Adversarial Examplescited by 293
- 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 284
- 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 243
- 2014Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decompositioncited by 203
- 2015Accelerating Very Deep Convolutional Networks for Classification and Detectioncited by 109
- 2015Optimal whitening and decorrelationcited by 97
- 2020Stable Low-rank Tensor Decomposition for Compression of Convolutional Neural Networkcited by 74
- 2025SVD-LLM V2: Optimizing Singular Value Truncation for Large Language Model Compressioncited by 67
- 2020Learning Low-rank Deep Neural Networks via Singular Vector Orthogonality Regularization and Singular Value Sparsificationcited by 53
- 2021Towards Efficient Tensor Decomposition-Based DNN Model Compression with Optimization Frameworkcited by 52
- 2025Dobi-SVD: Differentiable SVD for LLM Compression and Some New Perspectivescited by 48
- 2021Compressing Neural Networks: Towards Determining the Optimal Layer-wise Decompositioncited by 33
- 2023GTP-ViT: Efficient Vision Transformers via Graph-based Token Propagationcited by 19
- 2023Going Beyond Neural Network Feature Similarity: The Network Feature Complexity and Its Interpretation Using Category Theorycited by 12
- 2024ELRT: Efficient Low-Rank Training for Compact Convolutional Neural Networkscited by 11
- 2022Practical Network Acceleration with Tiny Setscited by 10
- 2024Dense Vision Transformer Compression with Few Samplescited by 9
- 2025Forget the Data and Fine-Tuning! Just Fold the Network to Compresscited by 7
- 2022SVD-NAS: Coupling Low-Rank Approximation and Neural Architecture Searchcited by 3
- 2025Training-Free Restoration of Pruned Neural Networkscited by 2
- 2025On Information Geometry and Iterative Optimization in Model Compression: Operator Factorizationcited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.