Graph Representation Learning with Diffusion Generative Models
Daniel Wesego

TL;DR
This paper explores the application of discrete diffusion models within an autoencoder framework to learn meaningful embeddings for graph-structured data, addressing the challenge of adapting diffusion processes to discrete graphs.
Contribution
It introduces a novel method combining discrete diffusion models with autoencoders for effective graph representation learning, a relatively unexplored area.
Findings
Successful autoencoding of graph data using diffusion models
Effective extraction of graph embeddings from diffusion process
Potential for improved graph representation learning
Abstract
Diffusion models have established themselves as state-of-the-art generative models across various data modalities, including images and videos, due to their ability to accurately approximate complex data distributions. Unlike traditional generative approaches such as VAEs and GANs, diffusion models employ a progressive denoising process that transforms noise into meaningful data over multiple iterative steps. This gradual approach enhances their expressiveness and generation quality. Not only that, diffusion models have also been shown to extract meaningful representations from data while learning to generate samples. Despite their success, the application of diffusion models to graph-structured data remains relatively unexplored, primarily due to the discrete nature of graphs, which necessitates discrete diffusion processes distinct from the continuous methods used in other domains. In…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Graph Theory and Algorithms · Topic Modeling
MethodsDiffusion
