Collaborative Bayesian Optimization via Wasserstein Barycenters
By: Donglin Zhan , Haoting Zhang , Rhonda Righter and more
Potential Business Impact:
Helps computers learn secrets without sharing data.
Motivated by the growing need for black-box optimization and data privacy, we introduce a collaborative Bayesian optimization (BO) framework that addresses both of these challenges. In this framework agents work collaboratively to optimize a function they only have oracle access to. In order to mitigate against communication and privacy constraints, agents are not allowed to share their data but can share their Gaussian process (GP) surrogate models. To enable collaboration under these constraints, we construct a central model to approximate the objective function by leveraging the concept of Wasserstein barycenters of GPs. This central model integrates the shared models without accessing the underlying data. A key aspect of our approach is a collaborative acquisition function that balances exploration and exploitation, allowing for the optimization of decision variables collaboratively in each iteration. We prove that our proposed algorithm is asymptotically consistent and that its implementation via Monte Carlo methods is numerically accurate. Through numerical experiments, we demonstrate that our approach outperforms other baseline collaborative frameworks and is competitive with centralized approaches that do not consider data privacy.
Similar Papers
Wasserstein Barycenter Gaussian Process based Bayesian Optimization
Machine Learning (Stat)
Finds best answers faster, even on hard problems.
Wasserstein-Barycenter Consensus for Cooperative Multi-Agent Reinforcement Learning
Systems and Control
Teaches robots to work together better.
Clustering-based Meta Bayesian Optimization with Theoretical Guarantee
Machine Learning (CS)
Finds best settings faster, even with many past tries.