Metraipolis › archive › dc_2f0fc0e058a4
Graph-Localized Coverage for Conformal Prediction on Inductive Graphs — arXiv:2611.04066
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.04066
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T18:53:57.727Z
- SHA-256 of the archived text
a70c14a677982da801e188e72cfaef26feca3ecfe8543b607093b415fb701ead- Stable URL of this page
https://metraipolis.com/documento/dc_2f0fc0e058a4
How to cite
Graph-Localized Coverage for Conformal Prediction on Inductive Graphs — arXiv:2611.04066 — arXiv (en), https://arxiv.org/abs/2611.04066 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2f0fc0e058a4 (Metraipolis archive dc_2f0fc0e058a4, sha256 a70c14a677982da801e188e72cfaef26feca3ecfe8543b607093b415fb701ead)
BibTeX
@misc{dc2f0fc0e058a4,
title = {Graph-Localized Coverage for Conformal Prediction on Inductive Graphs — arXiv:2611.04066},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.04066},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2f0fc0e058a4; sha256 a70c14a677982da801e188e72cfaef26feca3ecfe8543b607093b415fb701ead},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04066. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Conformal prediction (CP) provides marginal coverage guarantees, but marginal coverage does not determine where prediction errors occur on a graph. Queries from different graph neighborhoods can exhibit substantially different levels of uncertainty even when aggregate coverage remains near its target. We introduce GLocalCP, an online CP framework for inductive node classification and edge prediction that combines marginal and graph-local calibration with uncertainty-adaptive prediction sets. Specifically, GLocalCP puts forth a novel uncertainty-adaptive nonconformality score that relies on the mutual information obtained from Monte-Carlo (MC) dropout based prediction. Then, it augments a global online threshold with a kernel-based local correction that propagates coverage feedback among similar graph queries. On the theoretical horizon, we establish pathwise $O(N^{-1/2})$ marginal calibration error without exchangeability or stationarity and, for the exact-kernel formulation, an explicit $O(N^{-1/2})$ graph-localized calibration guarantee. Experiments on seven node-classification and seven edge-prediction benchmarks show that similar marginal coverage can conceal substantially different local reliability. Our proposed GLocalCP maintains coverage near the target while consistently reducing graph-local calibration error. Uncertainty scaling in GLocalCP further reduces prediction-set size across all evaluated node and edge datasets while leaving marginal coverage essentially unchanged.
Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (cs.LG) ; Machine Learning (stat.ML).
Pagina del lavoro: https://arxiv.org/abs/2611.04066 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T18:35:37.420Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).