Evidence map›Paper›PMID 37824704›Full record

ArticleJournal of chemical information and modeling2023

Cluster-MLP: An Active Learning Genetic Algorithm Framework for Accelerated Discovery of Global Minimum Configurations of Pure and Alloyed Nanoclusters.

Rajesh K Raju, Saurabh Sivakumar, Xiaoxiao Wang, Zachary W Ulissi

Abstract read
In one paragraph

Article in Journal of chemical information and modeling, 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 8 papers.

0numbers the graph read from it
0cells of the map it votes in
8citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

8 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Review
  5. Review
  6. Article
  7. Article
  8. Mlp4green: A Binary Classification Approach Specifically for Green Odor.International journal of molecular sciences · 2024
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Rajesh K RajuChemical Engineering Department, Carnegie Mellon University, Pittsburgh, Pennsylvania 15217, United States.ORCID 0000-0002-0030-3242
Saurabh SivakumarChemical Engineering Department, Carnegie Mellon University, Pittsburgh, Pennsylvania 15217, United States.
Xiaoxiao WangChemical Engineering Department, Carnegie Mellon University, Pittsburgh, Pennsylvania 15217, United States.
Zachary W UlissiChemical Engineering Department, Carnegie Mellon University, Pittsburgh, Pennsylvania 15217, United States.ORCID 0000-0002-9401-4918

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Structural characterization of nanoclusters is one of the major challenges in nanocluster modeling owing to the multitude of possible configurations of arrangement of cluster atoms. The genetic algorithm (GA), a class of evolutionary algorithms based on the principles of natural evolution, is a commonly employed search method for locating the global minimum configuration of nanoclusters. Although a GA search at the DFT level is required for the accurate description of a potential energy surface to arrive at the correct global minimum configuration of nanoclusters, computationally expensive DFT evaluation of the significantly larger number of cluster geometries limits its practicability. Recently, machine learning potentials (MLP) that are learned from DFT calculations gained significant attention as computationally cheap alternative options that provide DFT level accuracy. As the accuracy of the MLP predictions is dependent on the quality and quantity of the training DFT data, active learning (AL) strategies have gained significant momentum to bypass the need of large and representative training data. In this application note, we present Cluster-MLP, an on-the-fly active learning genetic algorithm framework that employs the Flare++ machine learning potential (MLP) for accelerating the GA search for global minima of pure and alloyed nanoclusters. We have used a modified version the Birmingham parallel genetic algorithm (BPGA) for the nanocluster GA search which is then incorporated into distributed evolutionary algorithms in Python (DEAP), an evolutionary computational framework for fast prototyping or technical experiments. We have shown that the incorporation of the AL framework in the BPGA significantly reduced the computationally expensive DFT calculations. Moreover, we have shown that both the AL-GA and DFT-GA predict the same global minima for all the clusters we tested.

Indexed as

AlgorithmsAlloysDensity Functional TheoryMachine LearningAlloys

Identifiers

PMID37824704
PMCPMC10598790

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.