CVNov 19, 2024

FGP: Feature-Gradient-Prune for Efficient Convolutional Layer Pruning

arXiv:2411.12781v13 citationsh-index: 15Has Code
Originality Incremental advance
AI Analysis

This work addresses the efficiency and performance trade-off in model pruning for deep learning applications, offering an incremental improvement over prior pruning techniques.

The paper tackles the problem of redundant channels in structured pruning for convolutional neural networks by introducing Feature-Gradient Pruning (FGP), which integrates feature and gradient information to better evaluate channel importance, resulting in significant computational cost reductions and minimized accuracy loss compared to existing methods.

To reduce computational overhead while maintaining model performance, model pruning techniques have been proposed. Among these, structured pruning, which removes entire convolutional channels or layers, significantly enhances computational efficiency and is compatible with hardware acceleration. However, existing pruning methods that rely solely on image features or gradients often result in the retention of redundant channels, negatively impacting inference efficiency. To address this issue, this paper introduces a novel pruning method called Feature-Gradient Pruning (FGP). This approach integrates both feature-based and gradient-based information to more effectively evaluate the importance of channels across various target classes, enabling a more accurate identification of channels that are critical to model performance. Experimental results demonstrate that the proposed method improves both model compactness and practicality while maintaining stable performance. Experiments conducted across multiple tasks and datasets show that FGP significantly reduces computational costs and minimizes accuracy loss compared to existing methods, highlighting its effectiveness in optimizing pruning outcomes. The source code is available at: https://github.com/FGP-code/FGP.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes