mlsanityData to 7 Oct 2026

Relative Repairability: A Calibration-Based Diagnostic for High-Sparsity Post-Pruning Allocation

arXiv 2605.25508 ↗First posted 25 May 2026cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

At very high sparsity, neural network pruning does more than decide which weights remain. It also determines where pruning induced damage is placed across the network, and whether that damage can be recovered by a fixed lightweight repair procedure. We study this problem through the lens of repair conditioned sparsity allocation. We introduce Relative Repairability (RR), a calibration based diagnostic that compares the raw activation distortion caused by layerwise pruning with the residual distortion left after channelwise variance matching repair. RR estimates the fraction of local damage that remains after repair, using only unlabeled calibration data. Across ResNet18, ResNet34, and VGG16 BN on CIFAR10 and CIFAR100, we find that RR is not a universally dominant allocation rule. Instead, it is most useful near an architecture dependent recoverability transition, where standard structural or magnitude based allocation priors begin to lose reliability but post repair recovery has not yet fully collapsed. On CIFAR100 ResNet18, a fine grained sweep shows that RR improves over ERK across the central transition band and surpasses LAMP near the upper part of this band. A projection forced ablation further shows that capped ERK can over protect projection layers, shifting excessive sparsity onto regular convolutions and reducing post repair recovery. These results suggest that high sparsity pruning should allocate not only retained weights, but also repairable damage.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 17 references that are in the map. First posted on arXiv 25 May 2026.

Builds on

14 of 17 references.

References · 14

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  3. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  4. 2016Pruning Filters for Efficient ConvNetscited by 1,129
  5. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  6. 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
  7. 2020Up or Down? Adaptive Rounding for Post-Training Quantizationcited by 600
  8. 2020What is the State of Neural Network Pruning?cited by 578
  9. 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
  10. 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 122
  11. 2022REPAIR: REnormalizing Permuted Activations for Interpolation Repaircited by 119
  12. 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
2 more
  1. 2021Post-training deep neural network pruning via layer-wise calibrationcited by 23
  2. 2025Signal Collapse in One-Shot Pruning: When Sparse Models Fail to Distinguish Neural Representationscited by 5

Built on by

Not cited yet.