Fast Decision Boundary based Out-of-Distribution Detector
Litian Liu, Yao Qin

TL;DR
This paper introduces a fast, auxiliary-model-free out-of-distribution detector that uses decision boundary distances and a closed-form estimation to improve efficiency without sacrificing detection performance.
Contribution
The authors propose a novel OOD detection method based on feature distances to decision boundaries, eliminating the need for auxiliary models and reducing computational overhead.
Findings
Matches or surpasses state-of-the-art detection accuracy
Incur negligible inference latency overhead
Effectively separates ID and OOD features at equal deviation levels
Abstract
Efficient and effective Out-of-Distribution (OOD) detection is essential for the safe deployment of AI systems. Existing feature space methods, while effective, often incur significant computational overhead due to their reliance on auxiliary models built from training features. In this paper, we propose a computationally-efficient OOD detector without using auxiliary models while still leveraging the rich information embedded in the feature space. Specifically, we detect OOD samples based on their feature distances to decision boundaries. To minimize computational cost, we introduce an efficient closed-form estimation, analytically proven to tightly lower bound the distance. Based on our estimation, we discover that In-Distribution (ID) features tend to be further from decision boundaries than OOD features. Additionally, ID and OOD samples are better separated when compared at equal…
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 · Advanced Neural Network Applications · Explainable Artificial Intelligence (XAI)
