Skip to content

Certifying Model Upgrades with Slice-Wise Non-Regression and Incumbent Fallback

Sep 2026 · 1 citation · 16 references
Computer Science

TL;DR

An auditable protocol is established that separates candidate search from independent, paired evaluation and returns the exact incumbent when certification fails, and finite-sample guarantees for one frozen candidate, a finite candidate library, and a prespecified testing order are state.

Abstract

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.

View source

Similar papers

Preprint Aug 2026

ProxyGuard: Direct Reliability Inference for Randomized Data Release Mechanisms with Shared Targets

It is shown that the mean-only penalty is sharp and derive a smooth-score certificate with additive target concentration, and direct shared-target mode evaluates independent mechanism draws on a common target, lower-bounds their favorable-score rate, and subtracts a bound on favorable scores contributed by invalid rele...

Dipesh Mahato, Pramod Dhungana · 0 citations
#artificial intelligence Preprint Aug 2026

PartHackBench: Certified Equal-Progress Stress Tests for Partial-Credit Tool-Agent Evaluation

PartHackBench provides a certified control for testing whether evaluator credit changes while all benchmark-defined task-relevant progress remains fixed, and provides a certified control for testing whether evaluator credit changes while all benchmark-defined task-relevant progress remains fixed.

Hong-Ye Yang, Zhi Xie, Sheng-Jun Xiong · 0 citations
#artificial intelligence Preprint Sep 2026

Audit-First VAPO: Risk-Certified Selective Updates under Imperfect Verification

This work introduces Audit-First VAPO, which separates discrete directional admission from continuous magnitude control, and evaluates two models on two reasoning benchmarks against static RLVR, matched-random selection, confidence thresholding, noise correction, and verifier augmentation.

Miao-Bo Hu, Shu-Hao Hu, Xiao-Bo Guo et al. · 0 citations
#machine learning Preprint Sep 2026

Available Guardrails: Certifying Selective Prediction across ML Systems

This work makes the notion of availability computable through classical exact-binomial inversion and forms reporting-partition selection, under a fixed group order, as a dynamic program that exposes the trade-off among safety, granularity, and served traffic.

Parivesh Priye, Yu-Feng Wang, Hai-Bin Ling et al. · 0 citations
Preprint Oct 2026

Reusing Statistical Guarantees Under Change: Selection Costs and Event Ownership

An adaptive system can retain an earlier estimate while changing what that estimate is used to guarantee. The guarantee depends on the experiment that produced the evidence, including how its target was selected and which assumptions connect it to the current claim. We show that past-measurable selection preserves futu...

Ao Li, Weitong Chen Australian Institute for Machine Learning, Adelaide University et al. · 0 citations

Related blog posts

Microsoft Research Blog Oct 12, 2026

Simulating student learning for better AI tutoring

StudentSim is a research system for evaluating and improving AI tutoring tools before they are tested with learners. It models how individuals may engage with tutors, giving feedback to improve tutor performance across subjects like chess, writing, and mathematics. The post Simulating student learning for better AI tutoring appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 7, 2026

Discovering the value of humanistic inquiry

Students in MIT’s Concourse program delve deeply into the human condition, debate challenging questions, and learn to develop judgment about issues that can’t be quantified.

Microsoft Research Blog Oct 7, 2026

Agent Lightning v1.0: A 3,500-Line Lightweight Agentic RL Framework for Training Agents with Real Harnesses

Training AI agents with reinforcement learning can be challenging because their tools, context, and decision-making are managed by complex frameworks. Agent Lightning connects existing agents to RL training, making it easier to improve them without rebuilding them. The post Agent Lightning v1.0: A 3,500-Line Lightweight Agentic RL Framework for Training Agents with Real Harnesses appeared first on Microsoft Research.

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