Birds of a Feather Trust Together: Knowing When to Trust a Classifier via Adaptive Neighborhood Aggregation
Not on the map. Why?
Abstract (arXiv)
How do we know when the predictions made by a classifier can be trusted? This is a fundamental problem that also has immense practical applicability, especially in safety-critical areas such as medicine and autonomous driving. The de facto approach of using the classifier's softmax outputs as a proxy for trustworthiness suffers from the over-confidence issue; while the most recent works incur problems such as additional retraining cost and accuracy versus trustworthiness trade-off. In this work, we argue that the trustworthiness of a classifier's prediction for a sample is highly associated with two factors: the sample's neighborhood information and the classifier's output. To combine the best of both worlds, we design a model-agnostic post-hoc approach NeighborAgg to leverage the two essential information via an adaptive neighborhood aggregation. Theoretically, we show that NeighborAgg is a generalized version of a one-hop graph convolutional network, inheriting the powerful modeling ability to capture the varying similarity between samples within each class. We also extend our approach to the closely related task of mislabel detection and provide a theoretical coverage guarantee to bound the false negative. Empirically, extensive experiments on image and tabular benchmarks verify our theory and suggest that NeighborAgg outperforms other methods, achieving state-of-the-art trustworthiness performance.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 27 of its 46 references that are in the map. First posted on arXiv 29 Nov 2022.
Builds on
27 of 46 references.
References · 27
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2017On Calibration of Modern Neural Networkscited by 4,960
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
- 2017Billion-scale similarity search with GPUscited by 2,497
- 2016A Baseline for Detecting Misclassified and Out-of-Distribution Examples in Neural Networkscited by 2,385
- 2018A Simple Unified Framework for Detecting Out-of-Distribution Samples and Adversarial Attackscited by 1,485
- 2018Evidential Deep Learning to Quantify Classification Uncertaintycited by 732
15 more
- 2018Predictive Uncertainty Estimation via Prior Networkscited by 557
- 2019Confident Learning: Estimating Uncertainty in Dataset Labelscited by 413
- 2019Beyond temperature scaling: Obtaining well-calibrated multiclass probabilities with Dirichlet calibrationcited by 364
- 2019Unsupervised Label Noise Modeling and Loss Correctioncited by 328
- 2020Identifying Mislabeled Data using the Area Under the Margin Rankingcited by 261
- 2018To Trust Or Not To Trust A Classifiercited by 207
- 2019Addressing Failure Prediction by Learning Model Confidencecited by 186
- 2019Probabilistic Face Embeddingscited by 173
- 2020Posterior Network: Uncertainty Estimation without OOD Samples via Density-Based Pseudo-Countscited by 164
- 2019Ensemble Distribution Distillationcited by 158
- 2020Data Uncertainty Learning in Face Recognitioncited by 134
- 2022POEM: Out-of-Distribution Detection with Posterior Samplingcited by 108
- 2021Be Confident! Towards Trustworthy Graph Neural Networks via Confidence Calibrationcited by 92
- 2016On the Safety of Machine Learning: Cyber-Physical Systems, Decision Sciences, and Data Productscited by 52
- 2021Distribution-free calibration guarantees for histogram binning without sample splittingcited by 45
Built on by
Citing papers per year: 2022: 1; 2023: 4; 2024: 0; 2025: 2.
7 papers.
- 2023Can LLMs Express Their Uncertainty? An Empirical Evaluation of Confidence Elicitation in LLMscited by 974
- 2025SteerConf: Steering LLMs for Confidence Elicitationcited by 20
- 2023Proximity-Informed Calibration for Deep Neural Networkscited by 18
- 2025Thinking Out Loud: Do Reasoning Models Know When They're Right?cited by 12
- 2023Great Models Think Alike: Improving Model Reliability via Inter-Model Latent Agreementcited by 11
- 2023GraphCleaner: Detecting Mislabelled Samples in Popular Graph Learning Benchmarkscited by 7
- 2022A Trustworthy Framework for Medical Image Analysis with Deep Learningcited by 1
- 2025Thinking Out Loud: Do Reasoning Models Know When They're Right?9 Apr 2025
- 2025SteerConf: Steering LLMs for Confidence Elicitation4 Mar 2025
- 2023Can LLMs Express Their Uncertainty? An Empirical Evaluation of Confidence Elicitation in LLMs22 Jun 2023
- 2023Proximity-Informed Calibration for Deep Neural Networks7 Jun 2023
- 2023GraphCleaner: Detecting Mislabelled Samples in Popular Graph Learning Benchmarks30 May 2023
- 2023Great Models Think Alike: Improving Model Reliability via Inter-Model Latent Agreement2 May 2023
- 2022A Trustworthy Framework for Medical Image Analysis with Deep Learning6 Dec 2022