DECORE: Deep Compression with Reinforcement Learning
Manoj Alwani, Yang Wang, Vashisht Madhavan
摘要
Deep learning has become an increasingly popular and powerful methodology for modern pattern recognition systems. However, many deep neural networks have millions or billions of parameters, making them untenable for realworld applications due to constraints on memory size or latency requirements. As a result, efficient network compression techniques are often required for the widespread adoption of deep learning methods. We present DECORE, a reinforcement learning-based approach to automate the network compression process. DECORE assigns an agent to each channel in the network along with a light policy gradient method to learn which neurons or channels to be kept or removed. Each agent in the network has just one parameter (keep or drop) to learn, which leads to a much faster training process compared to existing approaches. DECORE provides state-of-the-art compression results on various network architectures and various datasets. For example, on the ResNet-110 architecture, it achieves a 64.8% compression and 61.8% FLOPs reduction as compared to the baseline model without any accuracy loss on the CIFAR-10 dataset. It can reduce the size of regular architectures like the VGG network by up to 99% with just a small accuracy drop of 2.28%. For a larger dataset like ImageNet with only 30 epochs of training, it can compress the ResNet-50 architecture by 44.7% and reduce FLOPs by 42.3%, with just a 0.69% drop on Top-5 accuracy of the uncompressed model. We also demonstrate that DECORE can be used to search for compressed network architectures based on various constraints, such as memory and FLOPs.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper6
- HALOC: Hardware-Aware Automatic Low-Rank Compression for Compact Neural NetworksJinqi Xiao, Chengming Zhang, Yu Gong, Miao Yin 等AAAI 2023 · 被引用 35 次
- Automatic Network Pruning via Hilbert-Schmidt Independence Criterion Lasso under Information Bottleneck PrincipleSong Guo, Lei Zhang, Xiawu Zheng, Yan Wang 等ICCV 2023 · 被引用 30 次
- Towards Efficient Convolutional Neural Network for Embedded Hardware via Multi-Dimensional PruningHao Kong, Di Liu, Xiangzhong Luo, Shuo Huai 等DAC 2023 · 被引用 2 次
- V-Pruner: A Fast and Globally-informed Token Pruning Framework for Vision TransformerGuangzhen Yao, Jiayun Zheng, Zezhou Wang, Wenxin Zhang 等AAAI 2026 · 被引用 1 次
- Continual Semantic Segmentation with Automatic Memory Sample SelectionLanyun Zhu, Tianrun Chen, Jianxiong Yin, Simon See 等CVPR 2023
它引用的顶会 Paper2
相关 Paper
- Topology-Aware Network Pruning using Multi-stage Graph Embedding and Reinforcement LearningSixing Yu, Arya Mazaheri, Ali JannesariICML 2022 · 被引用 54 次
- Auto Graph Encoder-Decoder for Neural Network PruningSixing Yu, Arya Mazaheri, Ali JannesariICCV 2021 · 被引用 47 次
- AutoCompress: An Automatic DNN Structured Pruning Framework for Ultra-High Compression RatesNing Liu, Xiaolong Ma, Zhiyuan Xu, Yanzhi Wang 等AAAI 2020 · 被引用 204 次
- Storage Efficient and Dynamic Flexible Runtime Channel Pruning via Deep Reinforcement LearningJianda Chen, Shangyu Chen, Sinno Jialin PanNeurIPS 2020 · 被引用 31 次
- Jointly Training and Pruning CNNs via Learnable Agent Guidance and AlignmentAlireza Ganjdanesh, Shangqian Gao, Heng HuangCVPR 2024
