Genetic algorithms are strong baselines for molecule generation

• URL: http://arxiv.org/abs/2310.09267v1
• Date: Fri, 13 Oct 2023 17:25:11 GMT
• Title: Genetic algorithms are strong baselines for molecule generation
• Authors: Austin Tripp, Jos\'e Miguel Hern\'andez-Lobato
• Abstract summary: Genetic algorithms (GAs) generate molecules by randomly modifying known molecules. In this paper we show that GAs are very strong algorithms for such tasks, outperforming many complicated machine learning methods.
• Score: 3.0832873002777785
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Generating molecules, both in a directed and undirected fashion, is a huge part of the drug discovery pipeline. Genetic algorithms (GAs) generate molecules by randomly modifying known molecules. In this paper we show that GAs are very strong algorithms for such tasks, outperforming many complicated machine learning methods: a result which many researchers may find surprising. We therefore propose insisting during peer review that new algorithms must have some clear advantage over GAs, which we call the GA criterion. Ultimately our work suggests that a lot of research in molecule generation should be re-assessed.

Related papers

• Curiosity as a Self-Supervised Method to Improve Exploration in De novo Drug Design [0.276240219662896]
  We introduce a curiosity-driven method to force the model to navigate many parts of the chemical space. At first, we train a recurrent neural network-based general molecular generator (G), then we fine-tune G to maximize curiosity and desirability. We benchmarked our approach against two desirable chemical properties related to drug-likeness and showed that the discovered chemical space can be significantly expanded.
  arXiv  Detail & Related papers  (2023-09-24T06:44:51Z)
• Towards Predicting Equilibrium Distributions for Molecular Systems with Deep Learning [60.02391969049972]
  We introduce a novel deep learning framework, called Distributional Graphormer (DiG), in an attempt to predict the equilibrium distribution of molecular systems. DiG employs deep neural networks to transform a simple distribution towards the equilibrium distribution, conditioned on a descriptor of a molecular system.
  arXiv  Detail & Related papers  (2023-06-08T17:12:08Z)
• MolCPT: Molecule Continuous Prompt Tuning to Generalize Molecular Representation Learning [77.31492888819935]
  We propose a novel paradigm of "pre-train, prompt, fine-tune" for molecular representation learning, named molecule continuous prompt tuning (MolCPT) MolCPT defines a motif prompting function that uses the pre-trained model to project the standalone input into an expressive prompt. Experiments on several benchmark datasets show that MolCPT efficiently generalizes pre-trained GNNs for molecular property prediction.
  arXiv  Detail & Related papers  (2022-12-20T19:32:30Z)
• Retrieval-based Controllable Molecule Generation [63.44583084888342]
  We propose a new retrieval-based framework for controllable molecule generation. We use a small set of molecules to steer the pre-trained generative model towards synthesizing molecules that satisfy the given design criteria. Our approach is agnostic to the choice of generative models and requires no task-specific fine-tuning.
  arXiv  Detail & Related papers  (2022-08-23T17:01:16Z)
• Genetic Algorithm for Constrained Molecular Inverse Design [0.1086166673827221]
  We introduce a genetic algorithm featuring a constrained molecular inverse design. The proposed algorithm successfully produces valid molecules for crossover and mutation. Experiments prove that our algorithm effectively finds molecules that satisfy specific properties while maintaining structural constraints.
  arXiv  Detail & Related papers  (2021-12-07T05:58:44Z)
• Improving RNA Secondary Structure Design using Deep Reinforcement Learning [69.63971634605797]
  We propose a new benchmark of applying reinforcement learning to RNA sequence design, in which the objective function is defined to be the free energy in the sequence's secondary structure. We show results of the ablation analysis that we do for these algorithms, as well as graphs indicating the algorithm's performance across batches.
  arXiv  Detail & Related papers  (2021-11-05T02:54:06Z)
• Goal directed molecule generation using Monte Carlo Tree Search [15.462930062711237]
  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.
  arXiv  Detail & Related papers  (2020-10-30T17:49:59Z)
• A summary of the prevalence of Genetic Algorithms in Bioinformatics from 2015 onwards [0.0]
  Genetic algorithms rarely form a full application, instead they rely on other vital algorithms such as support vector machines. Population-based searches, like GA, are often combined with other machine learning algorithms. The future of genetic algorithms could be open-ended evolutionary algorithms, which attempt to increase complexity and find diverse solutions.
  arXiv  Detail & Related papers  (2020-08-20T15:15:43Z)
• Guiding Deep Molecular Optimization with Genetic Exploration [79.50698140997726]
  We propose genetic expert-guided learning (GEGL), a framework for training a deep neural network (DNN) to generate highly-rewarding molecules. Extensive experiments show that GEGL significantly improves over state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-07-04T05:01:26Z)
• Self-Supervised Graph Transformer on Large-Scale Molecular Data [73.3448373618865]
  We propose a novel framework, GROVER, for molecular representation learning. GROVER can learn rich structural and semantic information of molecules from enormous unlabelled molecular data. We pre-train GROVER with 100 million parameters on 10 million unlabelled molecules -- the biggest GNN and the largest training dataset in molecular representation learning.
  arXiv  Detail & Related papers  (2020-06-18T08:37:04Z)
• Using Genetic Algorithm To Evolve Cellular Automata In Performing Edge Detection [0.0]
  We have made an effort to perform edge detection on an image using genetic algorithm. We have tried to evolve the cellular automata and shown that how with time it converges to the desired results.
  arXiv  Detail & Related papers  (2020-05-13T04:07:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.