Measuring Stochastic Data Complexity with Boltzmann Influence Functions
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 33 of its 72 references that are in the map. First posted on arXiv 4 Jun 2024.
Builds on
33 of 72 references.
References · 33
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2017On Calibration of Modern Neural Networkscited by 4,860
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
- 2019Can You Trust Your Model's Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shiftcited by 1,274
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
- 2016End to End Learning for Self-Driving Carscited by 1,000
- 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 565
- 2019A Simple Baseline for Bayesian Uncertainty in Deep Learningcited by 555
21 more
- 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 529
- 2016Deep Exploration via Bootstrapped DQNcited by 518
- 2020What Neural Networks Memorize and Why: Discovering the Long Tail via Influence Estimationcited by 492
- 2019Does Learning Require Memorization? A Short Tale about a Long Tailcited by 452
- 2021Learning with Noisy Labels Revisited: A Study Using Real-World Human Annotationscited by 253
- 2020Influence Functions in Deep Learning Are Fragilecited by 247
- 2021A Simple Fix to Mahalanobis Distance for Improving Near-OOD Detectioncited by 206
- 2023OpenOOD v1.5: Enhanced Benchmark for Out-of-Distribution Detectioncited by 178
- 2018Fast Approximate Natural Gradient Descent in a Kronecker-factored Eigenbasiscited by 143
- 2022If Influence Functions are the Answer, Then What is the Question?cited by 142
- 2021Comparing Kullback-Leibler Divergence and Mean Squared Error Loss in Knowledge Distillationcited by 131
- 2018Stronger Data Poisoning Attacks Break Data Sanitization Defensescited by 125
- 2018Understanding the Origins of Bias in Word Embeddingscited by 90
- 2021Clusterability as an Alternative to Anchor Points When Learning with Noisy Labelscited by 65
- 2016A Minimax Approach to Supervised Learningcited by 33
- 2019Can You Trust This Prediction? Auditing Pointwise Reliability After Learningcited by 28
- 2022Repairing Neural Networks by Leaving the Right Past Behindcited by 27
- 2019Deep pNML: Predictive Normalized Maximum Likelihood for Deep Neural Networkscited by 12
- 2020Revisiting minimum description length complexity in overparameterized modelscited by 7
- 2023An Empirical Study of Automated Mislabel Detection in Real World Vision Datasetscited by 3
- 2018Thermodynamics of the Minimum Description Length on Community Detectioncited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.