mlsanityData to 7 Oct 2026

Designing Biological Sequences via Meta-Reinforcement Learning and Bayesian Optimization

arXiv 2209.06259 ↗First posted 13 Sep 2022cs.LG cs.AIcited by 4

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

  1. 2017Attention Is All You Needcited by 59,932
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  4. 2018Regularized Evolution for Image Classifier Architecture Searchcited by 902
  5. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
  6. 2019BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learningcited by 428
  7. 2018Accurate Uncertainties for Deep Learning Using Calibrated Regressioncited by 417
  8. 2016The CMA Evolution Strategy: A Tutorialcited by 364
  9. 2014Predictive Entropy Search for Efficient Global Optimization of Black-box Functionscited by 201
  10. 2013Bayesian Optimization in a Billion Dimensions via Random Embeddingscited by 178
  11. 2018Understanding the impact of entropy on policy optimizationcited by 171
  12. 2020AdaLead: A simple and robust adaptive greedy search algorithm for sequence designcited by 63
2 more
  1. 2018DiCE: The Infinitely Differentiable Monte-Carlo Estimatorcited by 46
  2. 2019Generating protein sequences from antibiotic resistance genes data using Generative Adversarial Networkscited by 2

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1; 2024: 2.

4 papers.