about
Measuring Stochastic Data Complexity with Boltzmann Influence Functions (arxiv.org)
1 point by belter on Jul 12, 2024 | hide | past | pdf | discuss on HN

In plain words: It estimates how sure a model should be by checking whether other possible labels also fit the training data, then lowers confidence when they do. The fast approximation matched or beat strong rivals at honest confidence, flagging mislabeled points, and spotting unfamiliar data.

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.

Nathan Ng, Roger Grosse, Marzyeh Ghassemi
arXiv:2406.02745 · cs.LG · submitted Jun 4, 2024 · updated Jul 18, 2024
abstract · pdf · html

add comment on HN