mlsanityData to 7 Oct 2026

SVD-NAS: Coupling Low-Rank Approximation and Neural Architecture Search

arXiv 2208.10404 ↗First posted 22 Aug 2022cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

The task of compressing pre-trained Deep Neural Networks has attracted wide interest of the research community due to its great benefits in freeing practitioners from data access requirements. In this domain, low-rank approximation is a promising method, but existing solutions considered a restricted number of design choices and failed to efficiently explore the design space, which lead to severe accuracy degradation and limited compression ratio achieved. To address the above limitations, this work proposes the SVD-NAS framework that couples the domains of low-rank approximation and neural architecture search. SVD-NAS generalises and expands the design choices of previous works by introducing the Low-Rank architecture space, LR-space, which is a more fine-grained design space of low-rank approximation. Afterwards, this work proposes a gradient-descent-based search for efficiently traversing the LR-space. This finer and more thorough exploration of the possible design choices results in improved accuracy as well as reduction in parameters, FLOPS, and latency of a CNN model. Results demonstrate that the SVD-NAS achieves 2.06-12.85pp higher accuracy on ImageNet than state-of-the-art methods under the data-limited problem setting. SVD-NAS is open-sourced at https://github.com/Yu-Zhewen/SVD-NAS.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 25 of its 35 references that are in the map. First posted on arXiv 22 Aug 2022.

Builds on

25 of 35 references.

References · 25

  1. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
  2. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
  3. 2018DARTS: Differentiable Architecture Searchcited by 1,782
  4. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
  5. 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 778
  6. 2018ProxylessNAS: Direct Neural Architecture Search on Target Task and Hardwarecited by 666
  7. 2018FBNet: Hardware-Aware Efficient ConvNet Design via Differentiable Neural Architecture Searchcited by 480
  8. 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
  9. 2020ZeroQ: A Novel Zero Shot Quantization Frameworkcited by 265
  10. 2014Speeding-up Convolutional Neural Networks Using Fine-tuned CP-Decompositioncited by 199
  11. 2015Compression of Deep Convolutional Neural Networks for Fast and Low Power Mobile Applicationscited by 161
  12. 2015Accelerating Very Deep Convolutional Networks for Classification and Detectioncited by 109
13 more
  1. 2015Convolutional neural networks with low-rank regularizationcited by 102
  2. 2020Stable Low-rank Tensor Decomposition for Compression of Convolutional Neural Networkcited by 74
  3. 2019Learning Filter Basis for Convolutional Neural Network Compressioncited by 57
  4. 2021Towards Efficient Tensor Decomposition-Based DNN Model Compression with Optimization Frameworkcited by 52
  5. 2019Accuracy vs. Efficiency: Achieving Both through FPGA-Implementation Aware Neural Architecture Searchcited by 38
  6. 2021Compressing Neural Networks: Towards Determining the Optimal Layer-wise Decompositioncited by 33
  7. 2014Efficient and Accurate Approximations of Nonlinear Convolutional Networkscited by 30
  8. 2018Trained Rank Pruning for Efficient Deep Neural Networkscited by 23
  9. 2021Post-training deep neural network pruning via layer-wise calibrationcited by 23
  10. 2018Extreme Network Compression via Filter Group Approximationcited by 12
  11. 2022Compressing Models with Few Samples: Mimicking then Replacingcited by 8
  12. 2020Structured Convolutions for Efficient Neural Network Designcited by 4
  13. 2020Deeply Shared Filter Bases for Parameter-Efficient Convolutional Neural Networkscited by 2

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 0; 2025: 1.

3 papers.