
























Abstract:We propose a subgraph importance estimation method for pretrained Graph Neural Networks (GNNs) on graph-level tasks, formulated as a linear Group Lasso regression problem in the embedding space. Our method effectively leverages prior domain knowledge of graph substructures, while remaining independent of the specific form of the output layer or readout function used in the GNN architecture, and it does not require access to ground-truth target labels. Experiments on real-world graph datasets demonstrate that our method consistently outperforms existing baselines in subgraph importance estimation. Furthermore, we extend our method to identify important nodes within the graph.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.12009 [cs.LG] |
| (or arXiv:2605.12009v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.12009 arXiv-issued DOI via DataCite (pending registration) |
From: Seunghwan An [view email]
[v1]
Tue, 12 May 2026 12:00:16 UTC (2,182 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。