FLAGG: Flexible Autoregressive Graph Generation
Not on the map. Why?
Abstract (arXiv)
The Deep Graph Generation's panorama spans two extremes: one-shot and sequential models. The former generates nodes and edges jointly, while the latter samples them autoregressively. Each method performs better in different graph domains depending on size and topology, but neither is applicable to all graph categories. For instance, one-shot methods struggle with generating large graphs, while sequential methods underperform on smaller graphs. A possible way to overcome these limitations is to flexibly combine the two methods in a unique system. In this work, we propose the FLAGG (Flexible Autoregressive Graph Generation) framework, which sequentially generates portions of graphs with one-shot models. FLAGG can apply any one-shot model to make it autoregressive, allowing flexibility in choosing the sequential policy. This policy is specified through a stochastic node removal process, which an Insertion Model learns to reverse. We evaluate FLAGG with the DiGress one-shot model on several data sets of different graph sizes and domains. We show that the approach outperforms both one-shot and autoregressive baselines in terms of sampling quality.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 29 of its 41 references that are in the map. First posted on arXiv 3 Jun 2026.
Builds on
29 of 41 references.
References · 29
- 2020Denoising Diffusion Probabilistic Modelscited by 20,851
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 8,964
- 2022Flow Matching for Generative Modelingcited by 5,426
- 2021Improved Denoising Diffusion Probabilistic Modelscited by 3,736
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,684
- 2016Variational Graph Auto-Encoderscited by 1,373
- 2018Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networkscited by 878
- 2020A Generalization of Transformer Networks to Graphscited by 653
- 2022DiGress: Discrete Denoising diffusion for graph generationcited by 503
- 2018GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Modelscited by 406
17 more
- 2018MolGAN: An implicit generative model for small molecular graphscited by 392
- 2018GraphVAE: Towards Generation of Small Graphs Using Variational Autoencoderscited by 375
- 2020GraphAF: a Flow-based Autoregressive Model for Molecular Graph Generationcited by 301
- 2022Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equationscited by 273
- 2020Permutation Invariant Graph Generation via Score-Based Generative Modelingcited by 263
- 2019Efficient Graph Generation with Graph Recurrent Attention Networkscited by 231
- 2021GraphDF: A Discrete Flow Model for Molecular Graph Generationcited by 177
- 2021PonderNet: Learning to Pondercited by 156
- 2022SPECTRE: Spectral Conditioning Helps to Overcome the Expressivity Limits of One-shot Graph Generatorscited by 96
- 2021GraphEBM: Molecular Graph Generation with Energy-Based Modelscited by 85
- 2023Autoregressive Diffusion Model for Graph Generationcited by 82
- 2023Efficient and Degree-Guided Graph Generation via Discrete Diffusion Modelingcited by 75
- 2023Conditional Diffusion Based on Discrete Graph Structures for Molecular Graph Generationcited by 46
- 2022On Evaluation Metrics for Graph Generative Modelscited by 44
- 2021Order Matters: Probabilistic Modeling of Node Sequence for Graph Generationcited by 32
- 2023SaGess: Sampling Graph Denoising Diffusion Model for Scalable Graph Generationcited by 13
- 2024IFH: a Diffusion Framework for Flexible Design of Graph Generative Modelscited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.