Dynamic Slimmable Network
Changlin Li, Guangrun Wang, Bing Wang, Xiaodan Liang, Zhihui Li, Xiaojun Chang
摘要
Current dynamic networks and dynamic pruning methods have shown their promising capability in reducing theoretical computation complexity. However, dynamic sparse patterns on convolutional filters fail to achieve actual acceleration in real-world implementation, due to the extra burden of indexing, weight-copying, or zero-masking. Here, we explore a dynamic network slimming regime, named Dynamic Slimmable Network (DS-Net), which aims to achieve good hardware-efficiency via dynamically adjusting filter numbers of networks at test time with respect to different inputs, while keeping filters stored statically and contiguously in hardware to prevent the extra burden. Our DS-Net is empowered with the ability of dynamic inference by the proposed double-headed dynamic gate that comprises an attention head and a slimming head to predictively adjust network width with negligible extra computation cost. To ensure generality of each candidate architecture and the fairness of gate, we propose a disentangled two-stage training scheme inspired by one-shot NAS. In the first stage, a novel training technique for weight-sharing networks named In-place Ensemble Bootstrapping is proposed to improve the supernet training efficacy. In the second stage, Sandwich Gate Sparsification is proposed to assist the gate training by identifying easy and hard samples in an online way. Extensive experiments demonstrate our DS-Net consistently outperforms its static counterparts as well as state-of-the-art static and dynamic model compression methods by a large margin (up to 5.9%). Typically, DS-Net achieves 2-4× computation reduction and 1.62× real-world acceleration over ResNet-50 and MobileNet with minimal accuracy drops on ImageNet. 1
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper46
- BossNAS: Exploring Hybrid CNN-transformers with Block-wisely Self-supervised Neural Architecture SearchChanglin Li, Tao Tang, Guangrun Wang, Jiefeng Peng 等ICCV 2021 · 被引用 123 次
- iDARTS: Differentiable Architecture Search with Stochastic Implicit GradientsMiao Zhang, Steven W. Su, Shirui Pan, Xiaojun Chang 等ICML 2021 · 被引用 81 次
- CHEX: CHannel EXploration for CNN Model CompressionZejiang Hou, Minghai Qin, Fei Sun, Xiaolong Ma 等CVPR 2022 · 被引用 80 次
- ProgFed: Effective, Communication, and Computation Efficient Federated Learning by Progressive TrainingHui-Po Wang, Sebastian U. Stich, Yang He, Mario FritzICML 2022 · 被引用 70 次
- LightCTS: A Lightweight Framework for Correlated Time Series ForecastingZhichen Lai, Dalin Zhang, Huan Li, Christian S. Jensen 等SIGMOD 2023 · 被引用 60 次
它引用的顶会 Paper14
- Bootstrap Your Own Latent - A New Approach to Self-Supervised LearningJean-Bastien Grill, Florian Strub, Florent Altché, Corentin Tallec 等NeurIPS 2020 · 被引用 9,171 次
- Once-for-All: Train One Network and Specialize it for Efficient DeploymentHan Cai, Chuang Gan, Tianzhe Wang, Zhekai Zhang 等ICLR 2020 · 被引用 1,522 次
- MetaPruning: Meta Learning for Automatic Neural Network Channel PruningZechun Liu, Haoyuan Mu, Xiangyu Zhang, Zichao Guo 等ICCV 2019 · 被引用 633 次
- Universally Slimmable Networks and Improved Training TechniquesJiahui Yu, Thomas S. HuangICCV 2019 · 被引用 444 次
- Hierarchical Neural Architecture Search for Deep Stereo MatchingXuelian Cheng, Yiran Zhong, Mehrtash Harandi, Yuchao Dai 等NeurIPS 2020 · 被引用 436 次
相关 Paper
- Dynamic Dual Gating Neural NetworksFanrong Li, Gang Li, Xiangyu He, Jian ChengICCV 2021 · 被引用 40 次
- Stitchable Neural NetworksZizheng Pan, Jianfei Cai, Bohan ZhuangCVPR 2023
- Hardware-friendly Scalable Image Super Resolution with Progressive Structured SparsityFangchen Ye, Jin Lin, Hongzhan Huang, Jianping Fan 等ACM MM 2023 · 被引用 2 次
- Dynamic Structure Pruning for Compressing CNNsJun-Hyung Park, Yeachan Kim, Junho Kim, Joon-Young Choi 等AAAI 2023 · 被引用 24 次
- DEPrune: Depth-wise Separable Convolution Pruning for Maximizing GPU ParallelismCheonjun Park, Mincheol Park, Hyunchan Moon, Myung Kuk Yoon 等NeurIPS 2024 · 被引用 10 次
