Is Oracle Pruning the True Oracle?
Sicheng Feng, Keda Tao, Huan Wang
TL;DR
This work questions the 35-year reliance on oracle pruning by empirically linking pruned-train loss to post-retraining performance across a wide spectrum of models, from LeNet derivatives to large multimodal models. It introduces a Kendall $\tau$-based correlation framework plus anomaly and counterexample metrics to assess validity, and applies it to 37K trained models spanning MNIST to TinyLLaVA-3.1B. Across modern networks and datasets (CIFAR, ImageNet, ViTs, MLLMs), the pruned-train loss shows weak or negative predictive power for final performance after retraining, signaling that oracle pruning is not a reliable foundation today. The authors argue that rising task complexity and the retraining process must be accounted for when designing pruning criteria, and they demonstrate that even simple, non-oracle baselines may outperform oracle-driven methods, suggesting a retraining-aware paradigm for pruning research.
Abstract
Oracle pruning, which selects unimportant weights by minimizing the pruned train loss, has been taken as the foundation for most neural network pruning methods for over 35 years, while few (if not none) have thought about how much the foundation really holds. This paper, for the first time, attempts to examine its validity on modern deep models through empirical correlation analyses and provide reflections on the field of neural network pruning. Specifically, for a typical pruning algorithm with three stages (pertaining, pruning, and retraining), we analyze the model performance correlation before and after retraining. Extensive experiments (37K models are trained) across a wide spectrum of models (LeNet5, VGG, ResNets, ViT, MLLM) and datasets (MNIST and its variants, CIFAR10/CIFAR100, ImageNet-1K, MLLM data) are conducted. The results lead to a surprising conclusion: on modern deep learning models, the performance before retraining is barely correlated with the performance after retraining. Namely, the weights selected by oracle pruning can hardly guarantee a good performance after retraining. This further implies that existing works using oracle pruning to derive pruning criteria may be groundless from the beginning. Further studies suggest the rising task complexity is one factor that makes oracle pruning invalid nowadays. Finally, given the evidence, we argue that the retraining stage in a pruning algorithm should be accounted for when developing any pruning criterion.
