RankFeat&RankWeight: Rank-1 Feature/Weight Removal for Out-of-Distribution Detection
The task of out-of-distribution (OOD) detection is crucial for deploying machine learning models in real-world settings. In this paper, we observe that the singular value distributions of the in-distribution (ID) and OOD features are quite different: the OOD feature matrix tends to have a larger dominant singular value than the ID feature, and the class predictions of OOD samples are largely determined by it. This observation motivates us to propose <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">RankFeat</monospace>, a simple yet effective <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">post hoc</i> approach for OOD detection by removing the rank-1 matrix composed of the largest singular value and the associated singular vectors from the high-level feature. <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">RankFeat</monospace> achieves <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">state-of-the-art</i> performance and reduces the average false positive rate (FPR95) by 17.90% compared with the previous best method. The success of <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">RankFeat</monospace> motivates us to investigate whether a similar phenomenon would exist in the parameter matrices of neural networks. We thus propose <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">RankWeight</monospace> which removes the rank-1 weight from the parameter matrices of a single deep layer. Our <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">RankWeight</monospace> is also <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">post hoc</i> and only requires computing the rank-1 matrix once. As a standalone approach, <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">RankWeight</monospace> has very competitive performance against other methods across various backbones. Moreover, <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">RankWeight</monospace> enjoys flexible compatibility with a wide range of OOD detection methods. The combination of <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">RankWeight</monospace> and <monospace xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">RankFeat</monospace> refreshes the new <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">state-of-the-art</i> performance, achieving the FPR95 as low as 16.13% on the ImageNet-1k benchmark. Extensive ablation studies and comprehensive theoretical analyses are presented to support the empirical results.
Authors
- Nicu Sebe (ORCID: https://orcid.org/0000-0002-6597-7248)
- Yue Song (ORCID: https://orcid.org/0000-0003-1573-5643)
- Wei Wang (ORCID: https://orcid.org/0000-0002-5477-1017)
Institutions
- University of Trento (IT)
- Beijing Jiaotong University (CN)
Publication Details
- Journal
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2024-12-23
- DOI
- https://doi.org/10.1109/tpami.2024.3520899
- Citations
- 1
- Primary Topic
- Anomaly Detection Techniques and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.35