paper-with-me

Papers

Single-path Bit Sharing for Automatic Loss-aware Model Compression

2021-01-13 · Jing Liu, Bohan Zhuang, Peng Chen, Chunhua Shen, Jianfei Cai, Mingkui Tan

Network pruning and quantization are proven to be effective ways for deep model compression. To obtain a highly compact model, most methods first perform network pruning and then conduct network quantization based on the pruned model. However, this strategy may ignore that they would affect each other and thus performing them separately may lead to sub-optimal performance. To address this, performing pruning and quantization jointly is essential. Nevertheless, how to make a trade-off between pruning and quantization is non-trivial. Moreover, existing compression methods often rely on some pre-defined compression configurations. Some attempts have been made to search for optimal configurations, which however may take unbearable optimization cost. To address the above issues, we devise a simple yet effective method named Single-path Bit Sharing (SBS). Specifically, we first consider network pruning as a special case of quantization, which provides a unified view for pruning and quantization. We then introduce a single-path model to encode all candidate compression configurations. In this way, the configuration search problem is transformed into a subset selection problem, which significantly reduces the number of parameters, computational cost and optimization difficulty. Relying on the single-path model, we further introduce learnable binary gates to encode the choice of bitwidth. By jointly training the binary gates in conjunction with network parameters, the compression configurations of each layer can be automatically determined. Extensive experiments on both CIFAR-100 and ImageNet show that SBS is able to significantly reduce computational cost while achieving promising performance. For example, our SBS compressed MobileNetV2 achieves 22.6x Bit-Operation (BOP) reduction with only 0.1% drop in the Top-1 accuracy.

📄 PDF Abstract BibTeX arXiv:2101.04935

Code (0)

등록된 구현이 없습니다.

Tasks

Model CompressionNetwork PruningQuantization

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

Perceptual Implications of Automatic Anonymization in Pathological Speech

2025-05-01 · Soroosh Tayebi Arasteh, Saba Afza, Tri-Thien Nguyen, Lukas Buess 외

Automatic anonymization techniques are essential for ethical sharing of pathological speech data, yet their perceptual consequences remain understudied. This study presents the first comprehensive human-centered analysis…

Diagnostic

Multi-Drone based Single Object Tracking with Agent Sharing Network

2020-03-16 · Pengfei Zhu, Jiayu Zheng, Dawei Du, Longyin Wen 외

Drone equipped with cameras can dynamically track the target in the air from a broader view compared with static cameras or moving sensors over the ground. However, it is still challenging to accurately track the target …

Object Tracking

Fodis: software for protein unfolding analysis

2018-09-27

The folding dynamics of proteins at the single molecule level has been studied with single-molecule force spectroscopy (SMFS) experiments for twenty years, but a common standardized method for the analysis of the collect…

Classification

Pruning Self-attentions into Convolutional Layers in Single Path

2021-11-23 · Haoyu He, Jianfei Cai, Jing Liu, Zizheng Pan 외

Vision Transformers (ViTs) have achieved impressive performance over various computer vision tasks. However, modeling global correlations with multi-head self-attention (MSA) layers leads to two widely recognized issues:…

Efficient ViTsInductive BiasNeural Architecture Search

Single-Path NAS: Device-Aware Efficient ConvNet Design

2019-05-10 · Dimitrios Stamoulis, Ruizhou Ding, Di Wang, Dimitrios Lymberopoulos 외

Can we automatically design a Convolutional Network (ConvNet) with the highest image classification accuracy under the latency constraint of a mobile device? Neural Architecture Search (NAS) for ConvNet design is a chall…

General ClassificationGPUimage-classificationImage Classification+1