Entropy-Guided Search Space Optimization for Efficient Neural Network Pruning

Neural network pruning is essential for deploying deep learning models on resource-constrained devices by reducing computational and memory demands. In this paper, we propose a novel pruning framework, Entropy-Guided Search Space Optimization for Efficient Neural Network Pruning, which uses information entropy to assess the importance of convolutional layers. Specifically, we calculate the layer-wise entropy of pretrained weights, apply outlier detection to remove extreme values, and normalize the entropy values. These normalized values guide the selection of retention ratios, ensuring that layers with higher entropy retain more filters. By refining the subnetwork search space, our approach enhances the efficiency of the search process and improves overall subnetwork performance. The refined search space targets more promising regions, reducing computational overhead and resulting in higher-quality pruned networks. Through iterative optimization, the optimal subnetwork is identified and fine-tuned to produce the final pruned model. Experimental results on benchmark datasets show that our method significantly outperforms existing pruning methods, achieving substantial improvements in both accuracy and computational efficiency. This entropy-guided pruning strategy provides a robust and effective solution for neural network compression, suitable for a wide range of deep learning applications.

Authors

Institutions

Publication Details

Journal
Algorithms
Published
2025-11-24
DOI
https://doi.org/10.3390/a18120736
Citations
2
Primary Topic
Advanced Neural Network Applications
Type
article
Field-Weighted Citation Impact
2.55
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Entropy-Guided Search Space Optimization for Efficient Neural Network Pruning

Zhaokun Cheng, Feng Sha, ‪Keiji Yanai‬, Yicheng Qiu et al.
2 citations
Algorithms
Advanced Neural Network Applications
2.55
article

Entropy-Guided Search Space Optimization for Efficient Neural Network Pruning

Zhaokun Cheng, Feng Sha, ‪Keiji Yanai‬, Yicheng Qiu, Li Niu
article en
2 citations

Abstract

Neural network pruning is essential for deploying deep learning models on resource-constrained devices by reducing computational and memory demands. In this paper, we propose a novel pruning framework, Entropy-Guided Search Space Optimization for Efficient Neural Network Pruning, which uses information entropy to assess the importance of convolutional layers. Specifically, we calculate the layer-wise entropy of pretrained weights, apply outlier detection to remove extreme values, and normalize the entropy values. These normalized values guide the selection of retention ratios, ensuring that layers with higher entropy retain more filters. By refining the subnetwork search space, our approach enhances the efficiency of the search process and improves overall subnetwork performance. The refined search space targets more promising regions, reducing computational overhead and resulting in higher-quality pruned networks. Through iterative optimization, the optimal subnetwork is identified and fine-tuned to produce the final pruned model. Experimental results on benchmark datasets show that our method significantly outperforms existing pruning methods, achieving substantial improvements in both accuracy and computational efficiency. This entropy-guided pruning strategy provides a robust and effective solution for neural network compression, suitable for a wide range of deep learning applications.

AlgorithmsVol. 18(12)
University of Electro-Communications (JP)
Openalex Percentile: Top 8%
Advanced Neural Network Applications
2.55
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.