跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2605.08074 · v2

GRAPHLCP: Structure-Aware Localized Conformal Prediction on Graphs

首次提交 2026-05-09 01:56
版本更新 2026-11-16 23:12
雷达观测 2026-11-17 16:10
arXiv ↗PDF ↗

摘要

Conformal prediction (CP) provides a distribution-free approach to uncertainty quantification with finite-sample guarantees. However, applying CP to graph neural networks (GNNs) remains challenging as the combinatorial nature of graphs often leads to insufficiently certain predictions and indiscriminative embeddings. Existing methods primarily rely on embedding-space proximity for localization, which can be unreliable for graphs and yield uneven coverage across different graph regions. We propose GRAPHLCP, a proximity-based localized CP framework that incorporates graph topology and inter-node dependencies into localization and weighting. Our approach introduces a feature-aware densification step to mitigate locality bias in sparse graphs, followed by a Personalized PageRank-based kernel computation to model structural proximity. This enables topology-dependent anchor sampling and calibration weighting that captures both local and long-range dependencies. Extensive experiments on regression and classification datasets demonstrate that GRAPHLCP improves test-conditional coverage without excessive conservativeness, while preserving finite-sample marginal coverage.

作者备注:Accepted to NeurIPS 2026

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v2,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v2 · 2026-11-16 23:12 · 最新观测版本

GRAPHLCP: Structure-Aware Localized Conformal Prediction on Graphs

Conformal prediction (CP) provides a distribution-free approach to uncertainty quantification with finite-sample guarantees. However, applying CP to graph neural networks (GNNs) remains challenging as the combinatorial nature of graphs often leads to insufficiently certain predictions and indiscriminative embeddings. Existing methods primarily rely on embedding-space proximity for localization, which can be unreliable for graphs and yield uneven coverage across different graph regions. We propose GRAPHLCP, a proximity-based localized CP framework that incorporates graph topology and inter-node dependencies into localization and weighting. Our approach introduces a feature-aware densification step to mitigate locality bias in sparse graphs, followed by a Personalized PageRank-based kernel computation to model structural proximity. This enables topology-dependent anchor sampling and calibration weighting that captures both local and long-range dependencies. Extensive experiments on regression and classification datasets demonstrate that GRAPHLCP improves test-conditional coverage without excessive conservativeness, while preserving finite-sample marginal coverage.

查看此版本解读 →查看此版本原文 ↗