Designing Biological Sequences via Meta-Reinforcement Learning and Bayesian Optimization
Not on the map. Why?
Abstract (arXiv)
The ability to accelerate the design of biological sequences can have a substantial impact on the progress of the medical field. The problem can be framed as a global optimization problem where the objective is an expensive black-box function such that we can query large batches restricted with a limitation of a low number of rounds. Bayesian Optimization is a principled method for tackling this problem. However, the astronomically large state space of biological sequences renders brute-force iterating over all possible sequences infeasible. In this paper, we propose MetaRLBO where we train an autoregressive generative model via Meta-Reinforcement Learning to propose promising sequences for selection via Bayesian Optimization. We pose this problem as that of finding an optimal policy over a distribution of MDPs induced by sampling subsets of the data acquired in the previous rounds. Our in-silico experiments show that meta-learning over such ensembles provides robustness against reward misspecification and achieves competitive results compared to existing strong baselines.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 14 of its 39 references that are in the map. First posted on arXiv 13 Sep 2022.
Builds on
14 of 39 references.
References · 14
- 2017Attention Is All You Needcited by 59,932
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2018Regularized Evolution for Image Classifier Architecture Searchcited by 902
- 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
- 2019BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learningcited by 428
- 2018Accurate Uncertainties for Deep Learning Using Calibrated Regressioncited by 417
- 2016The CMA Evolution Strategy: A Tutorialcited by 364
- 2014Predictive Entropy Search for Efficient Global Optimization of Black-box Functionscited by 201
- 2013Bayesian Optimization in a Billion Dimensions via Random Embeddingscited by 178
- 2018Understanding the impact of entropy on policy optimizationcited by 171
- 2020AdaLead: A simple and robust adaptive greedy search algorithm for sequence designcited by 63
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 2.
4 papers.
- 2023A Text-guided Protein Design Frameworkcited by 61
- 2024Discrete Probabilistic Inference as Control in Multi-path Environmentscited by 40
- 2024Towards an Information Theoretic Framework of Context-Based Offline Meta-Reinforcement Learningcited by 16
- 2022Forecasting labels under distribution-shift for machine-guided sequence designcited by 4
- 2024Discrete Probabilistic Inference as Control in Multi-path Environments15 Feb 2024
- 2024Towards an Information Theoretic Framework of Context-Based Offline Meta-Reinforcement Learning4 Feb 2024
- 2023A Text-guided Protein Design Framework9 Feb 2023
- 2022Forecasting labels under distribution-shift for machine-guided sequence design18 Nov 2022