Enhanced Structured Lasso Pruning with Class-wise Information
Not on the map. Why?
Abstract (arXiv)
Modern applications require lightweight neural network models. Most existing neural network pruning methods focus on removing unimportant filters; however, these may result in the loss of statistical information after pruning due to failing to consider the class-wise information. In this paper, we employ the structured lasso from the perspective of utilizing precise class-wise information for model pruning with the help of Information Bottleneck theory, which guides us to ensure the retention of statistical information before and after pruning. With these techniques, we propose two novel adaptive network pruning schemes in parallel: sparse graph-structured lasso pruning with Information Bottleneck (sGLP-IB) and sparse tree-guided lasso pruning with Information Bottleneck (sTLP-IB). The key component is that we prune the model filters utilizing sGLP-IB and sTLP-IB with more precise structured class-wise relatedness. Compared to multiple state-of-the-art methods, our approaches achieve the best performance across three datasets and six model structures on extensive experiments. For example, with the VGG16 model based on the CIFAR-10 dataset, we can reduce the parameters by 85%, decrease the FLOPs by 61%, and maintain an accuracy of 94.10% (0.14% better than the original). For large-scale ImageNet, we can reduce the parameters by 55% while keeping the accuracy at 76.12% (only drop 0.03%) using the ResNet architecture. In summary, we succeed in reducing the model size and computational resource usage while maintaining the effectiveness of accuracy.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 32 of its 58 references that are in the map. First posted on arXiv 13 Feb 2025.
Builds on
32 of 58 references.
References · 32
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2014Going Deeper with Convolutionscited by 4,231
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2015Deep Learning and the Information Bottleneck Principlecited by 793
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
- 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
- 2016Network Trimming: A Data-Driven Neuron Pruning Approach towards Efficient Deep Architecturescited by 220
- 2022RepQ-ViT: Scale Reparameterization for Post-Training Quantization of Vision Transformerscited by 134
- 2022I-ViT: Integer-only Quantization for Efficient Vision Transformer Inferencecited by 93
20 more
- 2020SCOP: Scientific Control for Reliable Neural Network Pruningcited by 92
- 2016Group Sparse Regularization for Deep Neural Networkscited by 89
- 2019The HSIC Bottleneck: Deep Learning without Back-Propagationcited by 77
- 2021Convolutional Neural Network Pruning with Structural Redundancy Reductioncited by 73
- 2019Global Sparse Momentum SGD for Pruning Very Deep Neural Networkscited by 70
- 2018Compressing Neural Networks using the Variational Information Bottleneckcited by 59
- 2021Towards Compact CNNs via Collaborative Compressioncited by 36
- 2021GDP: Stabilized Neural Network Pruning via Gates with Differentiable Polarizationcited by 29
- 2021Fire Together Wire Together: A Dynamic Pruning Approach with Self-Supervised Mask Predictioncited by 24
- 2021Network Pruning using Adaptive Exemplar Filterscited by 16
- 2019Filter Pruning by Switching to Neighboring CNNs with Good Attributescited by 15
- 2024End-to-End Training Induces Information Bottleneck through Layer-Role Differentiation: A Comparative Analysis with Layer-wise Trainingcited by 8
- 2021CATRO: Channel Pruning via Class-Aware Trace Ratio Optimizationcited by 6
- 2021Smoothing Proximal Gradient Methods for Nonsmooth Sparsity Constrained Optimization: Optimality Conditions and Global Convergencecited by 4
- 2021Automatic Neural Network Pruning that Efficiently Preserves the Model Accuracycited by 4
- 2022Network Pruning via Feature Shift Minimizationcited by 4
- 2020Channel Pruning via Multi-Criteria based on Weight Dependencycited by 2
- 2024Small Contributions, Small Networks: Efficient Neural Network Pruning Based on Relative Importancecited by 2
- 2017Sparse Variable Selection on High Dimensional Heterogeneous Data with Tree Structured Responsescited by 1
- 2023Greedy Pruning with Group Lasso Provably Generalizes for Matrix Sensingcited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.