Goal directed molecule generation using Monte Carlo Tree Search

2020-10-30 · Anand A. Rajasekar, Karthik Raman, Balaraman Ravindran

One challenging and essential task in biochemistry is the generation of novel molecules with desired properties. Novel molecule generation remains a challenge since the molecule space is difficult to navigate through, and the generated molecules should obey the rules of chemical valency. Through this work, we propose a novel method, which we call unitMCTS, to perform molecule generation by making a unit change to the molecule at every step using Monte Carlo Tree Search. We show that this method outperforms the recently published techniques on benchmark molecular optimization tasks such as QED and penalized logP. We also demonstrate the usefulness of this method in improving molecule properties while being similar to the starting molecule. Given that there is no learning involved, our method finds desired molecules within a shorter amount of time.

📄 PDF Abstract BibTeX arXiv:2010.16399

Code (0)

등록된 구현이 없습니다.

Tasks

Navigate

Goal-directed Generation of Discrete Structures with Conditional Generative Models

2020-10-05 · NeurIPS 2020 12 · Amina Mollaysa, Brooks Paige, Alexandros Kalousis

Despite recent advances, goal-directed generation of structured discrete data remains challenging. For problems such as program synthesis (generating source code) and materials design (generating molecules), finding exam…

Heuristic Search Program Synthesis reinforcement-learning Reinforcement Learning+1

Monte Carlo Inverse Folding

2020-05-20 · Tristan Cazenave, Thomas Fournier

The RNA Inverse Folding problem comes from computational biology. The goal is to find a molecule that has a given folding. It is important for scientific fields such as bioengineering, pharmaceutical research, biochemist…

Divide-and-Conquer Monte Carlo Tree Search For Goal-Directed Planning

2020-04-23 · Giambattista Parascandolo, Lars Buesing, Josh Merel, Leonard Hasenclever 외

Standard planners for sequential decision making (including Monte Carlo planning, tree search, dynamic programming, etc.) are constrained by an implicit sequential planning assumption: The order in which a plan is constr…

continuous-control Continuous Control Decision Making Reinforcement Learning+2

Divide-and-Conquer Monte Carlo Tree Search

2021-01-01 · Giambattista Parascandolo, Lars Holger Buesing, Josh Merel, Leonard Hasenclever 외

continuous-control Continuous Control Decision Making Reinforcement Learning (RL)+1

Goal-Directed Planning via Hindsight Experience Replay

2021-09-29 · ICLR 2022 4 · Lorenzo Moro, Amarildo Likmeta, Enrico Prati, Marcello Restelli

We consider the problem of goal-directed planning under a deterministic transition model. Monte Carlo Tree Search has shown remarkable performance in solving deterministic control problems. It has been extended from comp…