Skip to content

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

11 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

gameopt 🎲

This repository contains the code associated with the paper:

Optimistic Games for Combinatorial Bayesian Optimization with Application to Protein Design

by Melis Ilayda Bal, Pier Giuseppe Sessa, Mojmir Mutny, Andreas Krause, ICLR 2025.

arXiv

📌 TL;DR:

Overview

GameOpt reformulates combinatorial Bayesian optimization as a cooperative game, where solutions are game equilibria of an optimistic acquisition function. By decomposing large combinatorial domains into individual decision sets, GameOpt scales to problems with exponentially large search spaces and rapidly discovers high-quality protein variants.

🧠 Abstract

Bayesian optimization (BO) is a powerful framework to optimize black-box expensive-to-evaluate functions via sequential interactions. In several important problems (e.g. drug discovery, circuit design, neural architecture search, etc.), though, such functions are defined over large combinatorial and unstructured spaces. This makes existing BO algorithms not feasible due to the intractable maximization of the acquisition function over these domains. To address this issue, we propose GameOpt, a novel game-theoretical approach to combinatorial BO. GameOpt establishes a cooperative game between the different optimization variables, and selects points that are game equilibria of an upper confidence bound acquisition function. These are stable configurations from which no variable has an incentive to deviate- analog to local optima in continuous domains. Crucially, this allows us to efficiently break down the complexity of the combinatorial domain into individual decision sets, making GameOpt scalable to large combinatorial spaces. We demonstrate the application of GameOpt to the challenging protein design problem and validate its performance on four real-world protein datasets. Each protein can take up to 20^X possible configurations, where X is the length of a protein, making standard BO methods infeasible. Instead, our approach iteratively selects informative protein configurations and very quickly discovers highly active protein variants compared to other baselines.


⚙️ Project Details

Coming soon!


License

This project is licensed under the MIT License. See the LICENSE file for more details.


📖 Citation

If you use this code in your research, please cite our paper:

@article{bal_gameopt,
      title={Optimistic Games for Combinatorial Bayesian Optimization with Application to Protein Design},
      author={Bal, Melis Ilayda and Sessa, Pier Giuseppe and Mutny, Mojmir and Krause, Andreas},
      year={2025},
      journal={International Conference on Learning Representations (ICLR)},
}

This repository will be updated shortly. Thank you for your interest!

About

[ICLR 2025] Optimistic Games for Combinatorial Bayesian Optimization with Application to Protein Design

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages