paper-with-me

Papers

Adaptive Activation-based Structured Pruning

2022-01-21 · Kaiqi Zhao, Animesh Jain, Ming Zhao

Pruning is a promising approach to compress complex 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 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 an adaptive, activation-based, structured pruning approach to automatically and efficiently generate small, accurate, and hardware-efficient models that meet user requirements. First, it proposes iterative structured pruning using activation-based attention feature 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 the proposed method can substantially outperform the state-of-the-art structured pruning works on CIFAR-10 and ImageNet datasets. For example, on ResNet-56 with CIFAR-10, without any accuracy drop, our method achieves the largest parameter reduction (79.11%), outperforming the related works by 22.81% to 66.07%, and the largest FLOPs reduction (70.13%), outperforming the related works by 14.13% to 26.53%.

📄 PDF Abstract BibTeX arXiv:2201.10520

Code (1)

kaiqi123/automatic-attention-pruning 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

Iterative Activation-based Structured Pruning

2022-01-22 · Kaiqi Zhao, Animesh Jain, Ming Zhao

Deploying complex deep learning models on edge devices is challenging because they have substantial compute and memory resource requirements, whereas edge devices' resource budget is limited. To solve this problem, exten…

CFSP: An Efficient Structured Pruning Framework for LLMs with Coarse-to-Fine Activation Information

2024-09-20 · Yuxin Wang, Minghua Ma, Zekun Wang, Jingchang Chen 외

The colossal parameters and computational overhead of Large Language Models (LLMs) challenge their real-world applications. Network pruning, which targets unstructured or structured sparsity by removing redundant paramet…

Network Pruning

Motivating Next-Gen Accelerators with Flexible (N:M) Activation Sparsity via Benchmarking Lightweight Post-Training Sparsification Approaches

2025-09-26 · Shirin Alanova, Kristina Kazistova, Ekaterina Galaeva, Alina Kostromina 외 arxiv

The demand for efficient large language model (LLM) inference has intensified the focus on sparsification techniques. While semi-structured (N:M) pruning is well-established for weights, its application to activation pru…

Automatic Attention Pruning: Improving and Automating Model Pruning using Attentions

2023-03-14 · Kaiqi Zhao, Animesh Jain, Ming Zhao

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 mode…

Train Large, Deploy Compact: Structured Compression for Compact Low-Rank Adaptation

2025-09-30 · Xin Yu, Cong Xie, Ziyu Zhao, Tiantian Fan 외 arxiv

Low-rank adaptation (LoRA) has become a widely used paradigm for parameter-efficient fine-tuning of large language models, yet its representational capacity often lags behind full fine-tuning. Within the context of LoRA,…

parameter-efficient fine-tuningNatural Language UnderstandingMathematical ReasoningCode Generation