Resource-Aware Neural Network Pruning Using Constrained Reinforcement Learning and Self-Competition

This paper presents a novel approach to neural network pruning by integrating a self-competition reward system into an Automated Machine Learning (AutoML) pruning framework. Traditional pruning methods often rely on handcrafted rules, which can be inefficient and suboptimal. To address these limitations, we propose employing a Constrained Markov Decision Process (CMDP) to model the pruning environment. Our self-competition reward system incentivizes the agent to continuously improve upon its past performance while prioritizing the satisfaction of resource constraints, such as achieving a target compression rate. We demonstrate the effectiveness of our approach through experiments on various datasets, including CIFAR-10/100 and ImageNet, comparing it against state-of-theart pruning methods. The results indicate that our method not only meets the defined compression constraints but also achieves competitive accuracy performance, showcasing an effective and efficient approach to constrained neural network pruning.

Authors

Institutions

Publication Details

Published
2025-05-07
DOI
https://doi.org/10.1109/airc64931.2025.11077487
Primary Topic
Neural Networks and Applications
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Resource-Aware Neural Network Pruning Using Constrained Reinforcement Learning and Self-Competition

Siegfried Mercelis, Jan Steckel, Thomas Huybrechts, Dieter Balemans
Neural Networks and Applications
article

Resource-Aware Neural Network Pruning Using Constrained Reinforcement Learning and Self-Competition

Siegfried Mercelis, Jan Steckel, Thomas Huybrechts, Dieter Balemans
article en

Abstract

This paper presents a novel approach to neural network pruning by integrating a self-competition reward system into an Automated Machine Learning (AutoML) pruning framework. Traditional pruning methods often rely on handcrafted rules, which can be inefficient and suboptimal. To address these limitations, we propose employing a Constrained Markov Decision Process (CMDP) to model the pruning environment. Our self-competition reward system incentivizes the agent to continuously improve upon its past performance while prioritizing the satisfaction of resource constraints, such as achieving a target compression rate. We demonstrate the effectiveness of our approach through experiments on various datasets, including CIFAR-10/100 and ImageNet, comparing it against state-of-theart pruning methods. The results indicate that our method not only meets the defined compression constraints but also achieves competitive accuracy performance, showcasing an effective and efficient approach to constrained neural network pruning.

University of Antwerp (BE)
Fonds Wetenschappelijk Onderzoek
Openalex Percentile: Top 91%
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.

Resource-Aware Neural Network Pruning Using Constrained Reinforcement Learning and Self-Competition — Siegfried Mercelis, Jan Steckel, et al. · (2025) | TGRS Research Map | TGRS