mlsanityData to 7 Oct 2026

TRACE: Theoretical Risk Attribution under Covariate-shift Effects

arXiv 2602.10588 ↗First posted 11 Feb 2026cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

When a source-trained model Q is replaced by a model tildeQ trained on shifted data, its performance on the source domain can change unpredictably. To address this, we study the two-model risk change, Delta R := RP(tildeQ) - RP(Q), under covariate shift. We introduce TRACE (Theoretical Risk Attribution under Covariate-shift Effects), a framework that decomposes |Delta R| into an interpretable upper bound. This decomposition disentangles the risk change into four actionable factors: two generalization gaps, a model change penalty, and a covariate shift penalty, transforming the bound into a powerful diagnostic tool for understanding why performance has changed. To make TRACE a fully computable diagnostic, we instantiate each term. The covariate shift penalty is estimated via a model sensitivity factor (from high-quantile input gradients) and a data-shift measure; we use feature-space Optimal Transport (OT) by default and provide a robust alternative using Maximum Mean Discrepancy (MMD). The model change penalty is controlled by the average output distance between the two models on the target sample. Generalization gaps are estimated on held-out data. We validate our framework in an idealized linear regression setting, showing the TRACE bound correctly captures the scaling of the true risk difference with the magnitude of the shift. Across synthetic and vision benchmarks, TRACE diagnostics are valid and maintain a strong monotonic relationship with the true performance degradation. Crucially, we derive a deployment gate score that correlates strongly with |Delta R| and achieves high AUROC/AUPRC for gating decisions, enabling safe, label-efficient model replacement.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 16 of its 30 references that are in the map. First posted on arXiv 11 Feb 2026.

Builds on

16 of 30 references.

References · 16

  1. 2016A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networkscited by 2,362
  2. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  3. 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,323
  4. 2017Maximum Classifier Discrepancy for Unsupervised Domain Adaptationcited by 682
  5. 2014Deep Domain Confusion: Maximizing for Domain Invariancecited by 597
  6. 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 547
  7. 2018Detecting and Correcting for Label Shift with Black Box Predictorscited by 364
  8. 2019Bridging Theory and Algorithm for Domain Adaptationcited by 332
  9. 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 299
  10. 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
  11. 2018Failing Loudly: An Empirical Study of Methods for Detecting Dataset Shiftcited by 240
  12. 2017Asymmetric Tri-training for Unsupervised Domain Adaptationcited by 152
4 more
  1. 2020Reasoning About Generalization via Conditional Mutual Informationcited by 145
  2. 2016Theoretical Analysis of Domain Adaptation with Optimal Transportcited by 105
  3. 2017Data-Dependent Stability of Stochastic Gradient Descentcited by 90
  4. 2015A New PAC-Bayesian Perspective on Domain Adaptationcited by 29

Built on by

Not cited yet.