paper-with-me

홈 › Papers

IPPRO: Importance-based Pruning with PRojective Offset for Magnitude-indifferent Structural Pruning

2025-07-10 · Jaeheun Jung, Jaehyuk Lee, Yeajin Lee, Donghun Lee arxiv

Importance-based structured pruning overwhelmingly relies on filter magnitude. This proxy is fundamentally flawed: due to scale invariance, functionally identical filters can receive arbitrarily different importance scores under rescaling. We propose IPPRO (Importance-based Pruning with PROjective Offset), a scale-invariant pruning framework grounded in projective geometry. By embedding filters into real projective space ($\mathbb{RP}^N$), IPPRO resolves the singularity at the origin, placing all filters at an equal angular distance from the zero filter. We define PROscore, which captures functional importance by measuring a filter's angular displacement toward zero under a single gradient step (directional collapse). We further connect PROscore to exact $L_0$ relaxation, proving this one-shot criterion reliably predicts multi-step pruning dynamics. Extensive experiments across CNNs, Vision Transformers, and LLMs (e.g., ResNet, DeiT, LLaMA) demonstrate that IPPRO consistently outperforms existing methods, yielding particularly striking gains under high compression and no-fine-tuning regimes, IPPRO establishes a robust, architecture-agnostic paradigm for neural network compression.

📄 PDF Abstract BibTeX arXiv:2507.14171

Code (0)

등록된 구현이 없습니다.

Tasks

Neural Network Compression

Similar Papers 제목 키워드 기반

Exploring Weight Importance and Hessian Bias in Model Pruning

2020-06-19 · Mingchen Li, Yahya Sattar, Christos Thrampoulidis, Samet Oymak

Model pruning is an essential procedure for building compact and computationally-efficient machine learning models. A key feature of a good pruning algorithm is that it accurately quantifies the relative importance of th…

Insights into the Lottery Ticket Hypothesis and Iterative Magnitude Pruning

2024-03-22 · Tausifa Jan Saleem, Ramanjit Ahuja, Surendra Prasad, Brejesh lall

Lottery ticket hypothesis for deep neural networks emphasizes the importance of initialization used to re-train the sparser networks obtained using the iterative magnitude pruning process. An explanation for why the spec…

Layer-adaptive sparsity for the Magnitude-based Pruning

2020-10-15 · ICLR 2021 1 · Jaeho Lee, Sejun Park, Sangwoo Mo, Sungsoo Ahn 외

Recent discoveries on neural network pruning reveal that, with a carefully chosen layerwise sparsity, a simple magnitude-based pruning achieves state-of-the-art tradeoff between sparsity and performance. However, without…

image-classificationImage ClassificationNetwork Pruning

Filter Pruning by Switching to Neighboring CNNs with Good Attributes

2019-04-08 · Yang He, Ping Liu, Linchao Zhu, Yi Yang

Filter pruning is effective to reduce the computational costs of neural networks. Existing methods show that updating the previous pruned filter would enable large model capacity and achieve better performance. However, …

Attributeimage-classificationImage Classification

Spiking Layer-Adaptive Magnitude-based Pruning

2026-03-16 · Junqiao Wang, Zhehang Ye, Yuqi Ouyang arxiv

Spiking Neural Networks (SNNs) provide energy-efficient computation but their deployment is constrained by dense connectivity and high spiking operation costs. Existing magnitude-based pruning strategies, when naively ap…