Learning Compact Representations of Neural Networks using DiscriminAtive Masking (DAM)
Not on the map. Why?
Abstract (arXiv)
A central goal in deep learning is to learn compact representations of features at every layer of a neural network, which is useful for both unsupervised representation learning and structured network pruning. While there is a growing body of work in structured pruning, current state-of-the-art methods suffer from two key limitations: (i) instability during training, and (ii) need for an additional step of fine-tuning, which is resource-intensive. At the core of these limitations is the lack of a systematic approach that jointly prunes and refines weights during training in a single stage, and does not require any fine-tuning upon convergence to achieve state-of-the-art performance. We present a novel single-stage structured pruning method termed DiscriminAtive Masking (DAM). The key intuition behind DAM is to discriminatively prefer some of the neurons to be refined during the training process, while gradually masking out other neurons. We show that our proposed DAM approach has remarkably good performance over various applications, including dimensionality reduction, recommendation system, graph representation learning, and structured pruning for image classification. We also theoretically show that the learning objective of DAM is directly related to minimizing the L0 norm of the masking layer.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 36 of its 60 references that are in the map. First posted on arXiv 1 Oct 2021.
Builds on
36 of 60 references.
References · 36
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2013Auto-Encoding Variational Bayescited by 3,980
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,214
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2019Similarity of Neural Network Representations Revisitedcited by 1,695
- 2016Variational Graph Auto-Encoderscited by 1,373
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
24 more
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
- 2018Rethinking the Value of Network Pruningcited by 595
- 2020What is the State of Neural Network Pruning?cited by 578
- 2017Learning Sparse Neural Networks through L0 Regularizationcited by 571
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
- 2019The State of Sparsity in Deep Neural Networkscited by 471
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
- 2018Stronger generalization bounds for deep nets via a compression approachcited by 306
- 2020AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradientscited by 282
- 2020Comparing Rewinding and Fine-tuning in Neural Network Pruningcited by 238
- 2013Predicting Parameters in Deep Learningcited by 223
- 2018Hyperspherical Variational Auto-Encoderscited by 188
- 2019Orthogonal Convolutional Neural Networkscited by 122
- 2021Do We Actually Need Dense Over-Parameterization? In-Time Over-Parameterization in Sparse Trainingcited by 107
- 2019Winning the Lottery with Continuous Sparsificationcited by 99
- 2017MorphNet: Fast & Simple Resource-Constrained Structure Learning of Deep Networkscited by 92
- 2019Inductive Matrix Completion Based on Graph Neural Networkscited by 85
- 2018Escaping Saddles with Stochastic Gradientscited by 66
- 2021Quadratic Residual Networks: A New Class of Neural Networks for Solving Forward and Inverse Problems in Physics Involving PDEscited by 42
- 2020Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learningcited by 35
- 2019Few Shot Network Compression via Cross Distillationcited by 26
- 2021Network Pruning That Matters: A Case Study on Retraining Variantscited by 25
- 2021ChipNet: Budget-Aware Pruning with Heaviside Continuous Approximationscited by 21
- 2019Mutual Information Maximization in Graph Neural Networkscited by 9
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 1.
3 papers.