LGMLDec 21, 2024

High-Dimensional Bayesian Optimization via Random Projection of Manifold Subspaces

arXiv:2412.16554v13 citationsh-index: 10ECML/PKDD
Originality Incremental advance
AI Analysis

This addresses the challenge of optimizing expensive black-box functions in high-dimensional spaces for researchers and practitioners in machine learning, though it appears incremental as it builds on existing manifold-based frameworks.

The paper tackles the problem of Bayesian Optimization (BO) performance degrading in high dimensions by proposing a method that combines random linear projection with neural network-based representation learning of nonlinear manifolds, showing empirical outperformance over other high-dimensional BO baselines in synthetic and real applications.

Bayesian Optimization (BO) is a popular approach to optimizing expensive-to-evaluate black-box functions. Despite the success of BO, its performance may decrease exponentially as the dimensionality increases. A common framework to tackle this problem is to assume that the objective function depends on a limited set of features that lie on a low-dimensional manifold embedded in the high-dimensional ambient space. The latent space can be linear or more generally nonlinear. To learn feature mapping, existing works usually use an encode-decoder framework which is either computationally expensive or susceptible to overfittting when the labeled data is limited. This paper proposes a new approach for BO in high dimensions by exploiting a new representation of the objective function. Our approach combines a random linear projection to reduce the dimensionality, with a representation learning of the nonlinear manifold. When the geometry of the latent manifold is available, a solution to exploit this geometry is proposed for representation learning. In contrast, we use a neural network. To mitigate overfitting by using the neural network, we train the feature mapping in a geometry-aware semi-supervised manner. Our approach enables efficient optimizing of BO's acquisition function in the low-dimensional space, with the advantage of projecting back to the original high-dimensional space compared to existing works in the same setting. Finally, we show empirically that our algorithm outperforms other high-dimensional BO baselines in various synthetic functions and real applications.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes