Dynamic Structure Pruning for Compressing CNNs
نویسندگان
چکیده
Structure pruning is an effective method to compress and accelerate neural networks. While filter channel are preferable other structure methods in terms of realistic acceleration hardware compatibility, with a finer granularity, such as intra-channel pruning, expected be capable yielding more compact computationally efficient Typical utilize static hand-crafted granularity due large search space, which leaves room for improvement their performance. In this work, we introduce novel method, termed dynamic identify optimal granularities pruning. contrast existing methods, the proposed automatically optimizes each layer while training deep To achieve this, propose differentiable group learning designed efficiently learn based on gradient-based groups. The experimental results show that achieves state-of-the-art performance better GPU compared particular, it reduces FLOPs ResNet50 by 71.85% without accuracy degradation ImageNet dataset. Our code available at https://github.com/irishev/DSP.
منابع مشابه
Neuron Pruning for Compressing Deep Networks Using Maxout Architectures
This paper presents an efficient and robust approach for reducing the size of deep neural networks by pruning entire neurons. It exploits maxout units for combining neurons into more complex convex functions and it makes use of a local relevance measurement that ranks neurons according to their activation on the training set for pruning them. Additionally, a parameter reduction comparison betwe...
متن کاملDynamic LZW for Compressing Large Files
The amount of data stored digitally continues to grow dramatically across many fields, along with the need for algorithms to efficiently compress this data for storage and transmission. In this paper, we describe an improvement of LZW data compression. We employ a dynamic dictionary, in which least recently used and aging algorithms are used to replace infrequently used entries. We demonstrate ...
متن کاملCompressing graphs with semantic structure
Graph compression schemes are based on finding an ordering or clustering of nodes that places similar nodes close to one another. Existing algorithms for Web graphs and social networks tend to only consider nodes and edges, where each node comes with some identifier (a name or number), and edges are either directed or undirected but otherwise unlabeled. However, real world graphs tend to come w...
متن کاملDynamic Search-space Pruning for T Recognitio
In automatic speech recognition complex state spaces are searched during the recognition process. By limiting these search spaces the computation time can be reduced, but unfortunately the recognition rate mostly decreases, too. However, especially for time-critical recognition tasks a search-space pruning is necessary. Therefore, we developed a dynamic mechanism to optimize the pruning paramet...
متن کاملDynamic Thresholding and Pruning for Regret Minimization
Regret minimization is widely used in determining strategies for imperfect-information games and in online learning. In large games, computing the regrets associated with a single iteration can be slow. For this reason, pruning – in which parts of the decision tree are not traversed in every iteration – has emerged as an essential method for speeding up iterations in large games. The ability to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence
سال: 2023
ISSN: ['2159-5399', '2374-3468']
DOI: https://doi.org/10.1609/aaai.v37i8.26127