计算机科学
图形
可微函数
理论计算机科学
强化学习
人工智能
数学
数学分析
作者
Jiaxuan You,Bowen Liu,Rex Ying,Vijay S. Pande,Jure Leskovec
出处
期刊:Cornell University - arXiv
日期:2018-06-06
被引量:441
标识
DOI:10.48550/arxiv.1806.02473
摘要
Generating novel graph structures that optimize given objectives while\nobeying some given underlying rules is fundamental for chemistry, biology and\nsocial science research. This is especially important in the task of molecular\ngraph generation, whose goal is to discover novel molecules with desired\nproperties such as drug-likeness and synthetic accessibility, while obeying\nphysical laws such as chemical valency. However, designing models to find\nmolecules that optimize desired properties while incorporating highly complex\nand non-differentiable rules remains to be a challenging task. Here we propose\nGraph Convolutional Policy Network (GCPN), a general graph convolutional\nnetwork based model for goal-directed graph generation through reinforcement\nlearning. The model is trained to optimize domain-specific rewards and\nadversarial loss through policy gradient, and acts in an environment that\nincorporates domain-specific rules. Experimental results show that GCPN can\nachieve 61% improvement on chemical property optimization over state-of-the-art\nbaselines while resembling known molecules, and achieve 184% improvement on the\nconstrained property optimization task.\n
科研通智能强力驱动
Strongly Powered by AbleSci AI