arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.03596cs.LG
收藏

基于扩散混合的图生成

Graph Generation with Diffusion Mixture

Korea Advanced Institute of Science and Technology (KAIST)(韩国科学技术院)

Jaehyeong Jo, Dongki Kim, Sung Ju Hwang

AI总结:

针对扩散模型无法显式学习图拓扑结构的局限,提出一种以端点为条件的扩散混合生成框架,通过显式学习最终图结构实现最大似然训练,在分子等图生成任务上优于以往模型。

摘要:

图生成是现实世界任务中的一大挑战,这些任务需要理解其非欧几里得结构的复杂性质。尽管扩散模型最近在图生成方面取得了显著成功,但它们并不适合对图的拓扑性质进行建模,因为学习对噪声样本去噪并没有显式地学习要生成的图结构。为了解决这一限制,我们提出了一个生成框架,通过显式学习扩散过程的最终图结构来对图的拓扑进行建模。具体而言,我们将生成过程设计为以端点为条件的扩散过程的混合,该过程朝着预测图驱动,从而实现快速收敛。我们进一步引入了混合过程的简单参数化,并开发了一个用于学习最终图结构的目标,从而实现了最大似然训练。通过在一般图和2D/3D分子生成任务上的广泛实验验证,我们表明我们的方法优于以前的生成模型,能够生成具有正确拓扑以及连续(例如3D坐标)和离散(例如原子类型)特征的图。我们的代码可在 https://github.com/harryjo97/GruM 获取。

英文摘要:

Generation of graphs is a major challenge for real-world tasks that require understanding the complex nature of their non-Euclidean structures. Although diffusion models have achieved notable success in graph generation recently, they are ill-suited for modeling the topological properties of graphs since learning to denoise the noisy samples does not explicitly learn the graph structures to be generated. To tackle this limitation, we propose a generative framework that models the topology of graphs by explicitly learning the final graph structures of the diffusion process. Specifically, we design the generative process as a mixture of endpoint-conditioned diffusion processes which is driven toward the predicted graph that results in rapid convergence. We further introduce a simple parameterization of the mixture process and develop an objective for learning the final graph structure, which enables maximum likelihood training. Through extensive experimental validation on general graph and 2D/3D molecule generation tasks, we show that our method outperforms previous generative models, generating graphs with correct topology with both continuous (e.g. 3D coordinates) and discrete (e.g. atom types) features. Our code is available at https://github.com/harryjo97/GruM.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑