Certifying Model Upgrades with Slice-Wise Non-Regression and Incumbent Fallback
Not on the map. Why?
Abstract (arXiv)
An updated model can improve an aggregate metric while degrading a slice that matters to a downstream user. We study checkpoint selection subject to non-regression tolerances relative to a retained incumbent. The central distinction is between failing to detect harm and certifying non-inferiority: the former can release harmful updates with high probability when evaluation is noisy. We give a reproducible release procedure that separates candidate search from independent, paired evaluation and returns the exact incumbent when certification fails. Applying established intersection-union and Learn-then-Test principles, we state finite-sample guarantees for one frozen candidate, a finite candidate library, and a prespecified testing order. A joint release decision does not require a slice-count Bonferroni penalty, although certification power can still decrease with the number of slices. In bounded-score simulations, a no-detected-harm gate releases a harmful candidate in 99.7% of trials in one 32-slice setting, compared with 2.6% for an exact non-inferiority gate at a 5% target. A constructed two-block family yields larger certified utility than a scalar path under matched candidate counts. Public digits experiments, including a subsequent continuation that improves average aggregate accuracy, return the incumbent in every run because certification is underpowered. These results establish an auditable protocol and its limitations; they do not establish benefits on foundation-model or multilingual translation upgrades.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 8 of its 16 references that are in the map. First posted on arXiv 12 Sep 2026.
Builds on
8 of 16 references.
References · 8
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
- 2021Robust fine-tuning of zero-shot modelscited by 797
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
- 2021Learn then Test: Calibrating Predictive Algorithms to Achieve Risk Controlcited by 271
- 2024MAP: Low-compute Model Merging with Amortized Pareto Fronts via Quadratic Approximationcited by 20
- 2024MUSCLE: A Model Update Strategy for Compatible LLM Evolutioncited by 15
- 2024Pareto Merging: Multi-Objective Optimization for Preference-Aware Model Mergingcited by 14
- 2025Provably Safe Model Updatescited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.