Principal Component Networks: Parameter Reduction Early in Training
Not on the map. Why?
Abstract (arXiv)
Recent works show that overparameterized networks contain small subnetworks that exhibit comparable accuracy to the full model when trained in isolation. These results highlight the potential to reduce training costs of deep neural networks without sacrificing generalization performance. However, existing approaches for finding these small networks rely on expensive multi-round train-and-prune procedures and are non-practical for large data sets and models. In this paper, we show how to find small networks that exhibit the same performance as their overparameterized counterparts after only a few training epochs. We find that hidden layer activations in overparameterized networks exist primarily in subspaces smaller than the actual model width. Building on this observation, we use PCA to find a basis of high variance for layer inputs and represent layer weights using these directions. We eliminate all weights not relevant to the found PCA basis and term these network architectures Principal Component Networks. On CIFAR-10 and ImageNet, we show that PCNs train faster and use less energy than overparameterized models, without accuracy loss. We find that our transformation leads to networks with up to 23.8x fewer parameters, with equal or higher end-model accuracy---in some cases we observe improvements up to 3%. We also show that ResNet-20 PCNs outperform deep ResNet-110 networks while training faster.
Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). First posted on arXiv 23 Jun 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 2; 2024: 5; 2025: 1.
9 papers.
- 2021Pufferfish: Communication-efficient Models At No Extra Costcited by 61
- 2023Cuttlefish: Low-Rank Model Training without All the Tuningcited by 25
- 2023Variation Spaces for Multi-Output Neural Networks: Insights on Multi-Task Learning and Network Compressioncited by 17
- 2024CHAI: Clustered Head Attention for Efficient LLM Inferencecited by 13
- 2024ELRT: Efficient Low-Rank Training for Compact Convolutional Neural Networkscited by 11
- 2024Harnessing Orthogonality to Train Low-Rank Neural Networkscited by 4
- 2024Structure-Preserving Network Compression Via Low-Rank Induced Training Through Linear Layers Compositioncited by 3
- 2025On Information Geometry and Iterative Optimization in Model Compression: Operator Factorizationcited by 1
- 2024Uncovering Layer-Dependent Activation Sparsity Patterns in ReLU Transformerscited by 0
- 2025On Information Geometry and Iterative Optimization in Model Compression: Operator Factorization12 Jul 2025
- 2024Uncovering Layer-Dependent Activation Sparsity Patterns in ReLU Transformers10 Jul 2024
- 2024Structure-Preserving Network Compression Via Low-Rank Induced Training Through Linear Layers Composition6 May 2024
- 2024CHAI: Clustered Head Attention for Efficient LLM Inference12 Mar 2024
- 2024ELRT: Efficient Low-Rank Training for Compact Convolutional Neural Networks18 Jan 2024
- 2024Harnessing Orthogonality to Train Low-Rank Neural Networks16 Jan 2024
- 2023Variation Spaces for Multi-Output Neural Networks: Insights on Multi-Task Learning and Network Compression25 May 2023
- 2023Cuttlefish: Low-Rank Model Training without All the Tuning4 May 2023
- 2021Pufferfish: Communication-efficient Models At No Extra Cost5 Mar 2021