Skip to content

PruneShift: A Framework for Evaluating Decision Reliability in Structured Pruning

Aug 2026 · 0 citations · 48 references
Computer Science

TL;DR

PruneShift, an evaluation framework that separates broad predictive fidelity, fidelity near selector outputs, and the quality of the selected pruning decision, is introduced, showing why predictive fit, decision reliability, and pruning method quality require separate evidence.

Abstract

Structured pruning uses surrogate objectives because direct task evaluation over every feasible mask is too expensive. Most evaluations report average surrogate error or rank correlation on broadly sampled masks. These summaries do not directly test the mask chosen by the surrogate. We introduce PruneShift, an evaluation framework that separates broad predictive fidelity, fidelity near selector outputs, and the quality of the selected pruning decision. We first prove that Spearman and Kendall agreement can approach one while normalized selection regret remains maximal. We then derive sufficient conditions based on uniform error, selector suboptimality, decision margin, density ratio, and comparison mass. The analysis also yields a finite pool certificate with an explicit excess cost bound. Four studies test different links in this argument. External TextbookQA confirmation is heterogeneous: 7 of 20 simultaneous intervals favor the surrogate-selected mask, 6 favor its fixed comparator, and 7 cross zero. On a fixed Natural Questions pool, strict improvement holds in one of four settings. A controlled QQP experiment supports the proposed coverage mechanism in all 16 prespecified endpoints, although the sufficient bounds are conservative. Finally, a restricted OSSCAR reconstruction study on OPT-125M shows better local than broad fidelity in 68 of 75 primary endpoints. Independent fixed-mask confirmation is inconclusive in 24 of 25 endpoints and favors the comparator in one. These results show why predictive fit, decision reliability, and pruning method quality require separate evidence.

View source

Similar papers

Preprint Aug 2026

Knowing When to Stop: Bayesian Optimal Stopping for LLM Evaluations

LLM evaluations often use fixed sampling budgets, testing every item the same number of times even after estimates are precise. We introduce optstop, a precision-based adaptive stopping framework that treats evaluation as a sequential measurement problem: keep sampling where uncertainty remains high, and stop where est...

Toby D. Pilditch · 2 citations
#artificial intelligence Preprint Sep 2026

Overwhelmed by Choice: Studying LLM Decision Making at Scale

It is shown that strong small-option performance does not necessarily imply robust large-scale candidate comparison and that hierarchical partitioning and permutation-based inference improve accuracy by roughly 20 percentage points at $N=160$ on both HotpotQA and MIMIC.

Yu-Chi Lin, Aryan Seth, A. Aravind et al. · 1 citation
Open access Aug 2026

Score Cloud Analysis for Rule-Aware Ranking Robustness Under Discrete Judgment Uncertainty

Rule-defined rankings often transform continuous marks, discrete judgments, trimming rules, caps, truncation, and tie-breaking variables into a single official order. When ranking margins are small, a formally valid outcome may nevertheless be sensitive to marginal changes in the recorded decision state. This article p...

Sebastiano Ettore Spoto · 0 citations
Preprint Sep 2026

Oracle Gaps in Reliability Coverage: Sampling Noise or Policy Specialization?

Policies trained from the same base model can appear to solve different problems. An oracle that chooses the best policy for each problem may therefore appear much stronger than any single policy. Selecting the largest estimated success rate also selects favorable sampling errors. We study this effect through reliabili...

Mert Onur Cakiroglu, M. Dalkilic, H. Kurban · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.