EOOD: Entropy-based Out-of-distribution Detection
Guide Yang, Chao Hou, Weilong Peng, Xiang Fang, Yongwei Nie, Peican Zhu, Keke Tang
TL;DR
EOOD tackles OOD overconfidence by exploiting differences in information flow across network blocks. It computes blockwise conditional entropy f^{CE}(x,l)=H(B^{(l-1)}|B^{(l)}) and uses a CER-based selection, based on ID and pseudo-OOD samples, to pick the most sensitive block l^* and define the final score Score_OOD(x)=f^{CE}(x,l^*). The approach achieves state-of-the-art post-hoc OOD detection performance on standard CIFAR and ImageNet benchmarks without retraining or auxiliary OOD data, demonstrating robustness across small- and large-scale settings and highlighting the value of entropy-based, block-level information-flow signals for open-world reliability.
Abstract
Deep neural networks (DNNs) often exhibit overconfidence when encountering out-of-distribution (OOD) samples, posing significant challenges for deployment. Since DNNs are trained on in-distribution (ID) datasets, the information flow of ID samples through DNNs inevitably differs from that of OOD samples. In this paper, we propose an Entropy-based Out-Of-distribution Detection (EOOD) framework. EOOD first identifies specific block where the information flow differences between ID and OOD samples are more pronounced, using both ID and pseudo-OOD samples. It then calculates the conditional entropy on the selected block as the OOD confidence score. Comprehensive experiments conducted across various ID and OOD settings demonstrate the effectiveness of EOOD in OOD detection and its superiority over state-of-the-art methods.
