Scaling Novel Graph Generation via Lightweight Structure-Guided Autoregressive Models

• URL: http://arxiv.org/abs/2606.04287v1
• Date: Tue, 02 Jun 2026 23:34:03 GMT
• Title: Scaling Novel Graph Generation via Lightweight Structure-Guided Autoregressive Models
• Abstract summary: Current graph generative models are limited by scalability and novelty.<n>We propose a lightweight autoregressive framework to address these issues.<n>We show that our approach improves novelty while preserving high validity and uniqueness.
• Score: 2.4909077571620513
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Generating realistic and diverse graphs is a key problem in machine learning, with applications in molecular discovery, circuit design, cybersecurity, and beyond. However, current graph generative models remain limited by scalability and novelty. Diffusion-based methods often require costly full-adjacency operations and long denoising chains, while many autoregressive and hybrid models have at least quadratic complexity. In addition, these models often imitate training graphs rather than generalize beyond them. We propose a lightweight autoregressive framework to address these issues. It uses a structure-guided topological ordering to serialize graphs into regular edge sequences, enabling near log-linear generation, and a two-phase training strategy that combines exploration-oriented augmentation with iterative refinement to reduce overfitting and promote controlled novelty. Experiments on molecular and non-molecular benchmarks show that our approach improves novelty while preserving high validity and uniqueness. The framework also supports both LSTM and Mamba-style causal sequence backbones, with large-memory accelerators enabling longer graph-sequence experiments beyond typical GPU limits.

Related papers

• Graph Hierarchical Recurrence for Long-Range Generalization [25.351165089986868]
  Graph Neural Networks (GNNs) and Graph Transformers (GTs) are now a fundamental paradigm for graph learning.<n>We introduce Graph Hierarchical Recurrence (GHR), a novel framework that operates jointly on the input graph and on a hierarchical abstraction obtained through pooling.<n>We show that GHR consistently outperforms existing graph models while using as little as 1% of the parameters of current state-of-the-art models.
  arXiv  Detail & Related papers  (2026-05-18T13:31:21Z)
• Graph VQ-Transformer (GVT): Fast and Accurate Molecular Generation via High-Fidelity Discrete Latents [6.5389217759933125]
  We introduce the Graph VQ-Transformer (GVT), a two-stage generative framework that achieves both high accuracy and efficiency.<n>The core of our approach is a novel Graph Vector Quantized Variational Autoencoder (VQ-VAE) that compresses molecular graphs into high-fidelity discrete latent sequences.<n>GVT achieves state-of-the-art or highly competitive performance across major benchmarks like ZINC250k, MOSES, and GuacaMol.
  arXiv  Detail & Related papers  (2025-12-02T11:44:15Z)
• Improving Long-Range Interactions in Graph Neural Simulators via Hamiltonian Dynamics [71.53370807809296]
  Recent Graph Neural Simulators (GNSs) accelerate simulations by learning dynamics on graph-structured data.<n>We propose Information-preserving Graph Neural Simulators (IGNS), a graph-based neural simulator built on the principles of Hamiltonian dynamics.<n>IGNS consistently outperforms state-of-the-art GNSs, achieving higher accuracy and stability under challenging and complex dynamical systems.
  arXiv  Detail & Related papers  (2025-11-11T12:53:56Z)
• Scalable Graph Generative Modeling via Substructure Sequences [50.32639806800683]
  We introduce Generative Graph Pattern Machine (G$2$PM), a generative Transformer pre-training framework for graphs.<n>G$2$PM represents graph instances (nodes, edges, or entire graphs) as sequences of substructures.<n>It employs generative pre-training over the sequences to learn generalizable and transferable representations.
  arXiv  Detail & Related papers  (2025-05-22T02:16:34Z)
• Diffusion-Free Graph Generation with Next-Scale Prediction [3.505533791554976]
  We propose a novel diffusion-free graph generation framework based on next-scale prediction.<n>By leveraging a hierarchy of latent representations, the model progressively generates scales of the entire graph without the need for explicit node ordering.<n>Experiments on both generic and molecular graph datasets demonstrated the potential of this method, achieving inference speedups of up to three orders of magnitude over state-of-the-art methods.
  arXiv  Detail & Related papers  (2025-03-30T22:30:34Z)
• Towards Scalable and Deep Graph Neural Networks via Noise Masking [59.058558158296265]
  Graph Neural Networks (GNNs) have achieved remarkable success in many graph mining tasks.<n> scaling them to large graphs is challenging due to the high computational and storage costs.<n>We present random walk with noise masking (RMask), a plug-and-play module compatible with the existing model-simplification works.
  arXiv  Detail & Related papers  (2024-12-19T07:48:14Z)
• Graph Generation with Diffusion Mixture [57.78958552860948]
  Generation of graphs is a major challenge for real-world tasks that require understanding the complex nature of their non-Euclidean structures. We propose a generative framework that models the topology of graphs by explicitly learning the final graph structures of the diffusion process.
  arXiv  Detail & Related papers  (2023-02-07T17:07:46Z)
• Improving Graph Generation by Restricting Graph Bandwidth [0.7874708385247353]
  Deep graph generative modeling has proven capable of learning the distribution of complex, multi-scale structures characterizing real-world graphs. One of the main limitations of existing methods is their large output space. We propose a novel approach that significantly reduces the output space of existing graph generative models.
  arXiv  Detail & Related papers  (2023-01-25T22:27:46Z)
• Multivariate Time Series Forecasting with Dynamic Graph Neural ODEs [65.18780403244178]
  We propose a continuous model to forecast Multivariate Time series with dynamic Graph neural Ordinary Differential Equations (MTGODE) Specifically, we first abstract multivariate time series into dynamic graphs with time-evolving node features and unknown graph structures. Then, we design and solve a neural ODE to complement missing graph topologies and unify both spatial and temporal message passing.
  arXiv  Detail & Related papers  (2022-02-17T02:17:31Z)
• TG-GAN: Continuous-time Temporal Graph Generation with Deep Generative Models [9.75258136573147]
  We propose a new model, called Temporal Graph Generative Adversarial Network'' (TG-GAN) for continuous-time temporal graph generation. We first propose a novel temporal graph generator that jointly model truncated edge sequences, time budgets, and node attributes. In addition, a new temporal graph discriminator is proposed, which combines time and node encoding operations over a recurrent architecture to distinguish the generated sequences.
  arXiv  Detail & Related papers  (2020-05-17T17:59:12Z)
• Graph Ordering: Towards the Optimal by Learning [69.72656588714155]
  Graph representation learning has achieved a remarkable success in many graph-based applications, such as node classification, prediction, and community detection. However, for some kind of graph applications, such as graph compression and edge partition, it is very hard to reduce them to some graph representation learning tasks. In this paper, we propose to attack the graph ordering problem behind such applications by a novel learning approach.
  arXiv  Detail & Related papers  (2020-01-18T09:14:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.