paper-with-me

홈 › Papers

Magnitude Attention-based Dynamic Pruning

2023-06-08 · Jihye Back, Namhyuk Ahn, Jangho Kim

Existing pruning methods utilize the importance of each weight based on specified criteria only when searching for a sparse structure but do not utilize it during training. In this work, we propose a novel approach - \textbf{M}agnitude \textbf{A}ttention-based Dynamic \textbf{P}runing (MAP) method, which applies the importance of weights throughout both the forward and backward paths to explore sparse model structures dynamically. Magnitude attention is defined based on the magnitude of weights as continuous real-valued numbers enabling a seamless transition from a redundant to an effective sparse network by promoting efficient exploration. Additionally, the attention mechanism ensures more effective updates for important layers within the sparse network. In later stages of training, our approach shifts from exploration to exploitation, exclusively updating the sparse model composed of crucial weights based on the explored structure, resulting in pruned models that not only achieve performance comparable to dense models but also outperform previous pruning methods on CIFAR-10/100 and ImageNet.

📄 PDF Abstract BibTeX arXiv:2306.05056

Code (0)

등록된 구현이 없습니다.

Tasks

Efficient Exploration

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

An Operator Theoretic View on Pruning Deep Neural Networks

2021-10-28 · ICLR 2022 4 · William T. Redman, Maria Fonoberova, Ryan Mohr, Ioannis G. Kevrekidis 외

The discovery of sparse subnetworks that are able to perform as well as full models has found broad applied and theoretical interest. While many pruning methods have been developed to this end, the na\"ive approach of re…

Budget-Aware Graph Convolutional Network Design using Probabilistic Magnitude Pruning

2023-05-30 · Hichem Sahbi

Graph convolutional networks (GCNs) are nowadays becoming mainstream in solving many image processing tasks including skeleton-based recognition. Their general recipe consists in learning convolutional and attention laye…

Less Is More: Domain Adaptation with Lottery Ticket for Reading Comprehension

2021-11-01 · Findings (EMNLP) 2021 11 · Haichao Zhu, Zekun Wang, Heng Zhang, Ming Liu 외

In this paper, we propose a simple few-shot domain adaptation paradigm for reading comprehension. We first identify the lottery subnetwork structure within the Transformer-based source domain model via gradual magnitude …

Domain AdaptationReading Comprehension

Lightweight Graph Convolutional Networks with Topologically Consistent Magnitude Pruning

2022-03-25 · Hichem Sahbi

Graph convolution networks (GCNs) are currently mainstream in learning with irregular data. These models rely on message passing and attention mechanisms that capture context and node-to-node relationships. With multi-he…

The silence of the weights: a structural pruning strategy for attention-based audio signal architectures with second order metrics

2025-09-30 · Andrea Diecidue, Carlo Alberto Barbano, Piero Fraternali, Mathieu Fontaine 외 arxiv

Transformer-based models have become the state of the art across multiple domains, from natural language processing to machine listening, thanks to the attention mechanisms. However, the attention layers require a large …