paper-with-me

Papers

REPrune: Channel Pruning via Kernel Representative Selection

2024-02-27 · Mincheol Park, DongJin Kim, Cheonjun Park, Yuna Park, Gyeong Eun Gong, Won Woo Ro, Suhyun Kim

Channel pruning is widely accepted to accelerate modern convolutional neural networks (CNNs). The resulting pruned model benefits from its immediate deployment on general-purpose software and hardware resources. However, its large pruning granularity, specifically at the unit of a convolution filter, often leads to undesirable accuracy drops due to the inflexibility of deciding how and where to introduce sparsity to the CNNs. In this paper, we propose REPrune, a novel channel pruning technique that emulates kernel pruning, fully exploiting the finer but structured granularity. REPrune identifies similar kernels within each channel using agglomerative clustering. Then, it selects filters that maximize the incorporation of kernel representatives while optimizing the maximum cluster coverage problem. By integrating with a simultaneous training-pruning paradigm, REPrune promotes efficient, progressive pruning throughout training CNNs, avoiding the conventional train-prune-finetune sequence. Experimental results highlight that REPrune performs better in computer vision tasks than existing methods, effectively achieving a balance between acceleration ratio and performance retention.

📄 PDF Abstract BibTeX arXiv:2402.17862

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Pruning 설명 없음
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…

Similar Papers 제목 키워드 기반

REPrune: Filter Pruning via Representative Election

2020-07-14 · Mincheol Park, Woojeong Kim, Suhyun Kim

Even though norm-based filter pruning methods are widely accepted, it is questionable whether the "smaller-norm-less-important" criterion is optimal in determining filters to prune. Especially when we can keep only a sma…

Clustering

C2S2: Cost-aware Channel Sparse Selection for Progressive Network Pruning

2019-04-06 · Chih-Yao Chiu, Hwann-Tzong Chen, Tyng-Luh Liu

This paper describes a channel-selection approach for simplifying deep neural networks. Specifically, we propose a new type of generic network layer, called pruning layer, to seamlessly augment a given pre-trained model …

channel selectionimage-classificationImage ClassificationNetwork Pruning+1

Rotation-Aligned Key Channel Pruning for Efficient Vision-Language Model Inference

2026-05-19 · Beomseok Kang, Dongwon Jo, Jiwon Song, Donghwee Son 외 arxiv

Vision-Language Models suffer severe KV cache pressure at inference, as a single image often encodes into thousands of tokens. Most existing methods exploit token sparsity through token pruning, but permanently discardin…

Discrimination-aware Network Pruning for Deep Model Compression

2020-01-04 · Jing Liu, Bohan Zhuang, Zhuangwei Zhuang, Yong Guo 외

We study network pruning which aims to remove redundant channels/kernels and hence speed up the inference of deep networks. Existing pruning methods either train from scratch with sparsity constraints or minimize the rec…

Face Recognitionimage-classificationImage Classificationmodel+2

KCP: Kernel Cluster Pruning for Dense Labeling Neural Networks

2021-01-17 · Po-Hsiang Yu, Sih-Sian Wu, Liang-Gee Chen

Pruning has become a promising technique used to compress and accelerate neural networks. Existing methods are mainly evaluated on spare labeling applications. However, dense labeling applications are those closer to rea…

ClusteringSemantic SegmentationStereo Matching