mlsanityData to 7 Oct 2026

Jointly Training and Pruning CNNs via Learnable Agent Guidance and Alignment

arXiv 2403.19490 ↗First posted 28 Mar 2024cs.CVcited by 9

Not on the map. Why?

Abstract (arXiv)

Structural model pruning is a prominent approach used for reducing the computational cost of Convolutional Neural Networks (CNNs) before their deployment on resource-constrained devices. Yet, the majority of proposed ideas require a pretrained model before pruning, which is costly to secure. In this paper, we propose a novel structural pruning approach to jointly learn the weights and structurally prune architectures of CNN models. The core element of our method is a Reinforcement Learning (RL) agent whose actions determine the pruning ratios of the CNN model's layers, and the resulting model's accuracy serves as its reward. We conduct the joint training and pruning by iteratively training the model's weights and the agent's policy, and we regularize the model's weights to align with the selected structure by the agent. The evolving model's weights result in a dynamic reward function for the agent, which prevents using prominent episodic RL methods with stationary environment assumption for our purpose. We address this challenge by designing a mechanism to model the complex changing dynamics of the reward function and provide a representation of it to the RL agent. To do so, we take a learnable embedding for each training epoch and employ a recurrent model to calculate a representation of the changing environment. We train the recurrent model and embeddings using a decoder model to reconstruct observed rewards. Such a design empowers our agent to effectively leverage episodic observations along with the environment representations to learn a proper policy to determine performant sub-networks of the CNN model. Our extensive experiments on CIFAR-10 and ImageNet using ResNets and MobileNets demonstrate the effectiveness of our method.

Key facts. Cited by 9 papers in the map (data through 7 Oct 2026). Builds on 68 of its 102 references that are in the map. First posted on arXiv 28 Mar 2024.

Builds on

68 of 102 references.

References · 68

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  3. 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
  4. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  5. 2016Densely Connected Convolutional Networkscited by 6,691
  6. 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,415
  7. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  8. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  9. 2015You Only Look Once: Unified, Real-Time Object Detectioncited by 4,829
  10. 2018MobileNetV2: Inverted Residuals and Linear Bottleneckscited by 4,773
  11. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  12. 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,016
38 more
  1. 2017MobileNets: Efficient Convolutional Neural Networks for Mobile Vision Applicationscited by 3,827
  2. 2022A ConvNet for the 2020scited by 3,545
  3. 2015Continuous control with deep reinforcement learningcited by 3,279
  4. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  5. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  6. 2020Knowledge Distillation: A Surveycited by 1,578
  7. 2016Neural Architecture Search with Reinforcement Learningcited by 1,489
  8. 2020Gradient Surgery for Multi-Task Learningcited by 1,210
  9. 2018ShuffleNet V2: Practical Guidelines for Efficient CNN Architecture Designcited by 1,132
  10. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  11. 2019Dota 2 with Large Scale Deep Reinforcement Learningcited by 1,084
  12. 2022YOLOv7: Trainable bag-of-freebies sets new state-of-the-art for real-time object detectorscited by 978
  13. 2016XNOR-Net: ImageNet Classification Using Binary Convolutional Neural Networkscited by 829
  14. 2023ConvNeXt V2: Co-designing and Scaling ConvNets with Masked Autoencoderscited by 703
  15. 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
  16. 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
  17. 2019Importance Estimation for Neural Network Pruningcited by 531
  18. 2018AMC: AutoML for Model Compression and Acceleration on Mobile Devicescited by 375
  19. 2016Learning to reinforcement learncited by 369
  20. 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
  21. 2018Soft Filter Pruning for Accelerating Deep Convolutional Neural Networkscited by 313
  22. 2016EIE: Efficient Inference Engine on Compressed Deep Neural Networkcited by 291
  23. 2020HRank: Filter Pruning using High-Rank Feature Mapcited by 291
  24. 2020Towards Continual Reinforcement Learning: A Review and Perspectivescited by 268
  25. 2019MetaPruning: Meta Learning for Automatic Neural Network Channel Pruningcited by 226
  26. 2017BlockDrop: Dynamic Inference Paths in Residual Networkscited by 185
  27. 2018Discrimination-aware Channel Pruning for Deep Neural Networkscited by 171
  28. 2015Compressing Neural Networks with the Hashing Trickcited by 150
  29. 2022More ConvNets in the 2020s: Scaling up Kernels Beyond 51x51 using Sparsitycited by 142
  30. 2020Automatic Curriculum Learning For Deep RL: A Short Surveycited by 141
  31. 2023Neural Architecture Search: Insights from 1000 Paperscited by 136
  32. 2019Provable Filter Pruning for Efficient Neural Networkscited by 98
  33. 2020SCOP: Scientific Control for Reliable Neural Network Pruningcited by 92
  34. 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networkscited by 76
  35. 2019Towards Efficient Model Compression via Learned Global Rankingcited by 75
  36. 2020Reinforcement Learning for Non-Stationary Markov Decision Processes: The Blessing of (More) Optimismcited by 75
  37. 2020Operation-Aware Soft Channel Pruning using Differentiable Maskscited by 74
  38. 2020Good Subnetworks Provably Exist: Pruning via Greedy Forward Selectioncited by 70

50 most cited of 68 All 68 (JSON)

Built on by

Cited by year

Citing papers per year: 2024: 6; 2025: 3.

9 papers.