paper-with-me

홈 › Papers

Automatic Pruning via Structured Lasso with Class-wise Information

2025-02-13 · Xiang Liu, Mingchen Li, Xia Li, Leigang Qu, Zifan Peng, Yijun Song, Zemin Liu, Linshan Jiang, Jialin Li

Most pruning methods concentrate on unimportant filters of neural networks. However, they face the loss of statistical information due to a lack of consideration for class-wise data. In this paper, from the perspective of leveraging precise class-wise information for model pruning, we utilize structured lasso with guidance from Information Bottleneck theory. Our approach ensures that statistical information is retained during the pruning process. With these techniques, we introduce two innovative adaptive network pruning schemes: sparse graph-structured lasso pruning with Information Bottleneck (\textbf{sGLP-IB}) and sparse tree-guided lasso pruning with Information Bottleneck (\textbf{sTLP-IB}). The key aspect is pruning model filters using sGLP-IB and sTLP-IB to better capture class-wise relatedness. Compared to multiple state-of-the-art methods, our approaches demonstrate superior performance across three datasets and six model architectures in extensive experiments. For instance, using the VGG16 model on the CIFAR-10 dataset, we achieve a parameter reduction of 85%, a decrease in FLOPs by 61%, and maintain an accuracy of 94.10% (0.14% higher than the original model); we reduce the parameters by 55% with the accuracy at 76.12% using the ResNet architecture on ImageNet (only drops 0.03%). In summary, we successfully reduce model size and computational resource usage while maintaining accuracy. Our codes are at https://anonymous.4open.science/r/IJCAI-8104.

📄 PDF Abstract BibTeX arXiv:2502.09125

Code (0)

등록된 구현이 없습니다.

Tasks

Network Pruning

Methods 이 논문이 사용한 방법론

Average Pooling 설명 없음
Max Pooling Max Pooling is a pooling operation that calculates the maximum value for patches of a feature map, and uses it to create a downsampled (pooled) feature map. It is usually…
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Pruning 설명 없음
Kaiming Initialization 설명 없음
Global Average Pooling Global Average Pooling is a pooling operation designed to replace fully connected layers in classical CNNs. The idea is to generate one feature map for each corresponding…

Similar Papers 제목 키워드 기반

Structured Network Pruning by Measuring Filter-wise Interactions

2023-07-03 · Wenting Tang, Xingxing Wei, Bo Li

Structured network pruning is a practical approach to reduce computation cost directly while retaining the CNNs' generalization performance in real applications. However, identifying redundant filters is a core problem i…

image-classificationImage ClassificationNetwork Pruning

Exclusive Topic Modeling

2021-02-06 · Hao Lei, Ying Chen

We propose an Exclusive Topic Modeling (ETM) for unsupervised text classification, which is able to 1) identify the field-specific keywords though less frequently appeared and 2) deliver well-structured topics with exclu…

text-classificationText ClassificationUnsupervised Text Classification

SIMD-size aware weight regularization for fast neural vocoding on CPU

2022-11-02 · Hiroki Kanagawa, Yusuke Ijima

This paper proposes weight regularization for a faster neural vocoder. Pruning time-consuming DNN modules is a promising way to realize a real-time vocoder on a CPU (e.g. WaveRNN, LPCNet). Regularization that encourages …

CPU

Directed-Weighting Group Lasso for Eltwise Blocked CNN Pruning

2019-10-21 · Ke Zhan, Shimiao Jiang, Yu Bai, Yi Li 외

Eltwise layer is a commonly used structure in the multi-branch deep learning network. In a filter-wise pruning procedure, due to the specific operation of the eltwise layer, all its previous convolutional layers should v…

Adaptive Structured Pruning of Convolutional Neural Networks for Time Series Classification

2026-02-13 · Javidan Abdullayev, Maxime Devanne, Cyril Meyer, Ali Ismail-Fawaz 외 arxiv

Deep learning models for Time Series Classification (TSC) have achieved strong predictive performance but their high computational and memory requirements often limit deployment on resource-constrained devices. While str…

Time Series Classification