🤖 AI Summary
Existing graph generation methods are constrained by either one-shot or autoregressive paradigms, struggling to accommodate graphs of varying scales and topologies. This work proposes FLAGG, a novel framework that flexibly integrates these two paradigms for the first time. By embedding any one-shot graph generation model—such as DiGress—into an autoregressive pipeline and leveraging stochastic node removal together with its inverse process, FLAGG enables customizable, segment-wise generation strategies. This approach overcomes the limitations inherent in relying solely on one generation paradigm and achieves consistently superior performance across multiple graph datasets, significantly outperforming both pure one-shot and pure autoregressive baselines while enhancing overall generation quality.
📝 Abstract
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.