arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.04698cs.LG
收藏

用于抗体设计的结构化Q学习

Structured Q-learning For Antibody Design

Technische Universität Darmstadt(达姆施塔特工业大学);Huawei R&D(华为研发);University of Edinburgh(爱丁堡大学);University College London(伦敦大学学院)

Alexander I. Cowen-Rivers, Philip John Gorinski, Aivar Sootla, Asif Khan, Liu Furui, Jun Wang, Jan Peters, Haitham Bou Ammar

摘要:

优化组合结构是许多现实问题的核心,例如生命科学中遇到的问题。例如,抗体设计的关键步骤之一是找到蛋白质序列中氨基酸的排列方式,以提高其与病原体的结合。抗体的组合优化由于极大的搜索空间和非线性目标而困难。即使对于一般的抗体设计问题(蛋白质的序列长度为11),我们也要搜索超过2.05 × 10^14个结构。将Q学习等传统强化学习算法应用于组合优化会导致性能不佳。我们提出了结构化Q学习(SQL),Q学习的扩展,结合结构先验的组合优化。使用分子对接模拟器,我们证明了SQL发现高结合能序列,并在八个具有挑战性的抗体设计任务(包括设计SARS-COV抗体)上对基线表现良好。

英文摘要:

Optimizing combinatorial structures is core to many real-world problems, such as those encountered in life sciences. For example, one of the crucial steps involved in antibody design is to find an arrangement of amino acids in a protein sequence that improves its binding with a pathogen. Combinatorial optimization of antibodies is difficult due to extremely large search spaces and non-linear objectives. Even for modest antibody design problems, where proteins have a sequence length of eleven, we are faced with searching over 2.05 x 10^14 structures. Applying traditional Reinforcement Learning algorithms such as Q-learning to combinatorial optimization results in poor performance. We propose Structured Q-learning (SQL), an extension of Q-learning that incorporates structural priors for combinatorial optimization. Using a molecular docking simulator, we demonstrate that SQL finds high binding energy sequences and performs favourably against baselines on eight challenging antibody design tasks, including designing antibodies for SARS-COV.

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

↑