mlsanityData to 14 Oct 2026

Training CNNs with Low-Rank Filters for Efficient Image Classification

arXiv 1511.06744 ↗First posted 20 Nov 2015cs.CV cs.LG cs.NEcited by 25

Not on the map. Why?

Abstract (arXiv)

We propose a new method for creating computationally efficient convolutional neural networks (CNNs) by using low-rank representations of convolutional filters. Rather than approximating filters in previously-trained networks with more efficient versions, we learn a set of small basis filters from scratch; during training, the network learns to combine these basis filters into more complex filters that are discriminative for image classification. To train such networks, a novel weight initialization scheme is used. This allows effective initialization of connection weights in convolutional layers composed of groups of differently-shaped filters. We validate our approach by applying it to several existing CNN architectures and training these networks from scratch using the CIFAR, ILSVRC and MIT Places datasets. Our results show similar or higher accuracy than conventional CNNs with much less compute. Applying our method to an improved version of VGG-11 network using global max-pooling, we achieve comparable validation accuracy using 41% less compute and only 24% of the original VGG-11 model parameters; another variant of our method gives a 1 percentage point increase in accuracy over our improved VGG-11 model, giving a top-5 center-crop validation accuracy of 89.7% while reducing computation by 16% relative to the original VGG-11 model. Applying our method to the GoogLeNet architecture for ILSVRC, we achieved comparable accuracy with 26% less compute and 41% fewer model parameters. Applying our method to a near state-of-the-art network for CIFAR, we achieved comparable accuracy with 46% less compute and 55% fewer parameters.

Key facts. Cited by 25 papers in the map (data through 14 Oct 2026). First posted on arXiv 20 Nov 2015.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 4; 2022: 6; 2023: 7; 2024: 4; 2025: 3; 2026: 1.

25 papers.

Sort:

By area:

  1. 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Modelscited by 169
  2. 2021Pufferfish: Communication-efficient Models At No Extra Costcited by 61
  3. 2021Initialization and Regularization of Factorized Neural Layerscited by 58
  4. 2022Low-rank lottery tickets: finding efficient low-rank neural networks via matrix differential equationscited by 43
  5. 2022Compute-Efficient Deep Learning: Algorithmic Trends and Opportunitiescited by 38
  6. 2021Compressing Neural Networks: Towards Determining the Optimal Layer-wise Decompositioncited by 33
  7. 2022projUNN: efficient method for training deep networks with unitary matricescited by 27
  8. 2023ResFields: Residual Neural Fields for Spatiotemporal Signalscited by 27
  9. 2021An Information-Theoretic Justification for Model Pruningcited by 25
  10. 2023Cuttlefish: Low-Rank Model Training without All the Tuningcited by 25
  11. 2022Pruning Neural Networks via Coresets and Convex Geometry: Towards No Assumptionscited by 20
  12. 2022Federated Learning of Large Models at the Edge via Principal Sub-Model Trainingcited by 13
13 more
  1. 2023Geometry-aware training of factorized layers in tensor Tucker formatcited by 12
  2. 2024ELRT: Efficient Low-Rank Training for Compact Convolutional Neural Networkscited by 11
  3. 2023InRank: Incremental Low-Rank Learningcited by 10
  4. 2022ME-D2N: Multi-Expert Domain Decompositional Network for Cross-Domain Few-Shot Learningcited by 9
  5. 2023All Rivers Run to the Sea: Private Learning with Asymmetric Flowscited by 4
  6. 2024TropNNC: Structured Neural Network Compression Using Tropical Geometrycited by 3
  7. 2024Full-Rank No More: Low-Rank Weight Training for Modern Speech Recognition Modelscited by 3
  8. 2023Filter Pruning based on Information Capacity and Independencecited by 2
  9. 2025Low-Rank Compression for IMC Arrayscited by 2
  10. 2024Edge Private Graph Neural Networks with Singular Value Perturbationcited by 1
  11. 2025Compress to Impress: Efficient LLM Adaptation Using a Single Gradient Step on 100 Samplescited by 1
  12. 2025Optimization of Layer Skipping and Frequency Scaling for Convolutional Neural Networks under Latency Constraintcited by 0
  13. 2026Hierarchical Spatio-Channel Clustering for Efficient Model Compression in Medical Image Analysiscited by 0