MolGrow: A Graph Normalizing Flow for Hierarchical Molecular Generation
We propose a hierarchical normalizing flow model for generating molecular graphs. The model produces new molecular structures from a single-node graph by recursively splitting every node into two. All operations are invertible and can be used as plug-and-play modules. The hierarchical nature of the latent codes allows for precise changes in the resulting graph: perturbations in the top layer cause global structural changes, while perturbations in the consequent layers change the resulting molecule marginally. The proposed model outperforms existing generative graph models on the distribution learning task. We also show successful experiments on global and constrained optimization of chemical properties using latent codes of the model.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
MolHF: A Hierarchical Normalizing Flow for Molecular Graph Generation
Molecular de novo design is a critical yet challenging task in scientific fields, aiming to design novel molecular structures with desired property profiles. Significant progress has been made by resorting to generative …
Graph GenerationMolecular Graph GenerationRepresentation LearningGraphNVP: An Invertible Flow Model for Generating Molecular Graphs
We propose GraphNVP, the first invertible, normalizing flow-based molecular graph generation model. We decompose the generation of a graph into two steps: generation of (i) an adjacency tensor and (ii) node attributes. T…
Graph GenerationMolecular Graph GenerationvalidSemi-Equivariant Conditional Normalizing Flows
We study the problem of learning conditional distributions of the form $p(G | \hat G)$, where $G$ and $\hat G$ are two 3D graphs, using continuous normalizing flows. We derive a semi-equivariance condition on the flow wh…
Latent Variable Modelling with Hyperbolic Normalizing Flows
The choice of approximate posterior distributions plays a central role in stochastic variational inference (SVI). One effective solution is the use of normalizing flows \cut{defined on Euclidean spaces} to construct flex…
Density EstimationVariational InferenceGraphDF: A Discrete Flow Model for Molecular Graph Generation
We consider the problem of molecular graph generation using deep models. While graphs are discrete, most existing methods use continuous latent variables, resulting in inaccurate modeling of discrete graph structures. In…
Graph GenerationMolecular Graph Generation