ICP: Immediate Compensation Pruning for Mid-to-high Sparsity

Xin Luo, Xueming Fu, Zihang Jiang, S. K. Zhou
2/10/2026

No official code found. Best implementation: loloto/ICP (1 star, MIT, last commit 2025-06-01).

Abstract

The increasing adoption of large-scale models under 7 billion parameters in both language and vision domains enables inference tasks on a single consumer-grade GPU but makes fine-tuning models of this scale, especially 7B models, challenging. This limits the applicability of pruning methods that require full fine-tuning. Meanwhile, pruning methods that do not require fine-tuning perform well at low sparsity levels (10%-50%) but struggle at mid-to-high sparsity levels (50%-70%), where the error behaves equivalently to that of semi-structured pruning. To address these issues, this paper introduces ICP, which finds a balance between full fine-tuning and zero fine-tuning. First, Sparsity Rearrange is used to reorganize the predefined sparsity levels, followed by Block-wise Compensate Pruning, which alternates pruning and compensation on the model’s backbone, fully utilizing inference results while avoiding full model fine-tuning. Experiments show that ICP improves performance at mid-to-high sparsity levels compared to baselines, with only a slight increase in pruning time and no additional peak memory overhead.

DOISemantic Scholar

Code Implementations(1)

loloto/ICPCommunity67%
MIT

Official implementation of the paper: "ICP: Immediate Compensation Pruning for Mid-to-high Sparsity." This repository provides the code and experiments for reproducing the results presented in the paper.

10Shell, PythonJun 1, 20251 years agoMIT

Cite this paper

@article{luo2026icp,
  title  = {ICP: Immediate Compensation Pruning for Mid-to-high Sparsity},
  author = {Xin Luo and Xueming Fu and Zihang Jiang and S. K. Zhou},
  year   = {2026},
  doi    = {10.1109/CVPR52734.2025.00886},
  url    = {https://doi.org/10.1109/CVPR52734.2025.00886},
  journal = {CVPR 2025 2025}
}

Discussion