Saved in:
Bibliographic Details
Main Authors: Lu, Jiaming, Zhu, Rong J. B.
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2408.04860
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866913463030251520
author Lu, Jiaming
Zhu, Rong J. B.
author_facet Lu, Jiaming
Zhu, Rong J. B.
contents In high-dimensional settings, Bayesian optimization (BO) can be expensive and infeasible. The random embedding Bayesian optimization algorithm is commonly used to address high-dimensional BO challenges. However, this method relies on the effective subspace assumption on the optimization problem's objective function, which limits its applicability. In this paper, we introduce Condensing-Expansion Projection Bayesian optimization (CEPBO), a novel random projection-based approach for high-dimensional BO that does not reply on the effective subspace assumption. The approach is both simple to implement and highly practical. We present two algorithms based on different random projection matrices: the Gaussian projection matrix and the hashing projection matrix. Experimental results demonstrate that both algorithms outperform existing random embedding-based algorithms in most cases, achieving superior performance on high-dimensional BO problems. The code is available in \url{https://anonymous.4open.science/r/CEPBO-14429}.
format Preprint
id arxiv_https___arxiv_org_abs_2408_04860
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle High dimensional Bayesian Optimization via Condensing-Expansion Projection
Lu, Jiaming
Zhu, Rong J. B.
Machine Learning
In high-dimensional settings, Bayesian optimization (BO) can be expensive and infeasible. The random embedding Bayesian optimization algorithm is commonly used to address high-dimensional BO challenges. However, this method relies on the effective subspace assumption on the optimization problem's objective function, which limits its applicability. In this paper, we introduce Condensing-Expansion Projection Bayesian optimization (CEPBO), a novel random projection-based approach for high-dimensional BO that does not reply on the effective subspace assumption. The approach is both simple to implement and highly practical. We present two algorithms based on different random projection matrices: the Gaussian projection matrix and the hashing projection matrix. Experimental results demonstrate that both algorithms outperform existing random embedding-based algorithms in most cases, achieving superior performance on high-dimensional BO problems. The code is available in \url{https://anonymous.4open.science/r/CEPBO-14429}.
title High dimensional Bayesian Optimization via Condensing-Expansion Projection
topic Machine Learning
url https://arxiv.org/abs/2408.04860