Beyond One-Way Pruning: Bidirectional Pruning-Regrowth for Extreme Accuracy-Sparsity Tradeoff

Junchen Liu, Yi Sheng
11/11/2025
cs.LGcs.AI

No official code found. Best implementation: liu-jun-chen/Bidirection-Prune-Regrowth (0 stars, last commit 2025-12-14).

Abstract

As a widely adopted model compression technique, model pruning has demonstrated strong effectiveness across various architectures. However, we observe that when sparsity exceeds a certain threshold, both iterative and one-shot pruning methods lead to a steep decline in model performance. This rapid degradation limits the achievable compression ratio and prevents models from meeting the stringent size constraints required by certain hardware platforms, rendering them inoperable. To overcome this limitation, we propose a bidirectional pruning-regrowth strategy. Starting from an extremely compressed network that satisfies hardware constraints, the method selectively regenerates critical connections to recover lost performance, effectively mitigating the sharp accuracy drop commonly observed under high sparsity conditions.

View on arXivView PDF

Code Implementations(1)

This is the implementation for abstract: Beyond One-Way Pruning: Bidirectional Pruning-Regrowth for Extreme Accuracy-Sparsity Tradeoff

01Shell, PythonDec 14, 202510 months ago

Similar Papers

Cite this paper

@article{liu2025beyond,
  title  = {Beyond One-Way Pruning: Bidirectional Pruning-Regrowth for Extreme Accuracy-Sparsity Tradeoff},
  author = {Junchen Liu and Yi Sheng},
  year   = {2025},
  eprint = {2511.11675},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.11675v1}
}

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/2511.11675.svg)](https://codeofpaper.com/paper/2511.11675)

Discussion