Quantifying Statistical Significance Of Deep Nearest Neighbor Anomaly Detection Via Selective Inference

Abstract

In real-world applications, anomaly detection (AD) often operates without access to anomalous data, necessitating semi-supervised methods that rely solely on normal data. Among these methods, deep k-nearest neighbor (deep kNN) AD stands out for its interpretability and flexibility, leveraging distance-based scoring in deep latent spaces.Despite its strong performance, deep kNN lacks a mechanism to quantify uncertainty-an essential feature for critical applications such as industrial inspection. To address this limitation, we propose a statistical framework that quantifies the significance of detected anomalies in the form of p-values, thereby enabling control over false positive rates at a user-specified significance level (e.g.,0.05). A central challenge lies in managing selection bias, which we tackle using Selective Inference-a principled method for conducting inference conditioned on data-driven selections. We evaluate our method on diverse datasets and demonstrate that it provides

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keyniihori2025quantifying

Related papers

• Approximate Nearest Neighbour Search On Dynamic Datasets: An Investigation (2024)0.00
• High-dimensional Approximate Nearest Neighbor Search: With Reliable And Efficient Distance Comparison Operations (2023)13.44
• Interpretable Locally Adaptive Nearest Neighbors (2020)3.58
• Certifiable Robustness For Nearest Neighbor Classifiers (2022)0.00
• An Adaptive Nearest Neighbor Rule For Classification (2019)0.00
• Effective And General Distance Computation For Approximate Nearest Neighbor Search (2024)5.84
• Target Before Shooting: Accurate Anomaly Detection And Localization Under One Millisecond Via Cascade Patch Retrieval (2023)14.62
• Efficient Data-aware Distance Comparison Operations For High-dimensional Approximate Nearest Neighbor Search (2024)5.24