Cooperative Bayesian Optimization for Imperfect Agents

Ali Khoshvishkaie, Petrus Mikkola, Pierre-Alexandre Murena, Samuel Kaski
3/7/2024
cs.LGcs.AIcs.MA

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

We introduce a cooperative Bayesian optimization problem for optimizing black-box functions of two variables where two agents choose together at which points to query the function but have only control over one variable each. This setting is inspired by human-AI teamwork, where an AI-assistant helps its human user solve a problem, in this simplest case, collaborative optimization. We formulate the solution as sequential decision-making, where the agent we control models the user as a computationally rational agent with prior knowledge about the function. We show that strategic planning of the queries enables better identification of the global maximum of the function as long as the user avoids excessive exploration. This planning is made possible by using Bayes Adaptive Monte Carlo planning and by endowing the agent with a user model that accounts for conservative belief updates and exploratory sampling of the points to query.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{khoshvishkaie2024cooperative,
  title  = {Cooperative Bayesian Optimization for Imperfect Agents},
  author = {Ali Khoshvishkaie and Petrus Mikkola and Pierre-Alexandre Murena and Samuel Kaski},
  year   = {2024},
  eprint = {2403.04442},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2403.04442v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2403.04442.svg)](https://codeofpaper.com/paper/2403.04442)

Discussion