RankFeat&RankWeight: Rank-1 Feature/Weight Removal for Out-of-Distribution Detection

Yue Song;Wei Wang;Nicu Sebe
{"title":"RankFeat&RankWeight: Rank-1 Feature/Weight Removal for Out-of-Distribution Detection","authors":"Yue Song;Wei Wang;Nicu Sebe","doi":"10.1109/TPAMI.2024.3520899","DOIUrl":null,"url":null,"abstract":"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>RankFeat</monospace>, a simple yet effective <italic>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>RankFeat</monospace> achieves <italic>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>RankFeat</monospace> motivates us to investigate whether a similar phenomenon would exist in the parameter matrices of neural networks. We thus propose <monospace>RankWeight</monospace> which removes the rank-1 weight from the parameter matrices of a single deep layer. Our <monospace>RankWeight</monospace> is also <italic>post hoc</i> and only requires computing the rank-1 matrix once. As a standalone approach, <monospace>RankWeight</monospace> has very competitive performance against other methods across various backbones. Moreover, <monospace>RankWeight</monospace> enjoys flexible compatibility with a wide range of OOD detection methods. The combination of <monospace>RankWeight</monospace> and <monospace>RankFeat</monospace> refreshes the new <italic>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.","PeriodicalId":94034,"journal":{"name":"IEEE transactions on pattern analysis and machine intelligence","volume":"47 4","pages":"2505-2519"},"PeriodicalIF":18.6000,"publicationDate":"2024-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10812065","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE transactions on pattern analysis and machine intelligence","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10812065/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

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 RankFeat, a simple yet effective post hoc 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. RankFeat achieves state-of-the-art performance and reduces the average false positive rate (FPR95) by 17.90% compared with the previous best method. The success of RankFeat motivates us to investigate whether a similar phenomenon would exist in the parameter matrices of neural networks. We thus propose RankWeight which removes the rank-1 weight from the parameter matrices of a single deep layer. Our RankWeight is also post hoc and only requires computing the rank-1 matrix once. As a standalone approach, RankWeight has very competitive performance against other methods across various backbones. Moreover, RankWeight enjoys flexible compatibility with a wide range of OOD detection methods. The combination of RankWeight and RankFeat refreshes the new state-of-the-art 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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
rankfeature & rankweight:用于非分布检测的Rank-1特征/权重去除
分布外(OOD)检测任务对于在现实环境中部署机器学习模型至关重要。在本文中,我们观察到分布内特征(In -distribution, ID)和OOD特征的奇异值分布有很大的不同:OOD特征矩阵往往比ID特征具有更大的主导奇异值,OOD样本的类别预测在很大程度上取决于它。这一观察结果促使我们提出了RankFeat,这是一种简单而有效的OOD检测事后方法,通过从高级特征中去除由最大奇异值和相关奇异向量组成的rank-1矩阵。RankFeat达到了最先进的性能,与之前的最佳方法相比,平均假阳性率(FPR95)降低了17.90%。RankFeat的成功激发了我们对神经网络参数矩阵中是否存在类似现象的研究。因此,我们提出了RankWeight,它从单个深层的参数矩阵中去除rank-1的权重。我们的RankWeight也是post hoc的,只需要计算一次rank-1矩阵。作为一种独立的方法,RankWeight与跨各种主干的其他方法相比具有非常有竞争力的性能。此外,RankWeight与广泛的OOD检测方法具有灵活的兼容性。RankWeight和RankFeat的结合刷新了新的最先进的性能,在ImageNet-1k基准测试中实现了低至16.13%的FPR95。广泛的消融研究和全面的理论分析提出了支持实证结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
CrossEarth: Geospatial Vision Foundation Model for Domain Generalizable Remote Sensing Semantic Segmentation. Continuous Review and Timely Correction: Enhancing the Resistance to Noisy Labels via Self-Not-True and Class-Wise Distillation. On the Transferability and Discriminability of Representation Learning in Unsupervised Domain Adaptation. Fast Multi-view Discrete Clustering via Spectral Embedding Fusion. GrowSP++: Growing Superpoints and Primitives for Unsupervised 3D Semantic Segmentation.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1