LGMLFeb 6, 2024

Pard: Permutation-Invariant Autoregressive Diffusion for Graph Generation

arXiv:2402.03687v324 citationsh-index: 48Has CodeNIPS
Originality Incremental advance
AI Analysis

This work addresses graph generation for domains like chemistry and network analysis by providing a more efficient and permutation-invariant method, though it is incremental as it builds on existing diffusion and autoregressive techniques.

The paper tackles the problem of graph generation by introducing PARD, a permutation-invariant autoregressive diffusion model that integrates diffusion and autoregressive methods to overcome ordering sensitivity and inefficiency in existing approaches. It achieves state-of-the-art performance on molecular and non-molecular datasets, scaling to large datasets like MOSES with 1.9M molecules without extra features.

Graph generation has been dominated by autoregressive models due to their simplicity and effectiveness, despite their sensitivity to ordering. Yet diffusion models have garnered increasing attention, as they offer comparable performance while being permutation-invariant. Current graph diffusion models generate graphs in a one-shot fashion, but they require extra features and thousands of denoising steps to achieve optimal performance. We introduce PARD, a Permutation-invariant Auto Regressive Diffusion model that integrates diffusion models with autoregressive methods. PARD harnesses the effectiveness and efficiency of the autoregressive model while maintaining permutation invariance without ordering sensitivity. Specifically, we show that contrary to sets, elements in a graph are not entirely unordered and there is a unique partial order for nodes and edges. With this partial order, PARD generates a graph in a block-by-block, autoregressive fashion, where each block's probability is conditionally modeled by a shared diffusion model with an equivariant network. To ensure efficiency while being expressive, we further propose a higher-order graph transformer, which integrates transformer with PPGN. Like GPT, we extend the higher-order graph transformer to support parallel training of all blocks. Without any extra features, PARD achieves state-of-the-art performance on molecular and non-molecular datasets, and scales to large datasets like MOSES containing 1.9M molecules. Pard is open-sourced at https://github.com/LingxiaoShawn/Pard.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes