paper-with-me

Papers

Isomorphic Pruning for Vision Models

2024-07-05 · Gongfan Fang, Xinyin Ma, Michael Bi Mi, Xinchao Wang

Structured pruning reduces the computational overhead of deep neural networks by removing redundant sub-structures. However, assessing the relative importance of different sub-structures remains a significant challenge, particularly in advanced vision models featuring novel mechanisms and architectures like self-attention, depth-wise convolutions, or residual connections. These heterogeneous substructures usually exhibit diverged parameter scales, weight distributions, and computational topology, introducing considerable difficulty to importance comparison. To overcome this, we present Isomorphic Pruning, a simple approach that demonstrates effectiveness across a range of network architectures such as Vision Transformers and CNNs, and delivers competitive performance across different model sizes. Isomorphic Pruning originates from an observation that, when evaluated under a pre-defined importance criterion, heterogeneous sub-structures demonstrate significant divergence in their importance distribution, as opposed to isomorphic structures that present similar importance patterns. This inspires us to perform isolated ranking and comparison on different types of sub-structures for more reliable pruning. Our empirical results on ImageNet-1K demonstrate that Isomorphic Pruning surpasses several pruning baselines dedicatedly designed for Transformers or CNNs. For instance, we improve the accuracy of DeiT-Tiny from 74.52% to 77.50% by pruning an off-the-shelf DeiT-Base model. And for ConvNext-Tiny, we enhanced performance from 82.06% to 82.18%, while reducing the number of parameters and memory usage. Code is available at \url{https://github.com/VainF/Isomorphic-Pruning}.

📄 PDF Abstract BibTeX arXiv:2407.04616

Code (1)

vainf/isomorphic-pruning 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

Pruning 설명 없음

Similar Papers 제목 키워드 기반

GuP: Fast Subgraph Matching by Guard-based Pruning

2023-06-11 · Junya Arai, Yasuhiro Fujiwara, Makoto Onizuka

Subgraph matching, which finds subgraphs isomorphic to a query, is the key to information retrieval from data represented as a graph. To avoid redundant exploration in the data, existing methods restrict the search space…

Information RetrievalRetrieval

Rethinking Depth Pruning for Vision Transformers: A Heterogeneity-Aware Perspective

2026-07-04 · Zhenfeng Su, Kang Zhao, Han Bao, Tao Yuan 외 arxiv

While prior studies have successfully compressed vision Transformers (ViTs) through various pruning techniques, most have concentrated on width pruning to achieve significant reductions in model size. Depth pruning, whic…

MDP: Multidimensional Vision Model Pruning with Latency Constraint

2025-04-02 · CVPR 2025 1 · Xinglong Sun, Barath Lakshmanan, Maying Shen, Shiyi Lan 외

Current structural pruning methods face two significant limitations: (i) they often limit pruning to finer-grained levels like channels, making aggressive parameter reduction challenging, and (ii) they focus heavily on p…

IsoNN: Isomorphic Neural Network for Graph Representation Learning and Classification

2019-07-22 · Lin Meng, Jiawei Zhang

Deep learning models have achieved huge success in numerous fields, such as computer vision and natural language processing. However, unlike such fields, it is hard to apply traditional deep learning models on the graph …

ClassificationGeneral ClassificationGraph ClassificationGraph Matching+2

AgenticPruner: MAC-Constrained Neural Network Compression via LLM-Driven Strategy Search

2026-01-18 · Shahrzad Esmat, Mahdi Banisharif, Ali Jannesari arxiv

Neural network pruning remains essential for deploying deep learning models on resource-constrained devices, yet existing approaches primarily target parameter reduction without directly controlling computational cost. T…

Neural Network CompressionNetwork Pruning