14 papers · ranked by Valyu relevance
Brianna Greenstein, Danielle Elsey, Geoffrey Hutchison
Genetic algorithms (GAs) are a powerful tool to search large chemical spaces for inverse molecular design. However, GAs have multiple hyperparameters that have not been thoroughly investigated for chemical space searches. In this work, we examine the general effects of a number of hyperparameters, such as population…
Jonas Verhellen
Computer-assisted design of small molecules has experienced a resurgence in academic and indus- trial interest due to the widespread use of data-driven techniques such as deep generative models. While the ability to generate molecules that fulfill required chemical properties is encouraging, the use of deep learning…
Justin Villard, Murat Kılıç, Ursula Rothlisberger
Identification of the most stable structure(s) of a system is a prerequisite for the calculation of any of its properties from first-principles. However, even for relatively small molecules, exhaustive explorations of the potential energy surface (PES) are severely hampered by the dimensionality bottleneck. In this…
Omri Abarbanel, Geoffrey Hutchison
Stable ground-state triplet π-conjugated copolymers have many interesting electronic and optoelectronic properties. However, the large number of potential monomer combinations makes it impractical to synthesize or even just use density functional theory (DFT) to calculate their triplet ground-state stability. Here, we…
Authors not listed
Finding the most stable adsorption geometry of a flexible molecule on a catalytic surface remains a key challenge due to the high dimensionality and ruggedness of the potential energy surface. We present a Gradient-Enhanced Genetic Algorithm (GE-GA) for the global optimization of adsorbate–surface configurations…
Authors not listed
Deep neural networks have become popular model architectures for fitting coarse-grained molecular dynamics potentials (CGMD) owing to their ability to describe complex features and ease of training against large datasets. However, such architectures are much more complicated than traditional functional forms. This…
Authors not listed
More sustainable chemical processes require the selection of suitable molecules, which can be supported by computer-aided molecular design (CAMD). CAMD often generates and evaluates molecular structures using genetic algorithms. However, genetic algorithms can suffer from slow convergence, and might yield suboptimal…
Authors not listed
Genetic Algorithms are a powerful method to solve optimization problems with complex cost functions over vast search spaces that rely in particular on recombining parts of previous solutions. Crossover operators play a crucial role in this context. Here, we describe a large class of these operators designed for…
Emilie S. Henault, Maria Harris Rasmussen, Jan H. Jensen
We attempt to explain why search algorithms can find molecules with particular properties in an enormous chemical space (ca 10 60 molecules) by considering only a tiny subset (typically 10 3−6 molecules). Using a very simple example, we show that the number of potential paths that the search algorithms can follow to…
Jan H. Jensen
This paper presents a comparison of a graph-based genetic algorithm (GB-GA) and machine learning (ML) results for the optimisation of logP values with a constraint for synthetic accessibility and shows that GA is as good or better than the ML approaches for this particular property. The molecules found by GB-GA bear…
Steen Lysgaard, Paul C. Jennings, Jens Strabo Hummelshøj, Thomas Bligaard + 1 more
A machine learning model is used as a surrogate fitness evaluator in a genetic algorithm (GA) optimization of the atomic distribution of Pt-Au nanoparticles. The machine learning accelerated genetic algorithm (MLaGA) yields a 50-fold reduction of required energy calculations compared to a traditional GA.
Steen Lysgaard, Paul C. Jennings, Jens Strabo Hummelshøj, Thomas Bligaard + 1 more
A machine learning (ML) model is trained on-the-fly as a computationally inexpensive energy predictor before analyzing how to augment convergence in Genetic Algorithm (GA)-based approaches by using the ML model as a surrogate. This leads to a machine learning accelerated genetic algorithm (MLaGA) combining robust…
Casper Steinmann, Jan H. Jensen
A graph-based genetic algorithm (GA) is used to identify molecules (ligands) with high absolute docking scores as estimated by the Glide software, starting from randomly chosen molecules from the ZINC database, for four different targets: Bacillus subtilis chorismate mutase (CM), human β 2 -adrenergic G protein-coupled…
Andre KY Low, Flore Mekki-Berrada, Aleksandr Ostudin, Jiaxun Xie + 7 more
The development of automated high-throughput experimental platforms has enabled fast sampling of high-dimensional decision spaces. To reach target properties efficiently, these platforms are increasingly paired with intelligent experimental design. When solving optimization problems, Bayesian-based optimizers are often…