跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 08:44 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 10:56 — 2026-11-22 10:56(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 08:44最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 08:42(北京时间)
版本更新 · v2arXiv:2605.08074

GRAPHLCP: Structure-Aware Localized Conformal Prediction on Graphs

Peyman Baghershahi, Fangxin Wang, Debmalya Mandal, Sourav Medya

原文摘要

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.

cs.LG

新论文 · v1arXiv:2611.20330

Sidewalk Stewards: A Visual Analytics Approach for Interactive Topology Repair of Sidewalk Networks

Stefan Cobeli, Leonardo Ferreira, Logan Loch, Luiza Melo, Peyman Baghershahi, Claudio D. G. Linhares, Nivan Ferreira, Sourav Medya 等 10 位作者

原文摘要

Accurate pedestrian network data is foundational to urban accessibility, routing, and infrastructure planning, yet such data remains scarce and difficult to produce at scale. Automated extraction pipelines have made significant strides by leveraging computer vision to derive sidewalk networks from aerial imagery, and have seen real-world adoption by municipalities seeking cost-effective inventory solutions. Yet, these pipelines consistently produce topological errors (e.g., disconnected components, dangling edges, missed connections, malformed intersections) that undermine the utility of the extracted networks for routing and accessibility analysis. Correcting these errors requires situated human judgment that global automated repair strategies cannot replicate, yet practitioners currently lack dedicated tools to support this work efficiently. We present Sidewalk Stewards, a visual analytics system that bridges the gap between automated extraction and a deployment-ready pedestrian network. Sidewalk Stewards detects candidate topology errors, supports interactive user-guided correction through coordinated spatial views, and provides real-time quality feedback as edits are applied. We evaluate Sidewalk Stewards through a comparative user study, case studies across cities, and a quantitative evaluation. Compared with conventional workflows, the system facilitates error identification and enables faster and more complete correction. The case studies illustrate the workflow across different urban contexts, and the quantitative evaluation shows that a small number of user corrections can enhance multiple sidewalk quality metrics. Sidewalk Stewards is available at urbantk.org/sidewalk.

cs.HC · cs.CV · cs.CY

首次观测 · 记录 #1ACL Anthology · ACL 2026:acl:2026.acl-long.1944ACL Anthology · ACL 2026

From Nodes to Narratives: Explaining Graph Neural Networks with LLMs and Graph Context

Peyman Baghershahi, Gregoire Fournier Amazon, Pranav Nyati, Sourav Medya University of Illinois at Chicago

原文摘要

Graph Neural Networks (GNNs) have emerged as powerful tools for learning over structured data, including text-attributed graphs (TAGs), which are common in domains such as citation networks, social platforms, and knowledge graphs. GNNs are not inherently interpretable and thus, many explanation methods have been proposed. However, existing explanation methods often struggle to generate interpretable, fine-grained rationales, especially when node attributes include rich natural language. In this work, we introduce GSPELL, a lightweight, post-hoc framework that uses large language models (LLMs) to generate faithful and interpretable explanations for GNN predictions. GSPELL projects GNN node embeddings into the LLM embedding space and constructs hybrid prompts that interleave soft prompts with textual inputs from the graph structure. This enables the LLM to reason about GNN internal representations and to produce natural-language explanations, along with concise explanation subgraphs. Our experiments across real-world TAG datasets demonstrate that GSPELL achieves a favorable trade-off between fidelity and sparsity, while improving human-centric metrics such as insightfulness. GSPELL sets a new direction for LLM-based explainability in graph learning by aligning GNN internals with human reasoning.

cs.CL

Proceedings of the 64th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · 2026 · 正式发表