arrow
返回

Automating Genetic Algorithm Mutations for Molecules Using a Masked Language Model

delete2022-08-01
delete13
delete
OA
AI
A
Andrew E. Blanchard *
S
Shekar, Mayanka Chandra
S
Shang Gao
J
John Gounley
I
Isaac Lyngaas
J
Jens Gläser
D
Debsindhu Bhowmik
DOI:10.1109/TEVC.2022.3144045delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Inspired by the evolution of biological systems, genetic algorithms have been applied to generate solutions for optimization problems in a variety of scientific and engineering disciplines. For a given problem, a suitable genome representation must be defined along with a mutation operator to generate subsequent generations. Unlike natural systems, which display a variety of complex rearrangements (e.g., mobile genetic elements), mutation for genetic algorithms commonly utilizes only random pointwise changes. Furthermore, generalizing beyond pointwise mutations poses a key difficulty as useful genome rearrangements depend on the representation and problem domain. To move beyond the limitations of manually defined pointwise changes, here we propose the use of techniques from masked language models to automatically generate mutations. As a first step, common subsequences within a given population are used to generate a vocabulary. The vocabulary is then used to tokenize each genome. A masked language model is trained on the tokenized data in order to generate possible rearrangements (i.e., mutations). In order to illustrate the proposed strategy, we use string representations of molecules and use a genetic algorithm to optimize for drug-likeness and synthesizability. Our results show that moving beyond random pointwise mutations accelerates genetic algorithm optimization.
Keyword:
Genetic algorithms
Vocabulary
Training
Predictive models
Optimization
Tokenization
Bit error rate
Artificial intelligence
bioinformatics
genetic algorithms
machine learning

期刊

IEEE Transactions on Evolutionary Computation 封面图
IEEE Transactions on Evolutionary Computation
IF:
12
论文数:
1.9K
被引数:
2.4W

机构

U
united states department of energy (doe)
学者数:
11.3W
论文数: 9.6W
被引数: 246
O
oak ridge national laboratory
学者数:
1.5W
论文数: 1.0W
被引数: 20
引用论文

引用论文

Randomized SMILES strings improve the quality of molecular generative models随机微笑字符串提高了分子生成模型的质量
err2019-11-21
err210
errOAAI
errArus-Pous, Josep; Johansson, Simon Viet; Prykhodko, Oleksii; Bjerrum, Esben Jannik; Tyrchan, Christian; Reymond, Jean-Louis; Chen, Hongming; Engkvist, Ola
err分享
err收藏
Bidirectional Molecule Generation with Recurrent Neural Networks
err2020-01-06
err124
errOAAI
errGrisoni, Francesca; Moret, Michael; Lingwood, Robin; Schneider, Gisbert
err分享
err收藏
学者 查看更多内容