A Simple Fix to Mahalanobis Distance for Improving Near-OOD Detection
Jie Ren, Stanislav Fort, Jeremiah Liu, Abhijit Guha Roy, Shreyas, Padhy, Balaji Lakshminarayanan

TL;DR
This paper identifies limitations of Mahalanobis distance in near-OOD detection and introduces a simple, more robust modification called relative Mahalanobis distance, significantly enhancing detection performance across diverse benchmarks.
Contribution
The paper proposes a simple fix called relative Mahalanobis distance that improves near-OOD detection and robustness over the standard Mahalanobis distance method.
Findings
RMD outperforms MD by up to 15% AUROC on genomics OOD benchmarks.
RMD is more robust to hyperparameter choices.
The method improves OOD detection across vision, language, and biology datasets.
Abstract
Mahalanobis distance (MD) is a simple and popular post-processing method for detecting out-of-distribution (OOD) inputs in neural networks. We analyze its failure modes for near-OOD detection and propose a simple fix called relative Mahalanobis distance (RMD) which improves performance and is more robust to hyperparameter choice. On a wide selection of challenging vision, language, and biology OOD benchmarks (CIFAR-100 vs CIFAR-10, CLINC OOD intent detection, Genomics OOD), we show that RMD meaningfully improves upon MD performance (by up to 15% AUROC on genomics OOD).
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Domain Adaptation and Few-Shot Learning · Advanced Neural Network Applications
