A3Rank: Augmentation Alignment Analysis for Prioritizing Overconfident Failing Samples for Deep Learning Models
Zhengyuan Wei, Haipeng Wang, Qilin Zhou, W.K. Chan

TL;DR
This paper introduces A3Rank, a novel test case prioritization method that uses augmentation alignment analysis to identify high-confidence failing samples in deep learning models, outperforming existing techniques.
Contribution
A3Rank is a new technique that effectively ranks failing samples by analyzing prediction misalignments with augmented test cases, enhancing detection beyond confidence-based rejectors.
Findings
A3Rank outperforms peer techniques by 163.63% in detection ratio.
The framework improves defense success rate against high-confidence failures.
Augmentation alignment analysis effectively identifies elusive failing samples.
Abstract
Sharpening deep learning models by training them with examples close to the decision boundary is a well-known best practice. Nonetheless, these models are still error-prone in producing predictions. In practice, the inference of the deep learning models in many application systems is guarded by a rejector, such as a confidence-based rejector, to filter out samples with insufficient prediction confidence. Such confidence-based rejectors cannot effectively guard against failing samples with high confidence. Existing test case prioritization techniques effectively distinguish confusing samples from confident samples to identify failing samples among the confusing ones, yet prioritizing the failing ones high among many confident ones is challenging. In this paper, we propose Rank, a novel test case prioritization technique with augmentation alignment analysis, to address this problem.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning
