paper-with-me

Papers

Towards Optimal Structured CNN Pruning via Generative Adversarial Learning

2019-03-22 · CVPR 2019 6 · Shaohui Lin, Rongrong Ji, Chenqian Yan, Baochang Zhang, Liujuan Cao, Qixiang Ye, Feiyue Huang, David Doermann

Structured pruning of filters or neurons has received increased focus for compressing convolutional neural networks. Most existing methods rely on multi-stage optimizations in a layer-wise manner for iteratively pruning and retraining which may not be optimal and may be computation intensive. Besides, these methods are designed for pruning a specific structure, such as filter or block structures without jointly pruning heterogeneous structures. In this paper, we propose an effective structured pruning approach that jointly prunes filters as well as other structures in an end-to-end manner. To accomplish this, we first introduce a soft mask to scale the output of these structures by defining a new objective function with sparsity regularization to align the output of baseline and network with this mask. We then effectively solve the optimization problem by generative adversarial learning (GAL), which learns a sparse soft mask in a label-free and an end-to-end manner. By forcing more scaling factors in the soft mask to zero, the fast iterative shrinkage-thresholding algorithm (FISTA) can be leveraged to fast and reliably remove the corresponding structures. Extensive experiments demonstrate the effectiveness of GAL on different datasets, including MNIST, CIFAR-10 and ImageNet ILSVRC 2012. For example, on ImageNet ILSVRC 2012, the pruned ResNet-50 achieves 10.88\% Top-5 error and results in a factor of 3.7x speedup. This significantly outperforms state-of-the-art methods.

📄 PDF Abstract BibTeX arXiv:1903.09291

Code (1)

ShaohuiLin/GAL 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

One Less Reason for Filter Pruning: Gaining Free Adversarial Robustness with Structured Grouped Kernel Pruning

2023-09-21 · NeurIPS 2023 11

Densely structured pruning methods utilizing simple pruning heuristics can deliver immediate compression and acceleration benefits with acceptable benign performances. However, empirical findings indicate such naively pr…

Towards Higher Ranks via Adversarial Weight Pruning

2023-11-29 · NeurIPS 2023 11 · Yuchuan Tian, Hanting Chen, Tianyu Guo, Chao Xu 외

Convolutional Neural Networks (CNNs) are hard to deploy on edge devices due to its high computation and storage complexities. As a common practice for model compression, network pruning consists of two major categories: …

Model CompressionNetwork Pruning

SlimGPT: Layer-wise Structured Pruning for Large Language Models

2024-12-24 · Gui Ling, Ziyang Wang, Yuliang Yan, Qingwen Liu

Large language models (LLMs) have garnered significant attention for their remarkable capabilities across various domains, whose vast parameter scales present challenges for practical deployment. Structured pruning is an…

STUN: Structured-Then-Unstructured Pruning for Scalable MoE Pruning

2024-09-10 · Jaeseong Lee, Seung-won Hwang, Aurick Qiao, Daniel F Campos 외

Mixture-of-experts (MoEs) have been adopted for reducing inference costs by sparsely activating experts in Large language models (LLMs). Despite this reduction, the massive number of experts in MoEs still makes them expe…

GSM8KMixture-of-Experts

What Matters In The Structured Pruning of Generative Language Models?

2023-02-07 · Michael Santacroce, Zixin Wen, Yelong Shen, Yuanzhi Li

Auto-regressive large language models such as GPT-3 require enormous computational resources to use. Traditionally, structured pruning methods are employed to reduce resource usage. However, their application to and effi…

Text Generation