Improving Molecular Graph Generation with Flow Matching and Optimal Transport
원문 초록
Generating molecular graphs is crucial in drug design and discovery but remains challenging due to the complex interdependencies between nodes and edges. While diffusion models have demonstrated their potentiality in molecular graph design, they often suffer from unstable training and inefficient sampling. To enhance generation performance and training stability, we propose GGFlow, a discrete flow matching generative model incorporating optimal transport for molecular graphs and it incorporates an edge-augmented graph transformer to enable the direct communications among chemical bounds. Additionally, GGFlow introduces a novel goal-guided generation framework to control the generative trajectory of our model, aiming to design novel molecular structures with the desired properties. GGFlow demonstrates superior performance on both unconditional and conditional molecule generation tasks, outperforming existing baselines and underscoring its effectiveness and potential for wider application.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Pretraining Generative Flow Networks with Inexpensive Rewards for Molecular Graph Generation
Multimodal Large Language Models for Inverse Molecular Design with Retrosynthetic Planning
Instruction-Based Molecular Graph Generation with Unified Text-Graph Diffusion Model
Learning-Order Autoregressive Models with Application to Molecular Graph Generation
FragFM: Hierarchical Framework for Efficient Molecule Generation via Fragment-Level Discrete Flow Matching
Flatten Graphs as Sequences: Transformers are Scalable Graph Generators
토론
이 논문과 연결된 포럼 글이 아직 없습니다.