p-DkNN: Out-of-Distribution Detection Through Statistical Testing of Deep Representations
Not on the map. Why?
Abstract (arXiv)
The lack of well-calibrated confidence estimates makes neural networks inadequate in safety-critical domains such as autonomous driving or healthcare. In these settings, having the ability to abstain from making a prediction on out-of-distribution (OOD) data can be as important as correctly classifying in-distribution data. We introduce p-DkNN, a novel inference procedure that takes a trained deep neural network and analyzes the similarity structures of its intermediate hidden representations to compute p-values associated with the end-to-end model prediction. The intuition is that statistical tests performed on latent representations can serve not only as a classifier, but also offer a statistically well-founded estimation of uncertainty. p-DkNN is scalable and leverages the composition of representations learned by hidden layers, which makes deep representation learning successful. Our theoretical analysis builds on Neyman-Pearson classification and connects it to recent advances in selective classification (reject option). We demonstrate advantageous trade-offs between abstaining from predicting on OOD inputs and maintaining high accuracy on in-distribution inputs. We find that p-DkNN forces adaptive attackers crafting adversarial examples, a form of worst-case OOD inputs, to introduce semantically meaningful changes to the inputs.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 26 of its 34 references that are in the map. First posted on arXiv 25 Jul 2022.
Builds on
26 of 34 references.
References · 26
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2013Intriguing properties of neural networkscited by 5,155
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
- 2016A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networkscited by 2,385
- 2016Concrete Problems in AI Safetycited by 1,642
- 2018A Simple Unified Framework for Detecting Out-of-Distribution Samples and Adversarial Attackscited by 1,485
- 2017Evasion Attacks against Machine Learning at Test Timecited by 689
- 2018Deep k-Nearest Neighbors: Towards Confident, Interpretable and Robust Deep Learningcited by 207
- 2018To Trust Or Not To Trust A Classifiercited by 207
- 2018Delayed Impact of Fair Machine Learningcited by 184
14 more
- 2019Evaluating Scalable Bayesian Deep Learning Methods for Robust Computer Visioncited by 182
- 2020Understanding the Failure Modes of Out-of-Distribution Generalizationcited by 146
- 2021AdvSim: Generating Safety-Critical Scenarios for Self-Driving Vehiclescited by 137
- 2019Adversarial Examples Are a Natural Consequence of Test Error in Noisecited by 114
- 2018Benchmarking Neural Network Robustness to Common Corruptions and Surface Variationscited by 99
- 2019Analyzing and Improving Representations with the Soft Nearest Neighbor Losscited by 95
- 2019The Odds are Odd: A Statistical Test for Detecting Adversarial Examplescited by 75
- 2015Adversarial Manipulation of Deep Representationscited by 56
- 2020Beyond Perturbations: Learning Guarantees with Arbitrary Adversarial Test Examplescited by 44
- 2021Generating and Characterizing Scenarios for Safety Testing of Autonomous Vehiclescited by 21
- 2014Distributed Variational Inference in Sparse Gaussian Process Regression and Latent Variable Modelscited by 19
- 2018Fair lending needs explainable models for responsible recommendationcited by 12
- 2019On the Robustness of Deep K-Nearest Neighborscited by 10
- 2020Minimum-Norm Adversarial Examples on KNN and KNN-Based Modelscited by 2
Built on by
Citing papers per year: 2025: 2.
2 papers.