Reconstruction Task Finds Universal Winning Tickets
Not on the map. Why?
Abstract (arXiv)
Pruning well-trained neural networks is effective to achieve a promising accuracy-efficiency trade-off in computer vision regimes. However, most of existing pruning algorithms only focus on the classification task defined on the source domain. Different from the strong transferability of the original model, a pruned network is hard to transfer to complicated downstream tasks such as object detection arXiv:arch-ive/2012.04643. In this paper, we show that the image-level pretrain task is not capable of pruning models for diverse downstream tasks. To mitigate this problem, we introduce image reconstruction, a pixel-level task, into the traditional pruning framework. Concretely, an autoencoder is trained based on the original model, and then the pruning process is optimized with both autoencoder and classification losses. The empirical study on benchmark downstream tasks shows that the proposed method can outperform state-of-the-art results explicitly.
Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 26 of its 33 references that are in the map. First posted on arXiv 23 Feb 2022.
Builds on
26 of 33 references.
References · 26
- 2014Microsoft COCO: Common Objects in Contextcited by 17,550
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,111
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,009
- 2015Distilling the Knowledge in a Neural Networkcited by 10,180
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,492
- 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,364
- 2017Mask R-CNNcited by 7,266
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,730
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,574
- 2021Zero-Shot Text-to-Image Generationcited by 4,284
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,257
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,017
14 more
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 809
- 2018Rethinking the Value of Network Pruningcited by 597
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 573
- 2020Pruning neural networks without any data by iteratively conserving synaptic flowcited by 476
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 469
- 2016Quantized Neural Networks: Training Neural Networks with Low Precision Weights and Activationscited by 422
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 399
- 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 240
- 2015Convolutional neural networks with low-rank regularizationcited by 102
- 2019One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizerscited by 102
- 2020The Lottery Tickets Hypothesis for Supervised and Self-supervised Pre-training in Computer Vision Modelscited by 91
- 2016Medical image denoising using convolutional denoising autoencoderscited by 76
- 2020The Lottery Ticket Hypothesis for Object Recognitioncited by 34
- 2021Unsupervised Visual Representation Learning by Online Constrained K-Meanscited by 27
Built on by
Not cited yet.