Pith. sign in

REVIEW 2 cited by

RL-Pruner: Structured Pruning Using Reinforcement Learning for CNN Compression and Acceleration

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2411.06463 v1 pith:G4WAXJ6I submitted 2024-11-10 cs.CV cs.AI

classification cs.CVcs.AI
keywords pruningfiltersmodeldistributionlayersperformancerl-prunerstructured
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Convolutional Neural Networks (CNNs) have demonstrated exceptional performance in recent years. Compressing these models not only reduces storage requirements, making deployment to edge devices feasible, but also accelerates inference, thereby reducing latency and computational costs. Structured pruning, which removes filters at the layer level, directly modifies the model architecture. This approach achieves a more compact architecture while maintaining target accuracy, ensuring that the compressed model retains good compatibility and hardware efficiency. Our method is based on a key observation: filters in different layers of a neural network have varying importance to the model's performance. When the number of filters to prune is fixed, the optimal pruning distribution across different layers is uneven to minimize performance loss. Layers that are more sensitive to pruning should account for a smaller proportion of the pruning distribution. To leverage this insight, we propose RL-Pruner, which uses reinforcement learning to learn the optimal pruning distribution. RL-Pruner can automatically extract dependencies between filters in the input model and perform pruning, without requiring model-specific pruning implementations. We conducted experiments on models such as GoogleNet, ResNet, and MobileNet, comparing our approach to other structured pruning methods to validate its effectiveness. Our code is available at https://github.com/Beryex/RLPruner-CNN.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. SPEAR: Structured Pruning for Spiking Neural Networks via Synaptic Operation Estimation and Reinforcement Learning

    cs.NE 2025-06 conditional novelty 6.0 of 10

    SPEAR combines a linear-regression SynOps estimator with a target-aware reward to search structured pruning policies for spiking neural networks under a SynOps budget.

  2. Accelerating Reinforcement Learning Algorithms Convergence using Pre-trained Large Language Models as Tutors With Advice Reusing

    cs.LG 2025-09 conditional novelty 4.0 of 10

    LLM tutoring modestly accelerates RL convergence on average, with advice reuse saving wall-clock time but reducing stability.

Pith tools