Weight-Shifting Based Pruning for Convolutional Neural Networks

The paper presents an adaptation of the novel self-recovering technique known as weight-shifting for application in the pruning of nodes from the fully-connected layers of convolutional neural networks. The proposed methodology involves a binary search strategy to identify the optimal subset of nodes for removal, facilitating efficient redistribution of node weights using the Moore-Penrose pseudo-inverse. The proposed methodology was evaluated by across multiple data sets, including CIFAR-100, Food101, Stanford Cars, and Flowers102. The experimental results demonstrated that the proposed methodology is able to maintain high accuracy and top-k categorical accuracy performance with minimal reductions even after pruning a significant percentage of nodes. The paper contributes to neural network compression and optimization by providing a versatile solution that enhances model efficiency without significantly compromising performance, offering potential benefits for applications in resource-constrained environments.

Authors

Institutions

Publication Details

Published
2024-11-06
DOI
https://doi.org/10.1109/icsec62781.2024.10770739
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Weight-Shifting Based Pruning for Convolutional Neural Networks

Panuwat Threethanuchai, Chidchanok Lursinsap
Neural Networks and Applications
article

Weight-Shifting Based Pruning for Convolutional Neural Networks

Panuwat Threethanuchai, Chidchanok Lursinsap
article en

Abstract

The paper presents an adaptation of the novel self-recovering technique known as weight-shifting for application in the pruning of nodes from the fully-connected layers of convolutional neural networks. The proposed methodology involves a binary search strategy to identify the optimal subset of nodes for removal, facilitating efficient redistribution of node weights using the Moore-Penrose pseudo-inverse. The proposed methodology was evaluated by across multiple data sets, including CIFAR-100, Food101, Stanford Cars, and Flowers102. The experimental results demonstrated that the proposed methodology is able to maintain high accuracy and top-k categorical accuracy performance with minimal reductions even after pruning a significant percentage of nodes. The paper contributes to neural network compression and optimization by providing a versatile solution that enhances model efficiency without significantly compromising performance, offering potential benefits for applications in resource-constrained environments.

Chulalongkorn University (TH)
Openalex Percentile: Top 80%
Neural Networks and Applications
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.