Lightweight Graph Convolutional Networks with Topologically Consistent Magnitude Pruning
Not on the map. Why?
Abstract (arXiv)
Graph convolution networks (GCNs) are currently mainstream in learning with irregular data. These models rely on message passing and attention mechanisms that capture context and node-to-node relationships. With multi-head attention, GCNs become highly accurate but oversized, and their deployment on cheap devices requires their pruning. However, pruning at high regimes usually leads to topologically inconsistent networks with weak generalization. In this paper, we devise a novel method for lightweight GCN design. Our proposed approach parses and selects subnetworks with the highest magnitudes while guaranteeing their topological consistency. The latter is obtained by selecting only accessible and co-accessible connections which actually contribute in the evaluation of the selected subnetworks. Experiments conducted on the challenging FPHA dataset show the substantial gain of our topologically consistent pruning method especially at very high pruning regimes.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 51 of its 111 references that are in the map. First posted on arXiv 25 Mar 2022.
Builds on
51 of 111 references.
References · 51
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2017Mask R-CNNcited by 7,259
- 2016Densely Connected Convolutional Networkscited by 6,691
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2014Fully Convolutional Networks for Semantic Segmentationcited by 4,845
- 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
- 2014Going Deeper with Convolutionscited by 4,231
38 more
- 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
- 2016DeepLab: Semantic Image Segmentation with Deep Convolutional Nets, Atrous Convolution, and Fully Connected CRFscited by 3,239
- 2015Fast R-CNNcited by 2,930
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2014FitNets: Hints for Thin Deep Netscited by 1,619
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,097
- 2016Paying More Attention to Attention: Improving the Performance of Convolutional Neural Networks via Attention Transfercited by 1,059
- 2016SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and <0.5MB model sizecited by 1,054
- 2017Learning Efficient Convolutional Networks through Network Slimmingcited by 673
- 2017Deep Mutual Learningcited by 621
- 2018FastGCN: Fast Learning with Graph Convolutional Networks via Importance Samplingcited by 583
- 2019Improved Knowledge Distillation via Teacher Assistantcited by 567
- 2017Learning Combinatorial Optimization Algorithms over Graphscited by 557
- 2018Deep Learning on Graphs: A Surveycited by 393
- 2016Convolutional Two-Stream Network Fusion for Video Action Recognitioncited by 384
- 2019Variational Information Distillation for Knowledge Transfercited by 321
- 2015Deep Convolutional Networks on Graph-Structured Datacited by 246
- 2017First-Person Hand Action Benchmark with RGB-D Videos and 3D Hand Pose Annotationscited by 229
- 2017CayleyNets: Graph Convolutional Neural Networks with Complex Rational Spectral Filterscited by 203
- 2019What graph neural networks cannot learn: depth vs widthcited by 195
- 2014Recurrent Neural Network Regularizationcited by 189
- 2019Understanding Attention and Generalization in Graph Neural Networkscited by 169
- 2016A Riemannian Network for SPD Matrix Learningcited by 162
- 2018Adaptive Graph Convolutional Neural Networkscited by 155
- 2017CondenseNet: An Efficient DenseNet using Learned Group Convolutionscited by 121
- 2018Learning graphs from data: A signal representation perspectivecited by 119
- 2014DenseNet: Implementing Efficient ConvNet Descriptor Pyramidscited by 66
- 2016Co-occurrence Feature Learning for Skeleton based Action Recognition using Regularized Deep LSTM Networkscited by 63
- 2016Building Deep Networks on Grassmann Manifoldscited by 58
- 2018Learning to Solve NP-Complete Problems - A Graph Neural Network for Decision TSPcited by 58
- 2019A Unified Framework for Structured Graph Learning via Spectral Constraintscited by 53
- 2017Fast YOLO: A Fast You Only Look Once System for Real-time Embedded Object Detection in Videocited by 30
- 2021Learning Connectivity with Graph Convolutional Networks for Skeleton-based Action Recognitioncited by 20
- 2016Transition Forests: Learning Discriminative Temporal Transitions for Action Recognition and Detectioncited by 18
50 most cited of 51 All 51 (JSON)
Built on by
Not cited yet.