Graph and graphon neural network stability
원문 초록
Graph neural networks (GNNs) are learning architectures that rely on knowledge of the graph structure to generate meaningful representations of large-scale network data. GNN stability is thus important as in real-world scenarios there are typically uncertainties associated with the graph. We analyze GNN stability using kernel objects called graphons. Graphons are both limits of convergent graph sequences and generating models for deterministic and stochastic graphs. Building upon the theory of graphon signal processing, we define graphon neural networks and analyze their stability to graphon perturbations. We then extend this analysis by interpreting the graphon neural network as a generating model for GNNs on deterministic and stochastic graphs instantiated from the original and perturbed graphons. We observe that GNNs are stable to graphon perturbations with a stability bound that decreases asymptotically with the size of the graph. This asymptotic behavior is further demonstrated in an experiment of movie recommendation.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Ducho meets Elliot: Large-scale Benchmarks for Multimodal Recommendation
Harm Mitigation in Recommender Systems under User Preference Dynamics
Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
LFG: A Generative Network for Real-Time Recommendation
LlamaRec: Two-Stage Recommendation using Large Language Models for Ranking
On Generative Agents in Recommendation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.