Dynamic Channel Selection in Self-Supervised Learning
Not on the map. Why?
Abstract (arXiv)
Whilst computer vision models built using self-supervised approaches are now commonplace, some important questions remain. Do self-supervised models learn highly redundant channel features? What if a self-supervised network could dynamically select the important channels and get rid of the unnecessary ones? Currently, convnets pre-trained with self-supervision have obtained comparable performance on downstream tasks in comparison to their supervised counterparts in computer vision. However, there are drawbacks to self-supervised models including their large numbers of parameters, computationally expensive training strategies and a clear need for faster inference on downstream tasks. In this work, our goal is to address the latter by studying how a standard channel selection method developed for supervised learning can be applied to networks trained with self-supervision. We validate our findings on a range of target budgets td for channel computation on image classification task across different datasets, specifically CIFAR-10, CIFAR-100, and ImageNet-100, obtaining comparable performance to that of the original network when selecting all channels but at a significant reduction in computation reported in terms of FLOPs.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 27 of its 34 references that are in the map. First posted on arXiv 25 Jul 2022.
Builds on
27 of 34 references.
References · 27
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2017Squeeze-and-Excitation Networkscited by 4,763
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2020Exploring Simple Siamese Representation Learningcited by 2,853
- 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,708
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,818
- 2021VICReg: Variance-Invariance-Covariance Regularization for Self-Supervised Learningcited by 1,013
- 2019Self-Supervised Learning of Pretext-Invariant Representationscited by 806
15 more
- 2019Learning Representations by Maximizing Mutual Information Across Viewscited by 733
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
- 2019Self-labelling via simultaneous clustering and representation learningcited by 525
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
- 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
- 2017Convolutional Networks with Adaptive Inference Graphscited by 147
- 2018Dynamic Channel Pruning: Feature Boosting and Suppressioncited by 129
- 2021Solo-learn: A Library of Self-supervised Methods for Visual Representation Learningcited by 116
- 2018Channel Gating Neural Networkscited by 80
- 2021AdaFuse: Adaptive Temporal Fusion Network for Efficient Action Recognitioncited by 48
- 2021ChipNet: Budget-Aware Pruning with Heaviside Continuous Approximationscited by 21
- 2020Pruning Convolutional Neural Networks with Self-Supervisioncited by 7
- 2021Evaluating Contrastive Models for Instance-based Image Retrievalcited by 4
Built on by
Citing papers per year: 2023: 1.
1 paper.