When machine learning classifiers are retrained, inputs correctly classified by the previous model version may be misclassified by the updated version, creating regression faults that are costly to detect because verifying predictions against ground truth may require human annotation, expert review, or expensive simulation rather than inexpensive model inference. Test input prioritization addresses this problem by ranking inputs so that a limited verification budget reveals as many regression faults as possible. Existing approaches rely predominantly on single-model confidence scores and do not exploit how predictions, decision boundaries, and local neighborhoods change between model versions. We propose RiskBlend, a classifier-agnostic prioritization framework that combines four complementary risk signals: historical failure patterns, prediction shift, decision-boundary shift, and neighborhood change. These signals are combined using validation-learned APFD-squared weighting. Across four datasets, five classifiers, four regression-update scenarios, and 15 random seeds, totaling 1,200 experimental configurations, RiskBlend achieves the highest average APFD in all 80 dataset-classifier-scenario combinations, with improvements of up to 0.32 APFD over the strongest baseline. Confidence-based methods remain competitive primarily for linear classifiers on sparse categorical features, which we attribute to feature-space geometry. The results show that cross-version behavioral signals provide important complementary information for prioritizing regression faults in machine learning systems.
Figures & tables
Dataset
Description
Features
Samples
Domain
Bank Marketing
Predicts whether a customer will subscribe to a term deposit based on marketing campaign data
16 (numeric + categorical)
45,211
Finance
Adult Income
Predicts whether a person earns more than $50K based on census data
14 (numeric + categorical)
48,842
Socioeconomic
Hospital Readmission
hospital readmission prediction from clinical, demographic, and hospitalization features
49 (mixed)
101,766
Healthcare
Credit Card Default
Predicts whether a credit card client will default on the next payment based on demographic and financial attributes
23 (numeric + categorical)
30,000
Finance
TABLE I: Summary of Datasets Used for Evaluation.
Dataset
History
Boundary
Pred. Shift
Neigh.
Adult
0.214
0.349
0.295
0.142
Bank
0.230
0.324
0.306
0.141
Credit
0.209
0.375
0.280
0.136
Hospital
0.366
0.309
0.225
0.099
TABLE IV: Mean validation-learned weights per signal and dataset. Bold indicates the dominant signal per dataset.
Removed Signal
Adult
Bank
Hospital
Credit
Boundary Shift
0.0469
0.0328
0.0686
0.0749
History Risk
0.0042
0.0021
0.0169
0.0232
Neighborhood Change
− 0.0003
− 0.0006
− 0.0012
− 0.0030
Prediction Shift
− 0.0042
− 0.0025
− 0.0125
− 0.0233
TABLE V: Leave-one-signal-out (LOSO) ablation study. Each value reports the mean APFD drop ( Δ APFD) after removing one RiskBlend signal. Larger positive values indicate greater contribution to regression-fault detection. Results are averaged over all scenarios, classifiers, and seeds.
Method
Adult
Bank
Hospital
Credit
Random
0.000199
0.000222
0.000164
0.000128
DeepGini
0.000102
0.000120
0.000098
0.000038
MLPrior
1.1590
17.6336
0.7584
0.2043
DATIS
4.0762
5.3016
1.5293
0.6218
RiskBlend
8.9482
4.9425
2.3929
0.3152
TABLE VI: Average execution time (seconds) per prioritization method across datasets (mean over all classifiers, seeds, scenarios
Performance regression testing is essential in large-scale continuous-integration (CI) systems, yet executing full performance suites for every commit is prohibitively expensive. Prior work on performance regression prediction and batch testing has shown independent benefits, but each faces practical limitations: predictive models are rarely integrated into CI decision-making, and conventional batching strategies ignore commit-level heterogeneity. We unify these strands by introducing a risk-aware framework that integrates machine-learned commit risk with adaptive batching. Using Mozilla Firefox as a case study, we construct a production-derived dataset of human-confirmed regressions aligned chronologically with Autoland, and fine-tune ModernBERT, CodeBERT, and LLaMA-3.1 variants to estimate commit-level performance regression risk, achieving up to 0.694 ROC-AUC with CodeBERT. The risk scores drive a family of risk-aware batching strategies, including Risk-Aged Priority Batching and Risk-Adaptive Stream Batching, evaluated through realistic CI simulations. Across thousands of historical Firefox commits, our best overall configuration, Risk-Aged Priority Batching with linear aggregation (RAPB-la), yields a Pareto improvement over Mozilla's production-inspired baseline. RAPB-la reduces total test executions by 32.4%, decreases mean feedback time by 3.8%, maintains mean time-to-culprit at approximately the baseline level, reduces maximum time-to-culprit by 26.2%, and corresponds to an estimated annual infrastructure cost savings of approximately $491K under our cost model. These results demonstrate that risk-aware batch testing can reduce CI resource consumption while improving diagnostic timeliness. To support reproducibility and future research, we release a complete replication package containing all datasets, fine-tuning pipelines, and implementations of our batching algorithms.
Ali Sayedsalehi, Peter C. Rigby, Gregory Mierzwinski
Department of Computer Science and Software Engineering, Concordia University, Montreal, Quebec, Canada. · Mozilla, Potton, Quebec, Canada.
Whether input-dependent ("dynamic") combination of a regression model pool beats the best static blend depends on the shift and is rarely known before deployment. Can a small labeled target-domain probe tell us when reallocating trust across regions of the input space will pay off? We answer this with DCF5, which estimates from the probe the cross-fitted gain of the regionwise convex combination over the best static convex blend: the realizable value of deciding, region by region, whom to trust. Across a frozen suite of 12 dataset-shift pairs (spatial, temporal, domain, feature-cluster), DCF5 predicts realized regionwise test gains with dataset-level Spearman +0.98 (95% CI [+0.83,+1.00]; p=5×10−5), including two cases overturning preregistered expectations. The relationship holds in a 16-pair sensitivity analysis (Spearman +0.83), whereas alternative probe diagnostics reach at most +0.66. This contrast isolates regional trust reallocation: correlation is +0.98 for regionwise-convex gain, but +0.01 for smooth covariate-dependent stacking after affine correction. A controlled generator shows dynamic gains arise from the interaction of shift heterogeneity and local competence, increase with shift severity, and become realizable between 128 and 256 probe labels in the tested grid. The Probe-Validated Ensemble Selector chooses among a static affine stacker and dynamic realizers, deploying a candidate only when a held-out lower confidence bound clears the static-convex floor. In a preregistered prospective batch, it matched or improved the floor in all 12 runs; two deployments reduced test risk by 11% and 16%, while the gate rejected a candidate whose un-gated deployment incurred >30× the static loss. We release OpenRegShift, a reproducible evaluation harness for regression ensembles under distribution shift.
Deployed machine learning (ML) models can degrade as the distribution of their input data shifts. Such shifts can result from changes in the population or from data integrity issues in the pipeline that materializes model features, two sources that operate through different mechanisms. Because labels are often absent or delayed, it is common practice to track shifts in the data instead, but a detected shift does not indicate how it affects the model. We formulate this problem as online model testing under distribution shift. Testing requires reproducing the shift on a controlled baseline with known labels. Since the same shift can come from either source, doing so requires knowing which mechanism changed. We propose a methodology that reproduces observed changes in both mechanisms to estimate current performance and the potential gain from repairing observed data integrity issues. Experiments on real-world datasets with simulated faults show that separating the two sources generally improves both estimates, supporting this formulation. A churn prediction case illustrates how these tests can support monitoring and repair prioritization