Cargando…

Efficient learning of non-autoregressive graph variational autoencoders for molecular graph generation

With the advancements in deep learning, deep generative models combined with graph neural networks have been successfully employed for data-driven molecular graph generation. Early methods based on the non-autoregressive approach have been effective in generating molecular graphs quickly and efficie...

Descripción completa

Detalles Bibliográficos
Autores principales: Kwon, Youngchun, Yoo, Jiho, Choi, Youn-Suk, Son, Won-Joon, Lee, Dongseon, Kang, Seokho
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer International Publishing 2019
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6873411/
https://www.ncbi.nlm.nih.gov/pubmed/33430985
http://dx.doi.org/10.1186/s13321-019-0396-x
_version_ 1783472645774245888
author Kwon, Youngchun
Yoo, Jiho
Choi, Youn-Suk
Son, Won-Joon
Lee, Dongseon
Kang, Seokho
author_facet Kwon, Youngchun
Yoo, Jiho
Choi, Youn-Suk
Son, Won-Joon
Lee, Dongseon
Kang, Seokho
author_sort Kwon, Youngchun
collection PubMed
description With the advancements in deep learning, deep generative models combined with graph neural networks have been successfully employed for data-driven molecular graph generation. Early methods based on the non-autoregressive approach have been effective in generating molecular graphs quickly and efficiently but have suffered from low performance. In this paper, we present an improved learning method involving a graph variational autoencoder for efficient molecular graph generation in a non-autoregressive manner. We introduce three additional learning objectives and incorporate them into the training of the model: approximate graph matching, reinforcement learning, and auxiliary property prediction. We demonstrate the effectiveness of the proposed method by evaluating it for molecular graph generation tasks using QM9 and ZINC datasets. The model generates molecular graphs with high chemical validity and diversity compared with existing non-autoregressive methods. It can also conditionally generate molecular graphs satisfying various target conditions.
format Online
Article
Text
id pubmed-6873411
institution National Center for Biotechnology Information
language English
publishDate 2019
publisher Springer International Publishing
record_format MEDLINE/PubMed
spelling pubmed-68734112019-11-25 Efficient learning of non-autoregressive graph variational autoencoders for molecular graph generation Kwon, Youngchun Yoo, Jiho Choi, Youn-Suk Son, Won-Joon Lee, Dongseon Kang, Seokho J Cheminform Research Article With the advancements in deep learning, deep generative models combined with graph neural networks have been successfully employed for data-driven molecular graph generation. Early methods based on the non-autoregressive approach have been effective in generating molecular graphs quickly and efficiently but have suffered from low performance. In this paper, we present an improved learning method involving a graph variational autoencoder for efficient molecular graph generation in a non-autoregressive manner. We introduce three additional learning objectives and incorporate them into the training of the model: approximate graph matching, reinforcement learning, and auxiliary property prediction. We demonstrate the effectiveness of the proposed method by evaluating it for molecular graph generation tasks using QM9 and ZINC datasets. The model generates molecular graphs with high chemical validity and diversity compared with existing non-autoregressive methods. It can also conditionally generate molecular graphs satisfying various target conditions. Springer International Publishing 2019-11-21 /pmc/articles/PMC6873411/ /pubmed/33430985 http://dx.doi.org/10.1186/s13321-019-0396-x Text en © The Author(s) 2019 Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
spellingShingle Research Article
Kwon, Youngchun
Yoo, Jiho
Choi, Youn-Suk
Son, Won-Joon
Lee, Dongseon
Kang, Seokho
Efficient learning of non-autoregressive graph variational autoencoders for molecular graph generation
title Efficient learning of non-autoregressive graph variational autoencoders for molecular graph generation
title_full Efficient learning of non-autoregressive graph variational autoencoders for molecular graph generation
title_fullStr Efficient learning of non-autoregressive graph variational autoencoders for molecular graph generation
title_full_unstemmed Efficient learning of non-autoregressive graph variational autoencoders for molecular graph generation
title_short Efficient learning of non-autoregressive graph variational autoencoders for molecular graph generation
title_sort efficient learning of non-autoregressive graph variational autoencoders for molecular graph generation
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6873411/
https://www.ncbi.nlm.nih.gov/pubmed/33430985
http://dx.doi.org/10.1186/s13321-019-0396-x
work_keys_str_mv AT kwonyoungchun efficientlearningofnonautoregressivegraphvariationalautoencodersformoleculargraphgeneration
AT yoojiho efficientlearningofnonautoregressivegraphvariationalautoencodersformoleculargraphgeneration
AT choiyounsuk efficientlearningofnonautoregressivegraphvariationalautoencodersformoleculargraphgeneration
AT sonwonjoon efficientlearningofnonautoregressivegraphvariationalautoencodersformoleculargraphgeneration
AT leedongseon efficientlearningofnonautoregressivegraphvariationalautoencodersformoleculargraphgeneration
AT kangseokho efficientlearningofnonautoregressivegraphvariationalautoencodersformoleculargraphgeneration