Symmetry-Aware Bayesian Optimization via Max Kernels
Not on the map. Why?
Abstract (arXiv)
Bayesian Optimization (BO) is a powerful framework for optimizing noisy, expensive-to-evaluate black-box functions. When the objective exhibits invariances under a group action, exploiting these symmetries can substantially improve BO efficiency. While using maximum similarity across group orbits has long been considered in other domains, the fact that the max kernel is not positive semidefinite (PSD) has prevented its use in BO. In this work, we revisit this idea by considering a PSD projection of the max kernel. Compared to existing invariant (and non-invariant) kernels, we show it achieves significantly lower regret on both synthetic and real-world BO benchmarks, without increasing computational complexity.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 8 of its 35 references that are in the map. First posted on arXiv 29 Sep 2025.
Builds on
8 of 35 references.
References · 8
- 2013Finite-Time Analysis of Kernelised Contextual Banditscited by 177
- 2017Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimizationcited by 78
- 2021Misspecified Gaussian Process Bandit Optimizationcited by 55
- 2023On the Sublinear Regret of GP-UCBcited by 26
- 2019Bayesian Optimization using Pseudo-Pointscited by 7
- 2024This Too Shall Pass: Removing Stale Observations in Dynamic Bayesian Optimizationcited by 6
- 2024Sample-efficient Bayesian Optimisation Using Known Invariancescited by 4
- 2022INSPIRE: Distributed Bayesian Optimization for ImproviNg SPatIal REuse in Dense WLANscited by 3
Built on by
Not cited yet.