mlsanityData to 7 Oct 2026

AntBO: Towards Real-World Automated Antibody Design with Combinatorial Bayesian Optimisation

arXiv 2201.12570 ↗First posted 29 Jan 2022q-bio.BM cs.AI cs.LGcited by 14

Not on the map. Why?

Abstract (arXiv)

Antibodies are canonically Y-shaped multimeric proteins capable of highly specific molecular recognition. The CDRH3 region located at the tip of variable chains of an antibody dominates antigen-binding specificity. Therefore, it is a priority to design optimal antigen-specific CDRH3 regions to develop therapeutic antibodies. However, the combinatorial nature of CDRH3 sequence space makes it impossible to search for an optimal binding sequence exhaustively and efficiently using computational approaches. Here, we present textttAntBO: a combinatorial Bayesian optimisation framework enabling efficient textitin silico design of the CDRH3 region. Ideally, antibodies are expected to have high target specificity and developability. We introduce a CDRH3 trust region that restricts the search to sequences with favourable developability scores to achieve this goal. For benchmarking, textttAntBO uses the textttAbsolut! software suite as a black-box oracle to score the target specificity and affinity of designed antibodies textitin silico in an unconstrained fashion~citeprobert2021one. The experiments performed for 159 discretised antigens used in textttAbsolut! demonstrate the benefit of textttAntBO in designing CDRH3 regions with diverse biophysical properties. In under 200 calls to black-box oracle, textttAntBO can suggest antibody sequences that outperform the best binding sequence drawn from 6.9 million experimentally obtained CDRH3s and a commonly used genetic algorithm baseline. Additionally, textttAntBO finds very-high affinity CDRH3 sequences in only 38 protein designs whilst requiring no domain knowledge. We conclude textttAntBO brings automated antibody design methods closer to what is practically viable for in vitro experimentation.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 18 of its 134 references that are in the map. First posted on arXiv 29 Jan 2022.

Builds on

18 of 134 references.

References · 18

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2018A Tutorial on Bayesian Optimizationcited by 734
  3. 2019Scalable Global Optimization via Local Bayesian Optimizationcited by 359
  4. 2021Bayesian Optimization is Superior to Random Search for Machine Learning Hyperparameter Tuning: Analysis of the Black-Box Optimization Challenge 2020cited by 146
  5. 2021Iterative Refinement Graph Neural Network for Antibody Sequence-Structure Co-designcited by 82
  6. 2019Combinatorial Bayesian Optimization using the Graph Cartesian Productcited by 78
  7. 2021Simulation Intelligence: Towards a New Generation of Scientific Methodscited by 68
  8. 2018Bayesian Optimization of Combinatorial Structurescited by 64
  9. 2020BOSS: Bayesian Optimization over String Spacescited by 54
  10. 2021High-Dimensional Bayesian Optimisation with Variational Autoencoders and Deep Metric Learningcited by 54
  11. 2021Think Global and Act Local: Bayesian Optimisation over High-Dimensional Categorical and Mixed Search Spacescited by 51
  12. 2015A General Framework for Constrained Bayesian Optimization using Information-based Searchcited by 50
6 more
  1. 2021Fold2Seq: A Joint Sequence(1D)-Fold(3D) Embedding-based Generative Model for Protein Designcited by 23
  2. 2020Pre-training of Graph Neural Network for Modeling Effects of Mutations on Protein-Protein Binding Affinitycited by 18
  3. 2019Kernels over Sets of Finite Sets using RKHS Embeddings, with Application to Bayesian (Combinatorial) Optimizationcited by 12
  4. 2021Neural message passing for joint paratope-epitope predictioncited by 10
  5. 2020Are we Forgetting about Compositional Optimisers in Bayesian Optimisation?cited by 9
  6. 2020Combinatorial Black-Box Optimization with Expert Advicecited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 4; 2023: 3; 2024: 4; 2025: 2; 2026: 1.

14 papers.

Sort:

By area: