Molecule Generation by Principal Subgraph Mining and Assembling
원문 초록
Molecule generation is central to a variety of applications. Current attention has been paid to approaching the generation task as subgraph prediction and assembling. Nevertheless, these methods usually rely on hand-crafted or external subgraph construction, and the subgraph assembling depends solely on local arrangement. In this paper, we define a novel notion, principal subgraph, that is closely related to the informative pattern within molecules. Interestingly, our proposed merge-and-update subgraph extraction method can automatically discover frequent principal subgraphs from the dataset, while previous methods are incapable of. Moreover, we develop a two-step subgraph assembling strategy, which first predicts a set of subgraphs in a sequence-wise manner and then assembles all generated subgraphs globally as the final output molecule. Built upon graph variational auto-encoder, our model is demonstrated to be effective in terms of several evaluation metrics and efficiency, compared with state-of-the-art methods on distribution learning and (constrained) property optimization tasks.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.