MOCA-HESP: Meta High-dimensional Bayesian Optimization for Combinatorial and Mixed Spaces via Hyper-ellipsoid Partitioning
Lam Ngo, Huong Ha, Jeffrey Chan, Hongyu Zhang

TL;DR
This paper introduces MOCA-HESP, a meta high-dimensional Bayesian Optimization method that effectively handles combinatorial and mixed variable spaces using hyper-ellipsoid partitioning and adaptive encoder selection, outperforming existing methods.
Contribution
The paper proposes MOCA-HESP, a novel meta-algorithm for high-dimensional BO in combinatorial and mixed spaces, integrating hyper-ellipsoid partitioning with adaptive encoder selection via multi-armed bandits.
Findings
MOCA-HESP outperforms baseline methods on synthetic benchmarks.
Integrating MOCA-HESP with existing BO optimizers improves their performance.
The method effectively handles high-dimensional, mixed, and combinatorial variable spaces.
Abstract
High-dimensional Bayesian Optimization (BO) has attracted significant attention in recent research. However, existing methods have mainly focused on optimizing in continuous domains, while combinatorial (ordinal and categorical) and mixed domains still remain challenging. In this paper, we first propose MOCA-HESP, a novel high-dimensional BO method for combinatorial and mixed variables. The key idea is to leverage the hyper-ellipsoid space partitioning (HESP) technique with different categorical encoders to work with high-dimensional, combinatorial and mixed spaces, while adaptively selecting the optimal encoders for HESP using a multi-armed bandit technique. Our method, MOCA-HESP, is designed as a \textit{meta-algorithm} such that it can incorporate other combinatorial and mixed BO optimizers to further enhance the optimizers' performance. Finally, we develop three practical BO methods…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
