English

Measuring Stochastic Data Complexity with Boltzmann Influence Functions

Machine Learning 2024-07-22 v2

Abstract

Estimating the uncertainty of a model's prediction on a test point is a crucial part of ensuring reliability and calibration under distribution shifts. A minimum description length approach to this problem uses the predictive normalized maximum likelihood (pNML) distribution, which considers every possible label for a data point, and decreases confidence in a prediction if other labels are also consistent with the model and training data. In this work we propose IF-COMP, a scalable and efficient approximation of the pNML distribution that linearizes the model with a temperature-scaled Boltzmann influence function. IF-COMP can be used to produce well-calibrated predictions on test points as well as measure complexity in both labelled and unlabelled settings. We experimentally validate IF-COMP on uncertainty calibration, mislabel detection, and OOD detection tasks, where it consistently matches or beats strong baseline methods.

Keywords

Cite

@article{arxiv.2406.02745,
  title  = {Measuring Stochastic Data Complexity with Boltzmann Influence Functions},
  author = {Nathan Ng and Roger Grosse and Marzyeh Ghassemi},
  journal= {arXiv preprint arXiv:2406.02745},
  year   = {2024}
}
R2 v1 2026-06-28T16:53:39.196Z