2020
DOI: 10.1021/acs.jcim.0c00946
|View full text |Cite
|
Sign up to set email alerts
|

Investigating Active Learning and Meta-Learning for Iterative Peptide Design

Abstract: Often the development of novel functional peptides is not amenable to high throughput or purely computational screening methods. Peptides must be synthesized one at a time in a process that does not generate large amounts of data. One way this method can be improved is by ensuring that each experiment provides the best improvement in both peptide properties and predictive modeling accuracy. Here, we study the effectiveness of active learning, optimizing experiment order, and meta-learning, transferring knowled… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
17
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 22 publications
(17 citation statements)
references
References 74 publications
0
17
0
Order By: Relevance
“…Active learning is a common candidate selection algorithm in chemistry ,, and in the computer science ML literature ,, in which the goal is to select the unlabeled points that, if labeled and included in the training set, would lead to the largest reduction of model error. This approach often relies on an uncertainty metric that can identify the unseen points on which the model performance is the poorest, which we saw was true of the PADRE σ̂ (eq ) in the previous section.…”
Section: Computational Experiments and Resultsmentioning
confidence: 99%
“…Active learning is a common candidate selection algorithm in chemistry ,, and in the computer science ML literature ,, in which the goal is to select the unlabeled points that, if labeled and included in the training set, would lead to the largest reduction of model error. This approach often relies on an uncertainty metric that can identify the unseen points on which the model performance is the poorest, which we saw was true of the PADRE σ̂ (eq ) in the previous section.…”
Section: Computational Experiments and Resultsmentioning
confidence: 99%
“…Among ML techniques, Bayesian optimization is one of the most common active learning method. It is able to steer the experiments or simulations toward “next-best” candidates based on historical measurements ( Chen et al, 2008 ; Ling et al, 2017 ; Gómez-Bombarelli et al, 2018 ; Barrett and White, 2021 ). The first step is to define a fitness function that evaluates a particular property.…”
Section: Application Of ML For Understanding and Design Of Polymer Chainsmentioning
confidence: 99%
“…The essence of this approach is to train onthe-y sequence-property relationships over all computational screening data collected to date and use these models to guide subsequent rounds of the computational screen within a virtuous feedback loop. [23][24][25][26][27] For example, Li et al used machine learning algorithms such as random forests, gradient boosting, and logistic regression to predict the assembly and formation of hydrogels from possible peptidic precursors. 28 Nagasawa et al employed articial neural networks and random forests for the discovery of conjugated polymers for organic photovoltaic applications.…”
Section: Introductionmentioning
confidence: 99%