Evidence map›Paper›PMID 32493911›Full record

ArticleScientific reports2020

Efficient Closed-loop Maximization of Carbon Nanotube Growth Rate using Bayesian Optimization.

Jorge Chang, Pavel Nikolaev, Jennifer Carpena-Núñez, Rahul Rao, Kevin Decker, Ahmad E Islam, Jiseob Kim, Mark A Pitt, Jay I Myung, Benji Maruyama

Open access · goldAbstract read
In one paragraph

Article in Scientific reports, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 16 papers.

0numbers the graph read from it
0cells of the map it votes in
16citing papers in PubMed
4.1field-weighted citation impact, top 5% of its field
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

16 citing papers in PubMed, 86 citations in OpenAlex.

  1. Article
  2. Review
  3. Article
  4. Article
  5. Review
  6. Review
  7. Article
  8. Review
  9. Article
  10. Review
  11. Article
  12. Article
  13. Review
  14. Article
  15. Article
  16. A Meta-Analysis of Conductive and Strong Carbon Nanotube Materials.Advanced materials (Deerfield Beach, Fla.) · 2021
    Review
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

10 authors at 4 institutions in 2 countries.

Jorge ChangDepartment of Psychology, The Ohio State University, Columbus, OH, 43210, USA.
Pavel NikolaevUES, Inc., Dayton, OH, 45432, USA.
Jennifer Carpena-NúñezUES, Inc., Dayton, OH, 45432, USA.
Rahul RaoUES, Inc., Dayton, OH, 45432, USA.
Kevin DeckerUES, Inc., Dayton, OH, 45432, USA.
Ahmad E IslamUES, Inc., Dayton, OH, 45432, USA.
Jiseob KimSchool of Computer Science and Engineering, Seoul National University, Seoul, 151-742, Korea.
Mark A PittDepartment of Psychology, The Ohio State University, Columbus, OH, 43210, USA.
Jay I MyungDepartment of Psychology, The Ohio State University, Columbus, OH, 43210, USA. myung.1@osu.edu.
Benji MaruyamaMaterials and Manufacturing Directorate, Air Force Research Laboratory, Wright-Patterson Air Force Base, Dayton, OH, 45433, USA. benji.maruyama@us.af.mil.
Wright-Patterson Air Force Base · USThe Ohio State University · USUES (United States) · USSeoul National University · KR

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

A major technological challenge in materials research is the large and complex parameter space, which hinders experimental throughput and ultimately slows down development and implementation. In single-walled carbon nanotube (CNT) synthesis, for instance, the poor yield obtained from conventional catalysts is a result of limited understanding of input-to-output correlations. Autonomous closed-loop experimentation combined with advances in machine learning (ML) is uniquely suited for high-throughput research. Among the ML algorithms available, Bayesian optimization (BO) is especially apt for exploration and optimization within such high-dimensional and complex parameter space. BO is an adaptive sequential design algorithm for finding the global optimum of a black-box objective function with the fewest possible measurements. Here, we demonstrate a promising application of BO in CNT synthesis as an efficient and robust algorithm which can (1) improve the growth rate of CNT in the BO-planner experiments over the seed experiments up to a factor 8; (2) rapidly improve its predictive power (or learning); (3) Consistently achieve good performance regardless of the number or origin of seed experiments; (4) exploit a high-dimensional, complex parameter space, and (5) achieve the former 4 tasks in just over 100 hundred experiments (~8 experimental hours) - a factor of 5× faster than our previously reported results.

Identifiers

PMID32493911
PMCPMC7271124
OpenAlexW3029597861

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.