Skip to yearly menu bar Skip to main content

In-Person Poster presentation / poster accept

DiGress: Discrete Denoising diffusion for graph generation

ClĂ©ment Vignac · Igor Krawczuk · Antoine Siraudin · Bohan Wang · Volkan Cevher · Pascal Frossard

MH1-2-3-4 #113

Keywords: [ graph generation ] [ Discrete Diffusion ] [ Molecule Generation ] [ Permutation Equivariance ] [ Denoising Diffusion Model ] [ Generative models ]


This work introduces DiGress, a discrete denoising diffusion model for generating graphs with categorical node and edge attributes.Our model utilizes a discrete diffusion process that progressively edits graphs with noise, through the process of adding or removing edges and changing the categories.A graph transformer network is trained to revert this process, simplifying the problem of distribution learning over graphs into a sequence of node and edge classification tasks.We further improve sample quality by introducing a Markovian noise model that preserves the marginal distribution of node and edge types during diffusion, and by incorporating auxiliary graph-theoretic features.A procedure for conditioning the generation on graph-level features is also proposed.DiGress achieves state-of-the-art performance on molecular and non-molecular datasets, with up to 3x validity improvement on a planar graph dataset. It is also the first model to scale to the large GuacaMol dataset containing 1.3M drug-like molecules without the use of molecule-specific representations.

Chat is not available.