mlsanityData to 14 Oct 2026

Towards Reliable Rare Category Analysis on Graphs via Individual Calibration

arXiv 2307.09858 ↗First posted 19 Jul 2023cs.AIcited by 6

Not on the map. Why?

Abstract (arXiv)

Rare categories abound in a number of real-world networks and play a pivotal role in a variety of high-stakes applications, including financial fraud detection, network intrusion detection, and rare disease diagnosis. Rare category analysis (RCA) refers to the task of detecting, characterizing, and comprehending the behaviors of minority classes in a highly-imbalanced data distribution. While the vast majority of existing work on RCA has focused on improving the prediction performance, a few fundamental research questions heretofore have received little attention and are less explored: How confident or uncertain is a prediction model in rare category analysis? How can we quantify the uncertainty in the learning process and enable reliable rare category analysis? To answer these questions, we start by investigating miscalibration in existing RCA methods. Empirical results reveal that state-of-the-art RCA methods are mainly over-confident in predicting minority classes and under-confident in predicting majority classes. Motivated by the observation, we propose a novel individual calibration framework, named CALIRARE, for alleviating the unique challenges of RCA, thus enabling reliable rare category analysis. In particular, to quantify the uncertainties in RCA, we develop a node-level uncertainty quantification algorithm to model the overlapping support regions with high uncertainty; to handle the rarity of minority classes in miscalibration calculation, we generalize the distribution-based calibration metric to the instance level and propose the first individual calibration measurement on graphs named Expected Individual Calibration Error (EICE). We perform extensive experimental evaluations on real-world datasets, including rare category characterization and model calibration tasks, which demonstrate the significance of our proposed framework.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 21 of its 56 references that are in the map. First posted on arXiv 19 Jul 2023.

Builds on

21 of 56 references.

References · 21

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Graph Attention Networkscited by 8,923
  3. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
  4. 2017On Calibration of Modern Neural Networkscited by 4,960
  5. 2018How Powerful are Graph Neural Networks?cited by 4,393
  6. 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
  7. 2019When Does Label Smoothing Help?cited by 988
  8. 2019Multi-scale Attributed Node Embeddingcited by 548
  9. 2019Measuring Calibration in Deep Learningcited by 446
  10. 2021Revisiting the Calibration of Modern Neural Networkscited by 390
  11. 2019Verified Uncertainty Calibrationcited by 309
  12. 2020MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embeddingcited by 304
9 more
  1. 2019Predictive inference with the jackknife+cited by 211
  2. 2020Pitfalls of In-Domain Uncertainty Estimation and Ensembling in Deep Learningcited by 210
  3. 2020Mix-n-Match: Ensemble and Compositional Methods for Uncertainty Calibration in Deep Learningcited by 190
  4. 2019Evaluating model calibration in classificationcited by 168
  5. 2021Be Confident! Towards Trustworthy Graph Neural Networks via Confidence Calibrationcited by 92
  6. 2019Calibration tests in multi-class classification: A unifying frameworkcited by 79
  7. 2020Discriminative Jackknife: Quantifying Uncertainty in Deep Learning via Higher-Order Influence Functionscited by 34
  8. 2022JuryGCN: Quantifying Jackknife Uncertainty on Graph Convolutional Networkscited by 15
  9. 2017Explaining Anomalies in Groups with Characterizing Subspace Rulescited by 13

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 1; 2025: 2; 2026: 2.

6 papers.