GRAND: Graph Neural Diffusion
원문 초록
We present Graph Neural Diffusion (GRAND) that approaches deep learning on graphs as a continuous diffusion process and treats Graph Neural Networks (GNNs) as discretisations of an underlying PDE. In our model, the layer structure and topology correspond to the discretisation choices of temporal and spatial operators. Our approach allows a principled development of a broad new class of GNNs that are able to address the common plights of graph learning models such as depth, oversmoothing, and bottlenecks. Key to the success of our models are stability with respect to perturbations in the data and this is addressed for both implicit and explicit discretisation schemes. We develop linear and nonlinear versions of GRAND, which achieve competitive results on many standard graph benchmarks.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph World Model
S2FGL: Spatial Spectral Federated Graph Learning
Self-Supervised Graph Learning via Spectral Bootstrapping and Laplacian-Based Augmentations
Fast and Distributed Equivariant Graph Neural Networks by Virtual Node Learning
Higher-Order Graph Databases
Delving into Instance-Dependent Label Noise in Graph Data: A Comprehensive Study and Benchmark
토론
이 논문과 연결된 포럼 글이 아직 없습니다.