DEFactor: Differentiable Edge Factorization-based Probabilistic Graph Generation
원문 초록
Generating novel molecules with optimal properties is a crucial step in many industries such as drug discovery. Recently, deep generative models have shown a promising way of performing de-novo molecular design. Although graph generative models are currently available they either have a graph size dependency in their number of parameters, limiting their use to only very small graphs or are formulated as a sequence of discrete actions needed to construct a graph, making the output graph non-differentiable w.r.t the model parameters, therefore preventing them to be used in scenarios such as conditional graph generation. In this work we propose a model for conditional graph generation that is computationally efficient and enables direct optimisation of the graph. We demonstrate favourable performance of our model on prototype-based molecular graph conditional generation tasks.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Bures-Wasserstein Flow Matching for Graph Generation
Backdoor Attacks on Discrete Graph Diffusion Models
FragFM: Hierarchical Framework for Efficient Molecule Generation via Fragment-Level Discrete Flow Matching
B-XAIC Dataset: Benchmarking Explainable AI for Graph Neural Networks Using Chemical Data
Assay2Mol: large language model-based drug design using BioAssay context
PocketVina Enables Scalable and Highly Accurate Physically Valid Docking through Multi-Pocket Conditioning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.