Combining Latent Space and Structured Kernels for Bayesian Optimization over Combinatorial Spaces
Aryan Deshwal, Janardhan Rao Doppa

TL;DR
This paper introduces LADDER, a new Bayesian optimization method for combinatorial spaces that combines latent space representations with structure-aware kernels, leading to improved optimization performance.
Contribution
LADDER integrates structural information into the surrogate model via a novel structure-coupled kernel, enhancing BO over latent spaces for combinatorial optimization.
Findings
LADDER outperforms existing BO over latent space methods.
LADDER matches or exceeds state-of-the-art performance on real-world benchmarks.
The structure-coupled kernel improves surrogate modeling accuracy.
Abstract
We consider the problem of optimizing combinatorial spaces (e.g., sequences, trees, and graphs) using expensive black-box function evaluations. For example, optimizing molecules for drug design using physical lab experiments. Bayesian optimization (BO) is an efficient framework for solving such problems by intelligently selecting the inputs with high utility guided by a learned surrogate model. A recent BO approach for combinatorial spaces is through a reduction to BO over continuous spaces by learning a latent representation of structures using deep generative models (DGMs). The selected input from the continuous space is decoded into a discrete structure for performing function evaluation. However, the surrogate model over the latent space only uses the information learned by the DGM, which may not have the desired inductive bias to approximate the target black-box function. To…
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.
Code & Models
Videos
Taxonomy
TopicsAdvanced Multi-Objective Optimization Algorithms · Gaussian Processes and Bayesian Inference · Machine Learning and Data Classification
