To Trust Or Not To Trust A Classifier
원문 초록
Knowing when a classifier's prediction can be trusted is useful in many applications and critical for safely using AI. While the bulk of the effort in machine learning research has been towards improving classifier performance, understanding when a classifier's predictions should and should not be trusted has received far less attention. The standard approach is to use the classifier's discriminant or confidence score; however, we show there exists an alternative that is more effective in many situations. We propose a new score, called the trust score, which measures the agreement between the classifier and a modified nearest-neighbor classifier on the testing example. We show empirically that high (low) trust scores produce surprisingly high precision at identifying correctly (incorrectly) classified examples, consistently outperforming the classifier's confidence score as well as many other baselines. Further, under some mild distributional assumptions, we show that if the trust score for an example is high (low), the classifier will likely agree (disagree) with the Bayes-optimal classifier. Our guarantees consist of non-asymptotic rates of statistical consistency under various nonparametric settings and build on recent developments in topological data analysis.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Comparing the Effects of Persistence Barcodes Aggregation and Feature Concatenation on Medical Imaging
Topological Machine Learning for Protein-Nucleic Acid Binding Affinity Changes Upon Mutation
Topology across Scales on Heterogeneous Cell Data
Short-PHD: Detecting Short LLM-generated Text with Topological Data Analysis After Off-topic Content Insertion
A Topological Data Analysis Framework for Quantifying Necrosis in Glioblastomas
Persistent Homology-induced Graph Ensembles for Time Series Regressions
토론
이 논문과 연결된 포럼 글이 아직 없습니다.