mlsanityData to 14 Oct 2026

Cooperative Bayesian Optimization for Imperfect Agents

arXiv 2403.04442 ↗First posted 7 Mar 2024cs.LG cs.AI cs.MAcited by 3

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 2 of its 23 references that are in the map. First posted on arXiv 7 Mar 2024.

Builds on

2 of 23 references.

References · 2

  1. 2019The Hanabi Challenge: A New Frontier for AI Researchcited by 197
  2. 2020Projective Preferential Bayesian Optimizationcited by 22

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 0; 2026: 2.

3 papers.