LNPT: Label-free Network Pruning and Training
Not on the map. Why?
Abstract (arXiv)
Pruning before training enables the deployment of neural networks on smart devices. By retaining weights conducive to generalization, pruned networks can be accommodated on resource-constrained smart devices. It is commonly held that the distance on weight norms between the initialized and the fully-trained networks correlates with generalization performance. However, as we have uncovered, inconsistency between this metric and generalization during training processes, which poses an obstacle to determine the pruned structures on smart devices in advance. In this paper, we introduce the concept of the learning gap, emphasizing its accurate correlation with generalization. Experiments show that the learning gap, in the form of feature maps from the penultimate layer of networks, aligns with variations of generalization performance. We propose a novel learning framework, LNPT, which enables mature networks on the cloud to provide online guidance for network pruning and learning on smart devices with unlabeled data. Our results demonstrate the superiority of this approach over supervised training.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 36 of its 51 references that are in the map. First posted on arXiv 19 Mar 2024.
Builds on
36 of 51 references.
References · 36
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2014FitNets: Hints for Thin Deep Netscited by 1,619
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2016Paying More Attention to Attention: Improving the Performance of Convolutional Neural Networks via Attention Transfercited by 1,059
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
- 2019Improved Knowledge Distillation via Teacher Assistantcited by 567
- 2019Importance Estimation for Neural Network Pruningcited by 531
- 2019Patient Knowledge Distillation for BERT Model Compressioncited by 502
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 475
24 more
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 2022Decoupled Knowledge Distillationcited by 380
- 2019Variational Information Distillation for Knowledge Transfercited by 321
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
- 2018Paraphrasing Complex Network: Network Compression via Factor Transfercited by 255
- 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
- 2019Data-Free Learning of Student Networkscited by 203
- 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
- 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
- 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 145
- 2017Deep Rewiring: Training very sparse deep networkscited by 136
- 2015Unsupervised and Semi-supervised Learning with Categorical Generative Adversarial Networkscited by 94
- 2020EagleEye: Fast Sub-net Evaluation for Efficient Neural Network Pruningcited by 80
- 2020Wasserstein Contrastive Representation Distillationcited by 63
- 2020Feature-map-level Online Adversarial Knowledge Distillationcited by 62
- 2019DeepHoyer: Learning Sparser Neural Network with Differentiable Scale-Invariant Sparsity Measurescited by 56
- 2019Generalization in Deep Networks: The Role of Distance from Initializationcited by 49
- 2022MixSKD: Self-Knowledge Distillation from Mixup for Image Recognitioncited by 30
- 2022Sparse Double Descent: Where Network Pruning Aggravates Overfittingcited by 26
- 2022Interspace Pruning: Using Adaptive Filter Representations to Improve Training of Sparse CNNscited by 16
- 2017SUBIC: A supervised, structured binary code for image searchcited by 12
- 2021Model Pruning Based on Quantified Similarity of Feature Mapscited by 6
- 2022Receding Neuron Importances for Structured Pruningcited by 3
- 2022Pushing the Efficiency Limit Using Structured Sparse Convolutionscited by 3
Built on by
Not cited yet.