Unifying Generation and Prediction on Graphs with Latent Graph Diffusion

Cai Zhou, Xiyuan Wang, Muhan Zhang
2/4/2024
cs.LGcs.SI

No official code found. Best implementation: zhouc20/LatentGraphDiffusion (49 stars, MIT, last commit 2024-12-17).

Abstract

In this paper, we propose the first framework that enables solving graph learning tasks of all levels (node, edge and graph) and all types (generation, regression and classification) using one formulation. We first formulate prediction tasks including regression and classification into a generic (conditional) generation framework, which enables diffusion models to perform deterministic tasks with provable guarantees. We then propose Latent Graph Diffusion (LGD), a generative model that can generate node, edge, and graph-level features of all categories simultaneously. We achieve this goal by embedding the graph structures and features into a latent space leveraging a powerful encoder and decoder, then training a diffusion model in the latent space. LGD is also capable of conditional generation through a specifically designed cross-attention mechanism. Leveraging LGD and the ``all tasks as generation'' formulation, our framework is capable of solving graph tasks of various levels and types. We verify the effectiveness of our framework with extensive experiments, where our models achieve state-of-the-art or highly competitive results across a wide range of generation and regression tasks.

View on arXivView PDF

Code Implementations(1)

MIT

Official Repository for NeurIPS 2024 Paper Unifying Generation and Prediction on Graphs with Latent Graph Diffusion

4913Shell, PythonOct 24, 20241 years agoMIT

Similar Papers

Cite this paper

@article{zhou2024unifying,
  title  = {Unifying Generation and Prediction on Graphs with Latent Graph Diffusion},
  author = {Cai Zhou and Xiyuan Wang and Muhan Zhang},
  year   = {2024},
  eprint = {2402.02518},
  archivePrefix = {arXiv},
  doi    = {10.52202/079017-1979},
  url    = {http://arxiv.org/abs/2402.02518v2},
  journal = {NEURIPS 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2402.02518.svg)](https://codeofpaper.com/paper/2402.02518)

Discussion