Conditional Diffusion Based on Discrete Graph Structures for Molecular Graph Generation
원문 초록
Learning the underlying distribution of molecular graphs and generating high-fidelity samples is a fundamental research problem in drug discovery and material science. However, accurately modeling distribution and rapidly generating novel molecular graphs remain crucial and challenging goals. To accomplish these goals, we propose a novel Conditional Diffusion model based on discrete Graph Structures (CDGS) for molecular graph generation. Specifically, we construct a forward graph diffusion process on both graph structures and inherent features through stochastic differential equations (SDE) and derive discrete graph structures as the condition for reverse generative processes. We present a specialized hybrid graph noise prediction model that extracts the global context and the local node-edge dependency from intermediate graph states. We further utilize ordinary differential equation (ODE) solvers for efficient graph sampling, based on the semi-linear structure of the probability flow ODE. Experiments on diverse datasets validate the effectiveness of our framework. Particularly, the proposed method still generates high-quality molecular graphs in a limited number of steps. Our code is provided in https://github.com/GRAPH-0/CDGS.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
FragFM: Hierarchical Framework for Efficient Molecule Generation via Fragment-Level Discrete Flow Matching
Bures-Wasserstein Flow Matching for Graph Generation
Pretraining Generative Flow Networks with Inexpensive Rewards for Molecular Graph Generation
Backdoor Attacks on Discrete Graph Diffusion Models
Learning-Order Autoregressive Models with Application to Molecular Graph Generation
Flatten Graphs as Sequences: Transformers are Scalable Graph Generators
토론
이 논문과 연결된 포럼 글이 아직 없습니다.