Unknown Unknowns: Model Misspecification in Machine Learning for Physics
Organizations: Departamento de Física Atómica, Molecular y Nuclear, Universidad de Sevilla, E-41080 Sevilla, Spain · Center for Computational Astrophysics, Flatiron Institute, 162 Fifth Avenue, New York, NY 10010, USA · Institute for Advanced Study, 1 Einstein Drive, Princeton, NJ 08540, USA · University of Wisconsin–Madison, 1205 University Ave, Madison, WI 53706, USA · SLAC National Accelerator Laboratory, 2575 Sand Hill Rd, Menlo Park, CA 94025, USA
Abstract
Machine learning is now a central tool for solving inverse problems in particle physics and astronomy. Models are trained on simulation and deployed on real data, raising the question not just of whether they fit, but of whether they are wrong in ways we did not anticipate: the unknown unknowns. This challenge of model misspecification is not unique to machine learning. In physics, misspecification is sometimes exactly what we want to find: new discoveries appear as failures of existing models. At other times, we want such effects absorbed into the analysis without biasing the measurement. A robust analysis is one that absorbs the misspecifications we are not interested in, while preserving sensitivity to the ones we are. Machine learning can both amplify misspecification and provide new tools to address it. We discuss the challenges of model misspecification, diagnostics for detecting it, and strategies for mitigation. No single diagnostic can confirm that a model is correctly specified: detection and mitigation are two halves of an iterative loop, in which a battery of complementary diagnostics is applied, the model is updated, and the process repeated. Robustness against unknown unknowns is ultimately less about any single technique than about a disposition: a willingness to suspect one's own model, and to design analyses that can survive being wrong in ways one did not anticipate.
Figures & tables
| Metric | Advantages | Caveats |
|---|---|---|
| C2ST | Classifier to distinguish data from model samples, simple and broadly applicable. | No insight about hierarchy of different models. |
| OT | Cost of transforming between distributions. Offers a notion of geometric distance between models. | Very costly in high dimensions. |
| SW | Scalable alternative to the metric above, takes one-dimensional projections. | By projecting we might be missing important correlations or features. |
| MMD | Maps the sample to some kernel-defined feature space, bypassing the curse of dimensionality. | The choice of kernel acts as a bias. |
| Provides a straightforward metric for Gaussian-distributed histogrammed data. | Assumes statistically independent bins. | |
| correlated | Includes the covariance matrix in the calculation of the , bypassing its main weakness. | A reliable estimate of the covariance matrix is often very challenging (and even the source of misspecification). |