Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2306.07618 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911746012217344 |
|---|---|
| author | Wen, Lingfeng Tang, Xuan Ouyang, Mingjie Shen, Xiangxiang Yang, Jian Zhu, Daxin Chen, Mingsong Wei, Xian |
| author_facet | Wen, Lingfeng Tang, Xuan Ouyang, Mingjie Shen, Xiangxiang Yang, Jian Zhu, Daxin Chen, Mingsong Wei, Xian |
| contents | Diffusion generative models (DMs) have achieved promising results in image and graph generation. However, real-world graphs, such as social networks, molecular graphs, and traffic graphs, generally share non-Euclidean topologies and hidden hierarchies. For example, the degree distributions of graphs are mostly power-law distributions. The current latent diffusion model embeds the hierarchical data in a Euclidean space, which leads to distortions and interferes with modeling the distribution. Instead, hyperbolic space has been found to be more suitable for capturing complex hierarchical structures due to its exponential growth property. In order to simultaneously utilize the data generation capabilities of diffusion models and the ability of hyperbolic embeddings to extract latent hierarchical distributions, we propose a novel graph generation method called, Hyperbolic Graph Diffusion Model (HGDM), which consists of an auto-encoder to encode nodes into successive hyperbolic embeddings, and a DM that operates in the hyperbolic latent space. HGDM captures the crucial graph structure distributions by constructing a hyperbolic potential node space that incorporates edge information. Extensive experiments show that HGDM achieves better performance in generic graph and molecule generation benchmarks, with a $48\%$ improvement in the quality of graph generation with highly hierarchical structures. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2306_07618 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Hyperbolic Graph Diffusion Model Wen, Lingfeng Tang, Xuan Ouyang, Mingjie Shen, Xiangxiang Yang, Jian Zhu, Daxin Chen, Mingsong Wei, Xian Machine Learning Artificial Intelligence Quantitative Methods Diffusion generative models (DMs) have achieved promising results in image and graph generation. However, real-world graphs, such as social networks, molecular graphs, and traffic graphs, generally share non-Euclidean topologies and hidden hierarchies. For example, the degree distributions of graphs are mostly power-law distributions. The current latent diffusion model embeds the hierarchical data in a Euclidean space, which leads to distortions and interferes with modeling the distribution. Instead, hyperbolic space has been found to be more suitable for capturing complex hierarchical structures due to its exponential growth property. In order to simultaneously utilize the data generation capabilities of diffusion models and the ability of hyperbolic embeddings to extract latent hierarchical distributions, we propose a novel graph generation method called, Hyperbolic Graph Diffusion Model (HGDM), which consists of an auto-encoder to encode nodes into successive hyperbolic embeddings, and a DM that operates in the hyperbolic latent space. HGDM captures the crucial graph structure distributions by constructing a hyperbolic potential node space that incorporates edge information. Extensive experiments show that HGDM achieves better performance in generic graph and molecule generation benchmarks, with a $48\%$ improvement in the quality of graph generation with highly hierarchical structures. |
| title | Hyperbolic Graph Diffusion Model |
| topic | Machine Learning Artificial Intelligence Quantitative Methods |
| url | https://arxiv.org/abs/2306.07618 |