Evidence map›Paper›PMID 33875649›Full record

ArticleNature communications2021

Bias free multiobjective active learning for materials design and discovery.

Kevin Maik Jablonka, Giriprasad Melpatti Jothiappan, Shefang Wang, Berend Smit, Brian Yoo

Abstract read
In one paragraph

Article in Nature communications, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 48 papers.

0numbers the graph read from it
0cells of the map it votes in
48citing 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

48 citing papers in PubMed.

  1. Review
  2. Review
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Review
  9. Article
  10. Article
  11. Review
  12. Article
  13. Article
  14. Review
  15. Review
  16. Article
  17. Article
  18. Article
  19. Review
  20. 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

5 authors.

Kevin Maik JablonkaLaboratory of Molecular Simulation (LSMO), Institut des Sciences et Ingénierie Chimiques, Ecole Polytechnique Fédérale de Lausanne (EPFL), Rue de l'Industrie 17, Sion, CH-1951, Switzerland.ORCID 0000-0003-4894-4660
Giriprasad Melpatti JothiappanBASF Corporation, Tarrytown, New York, 10591, USA.
Shefang WangBASF Corporation, Tarrytown, New York, 10591, USA.
Berend SmitLaboratory of Molecular Simulation (LSMO), Institut des Sciences et Ingénierie Chimiques, Ecole Polytechnique Fédérale de Lausanne (EPFL), Rue de l'Industrie 17, Sion, CH-1951, Switzerland. berend.smit@epfl.ch.ORCID 0000-0003-4653-8562
Brian YooBASF Corporation, Tarrytown, New York, 10591, USA. brian.yoo@basf.com.ORCID 0000-0002-0326-0831

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The design rules for materials are clear for applications with a single objective. For most applications, however, there are often multiple, sometimes competing objectives where there is no single best material and the design rules change to finding the set of Pareto optimal materials. In this work, we leverage an active learning algorithm that directly uses the Pareto dominance relation to compute the set of Pareto optimal materials with desirable accuracy. We apply our algorithm to de novo polymer design with a prohibitively large search space. Using molecular simulations, we compute key descriptors for dispersant applications and drastically reduce the number of materials that need to be evaluated to reconstruct the Pareto front with a desired confidence. This work showcases how simulation and machine learning techniques can be coupled to discover materials within a design space that would be intractable using conventional screening approaches.

Identifiers

PMID33875649
PMCPMC8055971

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.