GADPN: Graph Adaptive Denoising and Perturbation Networks via Singular Value Decomposition
Hao Deng, Bo Liu

TL;DR
GADPN is a novel graph structure learning framework that adaptively denoises and perturbs graph topology using SVD and Bayesian optimization, improving GNN performance on noisy and diverse graphs.
Contribution
It introduces a simple, efficient method combining low-rank denoising and SVD-based structural perturbation with adaptive Bayesian optimization for graph topology refinement.
Findings
Achieves state-of-the-art results on benchmark datasets.
Significantly improves performance on disassortative graphs.
Enhances robustness and efficiency of graph structure learning.
Abstract
While Graph Neural Networks (GNNs) excel on graph-structured data, their performance is fundamentally limited by the quality of the observed graph, which often contains noise, missing links, or structural properties misaligned with GNNs' underlying assumptions. To address this, graph structure learning aims to infer a more optimal topology. Existing methods, however, often incur high computational costs due to complex generative models and iterative joint optimization, limiting their practical utility. In this paper, we propose GADPN, a simple yet effective graph structure learning framework that adaptively refines graph topology via low-rank denoising and generalized structural perturbation. Our approach makes two key contributions: (1) we introduce Bayesian optimization to adaptively determine the optimal denoising strength, tailoring the process to each graph's homophily level; and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Graph Theory and Algorithms · Complex Network Analysis Techniques
