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

Jaeheun Jung, Jaehyuk Lee, Yeajin Lee, Donghun Lee
7/10/2025
cs.LGcs.AI

No confident code implementation found for this paper.

Abstract

With the growth of demand on neural network compression methods, the structured pruning methods including importance-based approach are actively studied. The magnitude importance and many correlated modern importance criteria often limit the capacity of pruning decision, since the filters with larger magnitudes are not likely to be pruned if the smaller one didn't, even if it is redundant. In this paper, we propose a novel pruning strategy to challenge this dominating effect of magnitude and provide fair chance to each filter to be pruned, by placing it on projective space. After that, we observe the gradient descent movement whether the filters move toward the origin or not, to measure how the filter is likely to be pruned. This measurement is used to construct PROscore, a novel importance score for IPPRO, a novel importance-based structured pruning with magnitude-indifference. Our evaluation results shows that the proposed importance criteria using the projective space achieves near-lossless pruning by reducing the performance drop in pruning, with promising performance after the finetuning. Our work debunks the ``size-matters'' myth in pruning and expands the frontier of importance-based pruning both theoretically and empirically.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{jung2025ippro,
  title  = {IPPRO: Importance-based Pruning with PRojective Offset for Magnitude-indifferent Structural Pruning},
  author = {Jaeheun Jung and Jaehyuk Lee and Yeajin Lee and Donghun Lee},
  year   = {2025},
  eprint = {2507.14171},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.14171v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.14171.svg)](https://codeofpaper.com/paper/2507.14171)

Discussion