Ailin Deng

Ailin Deng

Auto-generated profile, based on publicly available information

Ailin Deng

Department of Computer Science National University of Singapore

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 November 2022
Verified
Book Chapter
Closed access
PDF file
ADAilin Deng
Ailin Deng
SLShen Li
Shen Li
MXMiao Xiong
Miao Xiong
ZCZhirui Chen
Zhirui Chen
BHBryan Hooi
Bryan Hooi

2 May 2023 in arXiv
Verified
Preprint
Open access
PDF file
ADAilin Deng
Ailin Deng
MXMiao Xiong
Miao Xiong
BHBryan Hooi
Bryan Hooi
Reliable application of machine learning is of primary importance to the practical deployment of deep learning methods. A fundamental challenge is that models are often unreliable due to overconfidence. In this paper, we estimate a model's reliability by measuring \emph{the agreement between its latent space, and the latent space of a foundation model}. However, it is challenging to measure the agreement between two different latent spaces due to their incoherence, \eg, arbitrary rotations and different dimensionality. To overcome this incoherence issue, we design a \emph{neighborhood agreement measure} between latent spaces and find that this agreement is surprisingly well-correlated with the reliability of a model's predictions. Further, we show that fusing neighborhood agreement into a model's predictive confidence in a post-hoc way significantly improves its reliability. Theoretical analysis and extensive experiments on failure detection across various datasets verify the effectiveness of our method on both in-distribution and out-of-distribution settings.

29 November 2022 in arXiv
Verified
Preprint
Open access
PDF file
MXMiao Xiong
Miao Xiong
SLShen Li
Shen Li
WFWenjie Feng
Wenjie Feng
ADAilin Deng
Ailin Deng
JZJihai Zhang
Jihai Zhang
BHBryan Hooi
Bryan Hooi
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.