MoFlow: An Invertible Flow Model for Generating Molecular Graphs
Authors:
Top Cited Papers
Open Access
- 20 August 2020
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 617-626
Abstract
Generating molecular graphs with desired chemical properties driven by deep graph generative models provides a very promising way to accelerate drug discovery process. Such graph generative models usually consist of two steps: learning latent representations and generation of molecular graphs. However, to generate novel and chemically-valid molecular graphs from latent representations is very challenging because of the chemical constraints and combinatorial complexity of molecular graphs. In this paper, we propose MoFlow, a flow-based graph generative model to learn invertible mappings between molecular graphs and their latent representations. To generate molecular graphs, our MoFlow first generates bonds (edges) through a Glow based model, then generates atoms (nodes) given bonds by a novel graph conditional flow, and finally assembles them into a chemically valid molecular graph with a posthoc validity correction. Our MoFlow has merits including exact and tractable likelihood training, efficient one-pass embedding and generation, chemical validity guarantees, 100% reconstruction of training data, and good generalization ability. We validate our model by four tasks: molecular graph generation and reconstruction, visualization of the continuous latent space, property optimization, and constrained property optimization. Our MoFlow achieves state-of-the-art performance, which implies its potential efficiency and effectiveness to explore large chemical space for drug discovery.Keywords
All Related Versions
Funding Information
- NSF IIS (1716432 1750326)
- ONR (N00014-18-1-2585)
- Amazon Web Service (AWS) Machine Learning for Research Award
- Google Faculty Research Award
This publication has 9 references indexed in Scilit:
- Deep learning enables rapid identification of potent DDR1 kinase inhibitorsNature Biotechnology, 2019
- GraphVAE: Towards Generation of Small Graphs Using Variational Autoencoders2018
- Modeling Relational Data with Graph Convolutional Networks2018
- The drug-maker's guide to the galaxyNature, 2017
- Why is Tanimoto index an appropriate choice for fingerprint-based similarity calculations?Journal of Cheminformatics, 2015
- The $2.6 Billion Pill — Methodologic and Policy ConsiderationsNew England Journal of Medicine, 2015
- ZINC: A Free Tool to Discover Chemistry for BiologyJournal of Chemical Information and Modeling, 2012
- Extended-Connectivity FingerprintsJournal of Chemical Information and Modeling, 2010
- SMILES. 2. Algorithm for generation of unique SMILES notationJournal of Chemical Information and Computer Sciences, 1989