Automatic Attention Pruning: Improving and Automating Model Pruning using Attentions

Kaiqi Zhao, Animesh Jain, Ming Zhao
3/14/2023
cs.LG

Official code: kaiqi123/Automatic-Attention-Pruning (5 stars, last commit 2023-10-25).

Abstract

Pruning is a promising approach to compress deep learning models in order to deploy them on resource-constrained edge devices. However, many existing pruning solutions are based on unstructured pruning, which yields models that cannot efficiently run on commodity hardware; and they often require users to manually explore and tune the pruning process, which is time-consuming and often leads to sub-optimal results. To address these limitations, this paper presents Automatic Attention Pruning (AAP), an adaptive, attention-based, structured pruning approach to automatically generate small, accurate, and hardware-efficient models that meet user objectives. First, it proposes iterative structured pruning using activation-based attention maps to effectively identify and prune unimportant filters. Then, it proposes adaptive pruning policies for automatically meeting the pruning objectives of accuracy-critical, memory-constrained, and latency-sensitive tasks. A comprehensive evaluation shows that AAP substantially outperforms the state-of-the-art structured pruning works for a variety of model architectures. Our code is at: https://github.com/kaiqi123/Automatic-Attention-Pruning.git.

View on arXivView PDF

Code Implementations(1)

50Shell, PythonFeb 24, 20232 years ago

Similar Papers

Cite this paper

@article{zhao2023automatic,
  title  = {Automatic Attention Pruning: Improving and Automating Model Pruning using Attentions},
  author = {Kaiqi Zhao and Animesh Jain and Ming Zhao},
  year   = {2023},
  eprint = {2303.08595},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.08595v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.08595.svg)](https://codeofpaper.com/paper/2303.08595)

Discussion