mlsanityData to 7 Oct 2026

Certified Learning under Distribution Shift: Sound Verification and Identifiable Structure

arXiv 2602.17699 ↗First posted 6 Feb 2026cs.LG math.RA stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Proposition. Let f be a predictor trained on a distribution P and evaluated on a shifted distribution Q. Under verifiable regularity and complexity constraints, the excess risk under shift admits an explicit upper bound determined by a computable shift metric and model parameters. We develop a unified framework in which (i) risk under distribution shift is certified by explicit inequalities, (ii) verification of learned models is sound for nontrivial sizes, and (iii) interpretability is enforced through identifiability conditions rather than post hoc explanations. All claims are stated with explicit assumptions. Failure modes are isolated. Non-certifiable regimes are characterized.

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

Builds on

10 of 19 references.

References · 10

  1. 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 739
  2. 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 439
  3. 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 333
  4. 2020Neural Additive Models: Interpretable Machine Learning with Neural Netscited by 318
  5. 2015Data-driven Distributionally Robust Optimization Using the Wasserstein Metric: Performance Guarantees and Tractable Reformulationscited by 285
  6. 2020Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifierscited by 183
  7. 2022Symbolic Regression is NP-hardcited by 68
  8. 2023First Three Years of the International Verification of Neural Networks Competition (VNN-COMP)cited by 58
  9. 2024The Fifth International Verification of Neural Networks Competition (VNN-COMP 2024): Summary and Resultscited by 42
  10. 2024Prove Symbolic Regression is NP-hard by Symbol Graphcited by 3

Built on by

Not cited yet.