Evaluating Graph Generative Models with Contrastively Learned Features
원문 초록
A wide range of models have been proposed for Graph Generative Models, necessitating effective methods to evaluate their quality. So far, most techniques use either traditional metrics based on subgraph counting, or the representations of randomly initialized Graph Neural Networks (GNNs). We propose using representations from contrastively trained GNNs, rather than random GNNs, and show this gives more reliable evaluation metrics. Neither traditional approaches nor GNN-based approaches dominate the other, however: we give examples of graphs that each approach is unable to distinguish. We demonstrate that Graph Substructure Networks (GSNs), which in a way combine both approaches, are better at distinguishing the distances between graph datasets.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Higher-Order Graph Databases
Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness
Communication Cost Reduction for Subgraph Counting under Local Differential Privacy via Hash Functions
Expressivity of Graph Neural Networks Through the Lens of Adversarial Robustness
DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting
Improving Expressivity of Graph Neural Networks using Localization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.