SwinGNN: Rethinking Permutation Invariance in Diffusion Models for Graph Generation

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Yan, Qi, Liang, Zhengyang, Song, Yang, Liao, Renjie, Wang, Lele
Format: Preprint
Published: 2023
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929391426076672
author Yan, Qi
Liang, Zhengyang
Song, Yang
Liao, Renjie
Wang, Lele
author_facet Yan, Qi
Liang, Zhengyang
Song, Yang
Liao, Renjie
Wang, Lele
contents Diffusion models based on permutation-equivariant networks can learn permutation-invariant distributions for graph data. However, in comparison to their non-invariant counterparts, we have found that these invariant models encounter greater learning challenges since 1) their effective target distributions exhibit more modes; 2) their optimal one-step denoising scores are the score functions of Gaussian mixtures with more components. Motivated by this analysis, we propose a non-invariant diffusion model, called $\textit{SwinGNN}$, which employs an efficient edge-to-edge 2-WL message passing network and utilizes shifted window based self-attention inspired by SwinTransformers. Further, through systematic ablations, we identify several critical training and sampling techniques that significantly improve the sample quality of graph generation. At last, we introduce a simple post-processing trick, $\textit{i.e.}$, randomly permuting the generated graphs, which provably converts any graph generative model to a permutation-invariant one. Extensive experiments on synthetic and real-world protein and molecule datasets show that our SwinGNN achieves state-of-the-art performances. Our code is released at https://github.com/qiyan98/SwinGNN.
format Preprint
id arxiv_https___arxiv_org_abs_2307_01646
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle SwinGNN: Rethinking Permutation Invariance in Diffusion Models for Graph Generation
Yan, Qi
Liang, Zhengyang
Song, Yang
Liao, Renjie
Wang, Lele
Machine Learning
Artificial Intelligence
Diffusion models based on permutation-equivariant networks can learn permutation-invariant distributions for graph data. However, in comparison to their non-invariant counterparts, we have found that these invariant models encounter greater learning challenges since 1) their effective target distributions exhibit more modes; 2) their optimal one-step denoising scores are the score functions of Gaussian mixtures with more components. Motivated by this analysis, we propose a non-invariant diffusion model, called $\textit{SwinGNN}$, which employs an efficient edge-to-edge 2-WL message passing network and utilizes shifted window based self-attention inspired by SwinTransformers. Further, through systematic ablations, we identify several critical training and sampling techniques that significantly improve the sample quality of graph generation. At last, we introduce a simple post-processing trick, $\textit{i.e.}$, randomly permuting the generated graphs, which provably converts any graph generative model to a permutation-invariant one. Extensive experiments on synthetic and real-world protein and molecule datasets show that our SwinGNN achieves state-of-the-art performances. Our code is released at https://github.com/qiyan98/SwinGNN.
title SwinGNN: Rethinking Permutation Invariance in Diffusion Models for Graph Generation
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2307.01646