mlsanityData to 14 Oct 2026

Attributing AUC-ROC to Analyze Binary Classifier Performance

arXiv 2205.11781 ↗First posted 24 May 2022cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Area Under the Receiver Operating Characteristic Curve (AUC-ROC) is a popular evaluation metric for binary classifiers. In this paper, we discuss techniques to segment the AUC-ROC along human-interpretable dimensions. AUC-ROC is not an additive/linear function over the data samples, therefore such segmenting the overall AUC-ROC is different from tabulating the AUC-ROC of data segments. To segment the overall AUC-ROC, we must first solve an attribution problem to identify credit for individual examples. We observe that AUC-ROC, though non-linear over examples, is linear over pairs of examples. This observation leads to a simple, efficient attribution technique for examples (example attributions), and for pairs of examples (pair attributions). We automatically slice these attributions using decision trees by making the tree predict the attributions; we use the notion of honest estimates along with a t-test to mitigate false discovery. Our experiments with the method show that an inferior model can outperform a superior model (trained to optimize a different training objective) on the inferior model's own training objective, a manifestation of Goodhart's Law. In contrast, AUC attributions enable a reasonable comparison. Example attributions can be used to slice this comparison. Pair attributions are used to categorize pairs of items -- one positively labeled and one negatively -- that the model has trouble separating. These categories identify the decision boundary of the classifier and the headroom to improve AUC.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 12 of its 19 references that are in the map. First posted on arXiv 24 May 2022.

Builds on

12 of 19 references.

References · 12

  1. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
  2. 2017A Unified Approach to Interpreting Model Predictionscited by 6,555
  3. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  4. 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
  5. 2017Axiomatic Attribution for Deep Networkscited by 3,384
  6. 2020Beyond Accuracy: Behavioral Testing of NLP models with CheckListcited by 1,006
  7. 2020Estimating Training Data Influence by Tracing Gradient Descentcited by 580
  8. 2015Recursive Partitioning for Heterogeneous Causal Effectscited by 255
  9. 2020Large-scale Robust Deep AUC Maximization: A New Surrogate Loss and Empirical Studies on Medical Image Classificationcited by 86
  10. 2018Automated Data Slicing for Model Validation:A Big data - AI Integration Approachcited by 70
  11. 2016Scalable Learning of Non-Decomposable Objectivescited by 41
  12. 2021Provably Robust Detection of Out-of-distribution Data (almost) for freecited by 18

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 1.

2 papers.