arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.06173q-bio.BMcs.LG
收藏

基于树搜索的进化老虎机方法用于蛋白质序列优化

Tree Search-Based Evolutionary Bandits for Protein Sequence Optimization

Princeton University(普林斯顿大学);University of California San Diego(加利福尼亚大学圣地亚哥分校);MLAB Biosciences Inc(MLAB生物科学公司);Oregon State University(俄勒冈州立大学)

Jiahao Qiu, Hui Yuan, Jinghong Zhang, Wentao Chen, Huazheng Wang, Mengdi Wang

AI总结:

本文提出一种基于树搜索的老虎机学习方法,通过将局部搜索与老虎机模型结合来高效探索蛋白质序列空间,理论分析和模拟筛选实验表明其能以较少突变和样本找到近最优蛋白质设计。

摘要:

尽管现代生物技术能够大规模合成新蛋白质并进行功能测量,但由于任何给定蛋白质的序列空间极其庞大,高效地探索蛋白质序列空间并对其进行工程改造仍然是一项艰巨的任务。蛋白质工程通常通过一个迭代过程进行:向野生型或先导序列添加突变、重组突变以及开展新一轮筛选。为了提高这一过程的效率,我们提出了一种基于树搜索的老虎机学习方法,该方法在老虎机机器学习模型的指导下,从初始序列开始扩展一棵树。在简化假设和高斯过程先验下,我们提供了理论分析和贝叶斯遗憾界,证明局部搜索与老虎机学习方法相结合能够高效地发现近最优设计。完整算法兼容一系列随机树搜索启发式方法、机器学习模型、预训练嵌入以及老虎机技术。我们使用模拟筛选在基准蛋白质数据集上测试了该算法的多种实例。实验结果表明,该算法既具有样本效率,又能在使用合理较少突变数量的情况下找到最优设计。

英文摘要:

While modern biotechnologies allow synthesizing new proteins and function measurements at scale, efficiently exploring a protein sequence space and engineering it remains a daunting task due to the vast sequence space of any given protein. Protein engineering is typically conducted through an iterative process of adding mutations to the wild-type or lead sequences, recombination of mutations, and running new rounds of screening. To enhance the efficiency of such a process, we propose a tree search-based bandit learning method, which expands a tree starting from the initial sequence with the guidance of a bandit machine learning model. Under simplified assumptions and a Gaussian Process prior, we provide theoretical analysis and a Bayesian regret bound, demonstrating that the combination of local search and bandit learning method can efficiently discover a near-optimal design. The full algorithm is compatible with a suite of randomized tree search heuristics, machine learning models, pre-trained embeddings, and bandit techniques. We test various instances of the algorithm across benchmark protein datasets using simulated screens. Experiment results demonstrate that the algorithm is both sample-efficient and able to find top designs using reasonably small mutation counts.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑