Neural-Network-Biased Genetic Algorithms for Materials Design: Evolutionary Algorithms That Learn
The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Machine learning has the potential to dramatically accelerate high-throughput approaches to materials design, as demonstrated by successes in biomolecular design and hard materials design. However, in the search for new soft materials exhibiting properties and performance beyond those previously achieved, machine learning approaches are frequently limited by two shortcomings. First, because they are intrinsically interpolative, they are better suited to the optimization of properties within the known range of accessible behavior than to the discovery of new materials with extremal behavior. Second, they require large pre-existing data sets, which are frequently unavailable and prohibitively expensive to produce. Here we describe a new strategy, the neural-network-biased genetic algorithm (NBGA), for combining genetic algorithms, machine learning, and high-throughput computation or experiment to discover materials with extremal properties in the absence of pre-existing data. Within this strategy, predictions from a progressively constructed artificial neural network are employed to bias the evolution of a genetic algorithm, with fitness evaluations performed via direct simulation or experiment. In effect, this strategy gives the evolutionary algorithm the ability to "learn" and draw inferences from its experience to accelerate the evolutionary process. We test this algorithm against several standard optimization problems and polymer design problems and demonstrate that it matches and typically exceeds the efficiency and reproducibility of standard approaches including a direct-evaluation genetic algorithm and a neural-network-evaluated genetic algorithm. The success of this algorithm in a range of test problems indicates that the NBGA provides a robust strategy for employing informatics-accelerated high-throughput methods to accelerate materials design in the absence of pre-existing data.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
The high-throughput highway to computational materials design
Curtarolo, S., Hart, G. L. W., Nardelli, M. B., Mingo, N., Sanvito, S., & Levy, O. (2013) · Nature Materials · doi:10.1038/nmat3568 · Cited by 2,053
Machine learning phases of matter
Carrasquilla, J., & Melko, R. G. (2017) · Nature Physics · doi:10.1038/nphys4035 · Cited by 1,448
Rojas, R. (1996) · doi:10.1007/978-3-642-61068-4 · Cited by 810
Discovering phase transitions with unsupervised learning
Wang, L. (2016) · Physical Review B · doi:10.1103/physrevb.94.195105 · Cited by 618
Compatibilizers for melt blending: premade block copolymers
Macosko, C. W., Guégan, P., Khandpur, A. K., Nakayama, A., Marechal, P., & Inoue, T. (1996) · Macromolecules · doi:10.1021/ma9602482 · Cited by 458
Discovery and Optimization of Materials Using Evolutionary Approaches
Le, T. C., & Winkler, D. A. (2016) · Chemical Reviews · doi:10.1021/acs.chemrev.5b00691 · Cited by 204
Umegaki, T., Watanabe, Y., Nukui, N., Omata, K., & Yamada, M. (2003) · Energy & Fuels · doi:10.1021/ef020241n · Cited by 34
Cited by
From DFT to machine learning: recent approaches to materials science–a review
Schleder, G. R., Padilha, A. C. M., Acosta, C. M., Costa, M., & Fazzio, A. (2019) · Journal of Physics: Materials · doi:10.1088/2515-7639/ab084b · Cited by 852
Modeling and Simulations of Polymers: A Roadmap
Gartner, T. E., & Jayaraman, A. (2019) · Macromolecules · doi:10.1021/acs.macromol.8b01836 · Cited by 548
Crystal Structure Prediction via Deep Learning
Ryan, K., Lengyel, J., & Shatruk, M. (2018) · Journal of the American Chemical Society · doi:10.1021/jacs.8b03913 · Cited by 355
Machine learning-driven new material discovery
Cai, J., Chu, X., Xu, K., Li, H., & Wei, J. (2020) · Nanoscale Advances · doi:10.1039/d0na00388c · Cited by 296
Genetic algorithms for computational materials discovery accelerated by machine learning
Jennings, P. C., Lysgaard, S., Hummelshøj, J. S., Vegge, T., & Bligaard, T. (2019) · npj Computational Materials · doi:10.1038/s41524-019-0181-4 · Cited by 269
Metadata
- Authors
- Patra, T. K., Meenakshisundaram, V., Hung, J.-H., & Simmons, D. S.
- Venue
- ACS Combinatorial Science
- Publisher
- American Chemical Society (ACS)
- Published
- 2017-01-09
- Volume
- 19
- Issue
- 2
- Pages
- 96-107
- ISSN
- 2156-8944 (ISSN-L)
- 2156-8952
- OpenAlex
- W2561003326
- Cited by
- 127
- References
- 8
- FWCI
- 3.93
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Neural-Network-Biased Genetic Algorithms for Materials Design: Evolutionary Algorithms That Learn. https://app.cochat.ai/papers/10.1021/acscombsci.6b00136
- The paper
- Patra, T. K., Meenakshisundaram, V., Hung, J.-H., & Simmons, D. S. (2017). Neural-Network-Biased Genetic Algorithms for Materials Design: Evolutionary Algorithms That Learn. ACS Combinatorial Science. https://doi.org/10.1021/acscombsci.6b00136
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.