# On the choice of the low-dimensional domain for global optimization via random embeddings

arXiv: https://arxiv.org/abs/1704.05318 · HTML: https://mlsanity.com/paper/1704.05318/

## Key facts

- Cited by 25 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 18 Apr 2017.

## Built on by (most cited first, 25 of 25)

- [High-Dimensional Bayesian Optimization with Sparse Axis-Aligned Subspaces](https://mlsanity.com/paper/2103.00349/) (2021)
- [Vanilla Bayesian Optimization Performs Great in High Dimensions](https://mlsanity.com/paper/2402.02229/) (2024)
- [Recent Advances in Bayesian Optimization](https://mlsanity.com/paper/2206.03301/) (2022)
- [High-Dimensional Bayesian Optimisation with Variational Autoencoders and Deep Metric Learning](https://mlsanity.com/paper/2106.03609/) (2021)
- [Think Global and Act Local: Bayesian Optimisation over High-Dimensional Categorical and Mixed Search Spaces](https://mlsanity.com/paper/2102.07188/) (2021)
- [Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested Subspaces](https://mlsanity.com/paper/2304.11468/) (2023)
- [Monte Carlo Tree Search based Variable Selection for High Dimensional Bayesian Optimization](https://mlsanity.com/paper/2210.01628/) (2022)
- [Bounce: Reliable High-Dimensional Bayesian Optimization for Combinatorial and Mixed Spaces](https://mlsanity.com/paper/2307.00618/) (2023)
- [A survey and benchmark of high-dimensional Bayesian optimization of discrete sequences](https://mlsanity.com/paper/2406.04739/) (2024)
- [Bayesian optimization for mixed variables using an adaptive dimension reduction process: applications to aircraft design](https://mlsanity.com/paper/2504.08682/) (2025)
- [Global optimization using random embeddings](https://mlsanity.com/paper/2107.12102/) (2021)
- [Unleashing the Potential of Acquisition Functions in High-Dimensional Bayesian Optimization](https://mlsanity.com/paper/2302.08298/) (2023)
- [Joint Composite Latent Space Bayesian Optimization](https://mlsanity.com/paper/2311.02213/) (2023)
- [Expected Coordinate Improvement for High-Dimensional Bayesian Optimization](https://mlsanity.com/paper/2404.11917/) (2024)
- [High-Dimensional Bayesian Optimization Using Both Random and Supervised Embeddings](https://mlsanity.com/paper/2502.00854/) (2025)
- [Enhancing Trust-Region Bayesian Optimization via Newton Methods](https://mlsanity.com/paper/2508.18423/) (2025)
- [A model aggregation approach for high-dimensional large-scale optimization](https://mlsanity.com/paper/2205.07525/) (2022)
- [Linear Embedding-based High-dimensional Batch Bayesian Optimization without Reconstruction Mappings](https://mlsanity.com/paper/2211.00947/) (2022)
- [High dimensional Bayesian Optimization via Condensing-Expansion Projection](https://mlsanity.com/paper/2408.04860/) (2024)
- [CobBO: Coordinate Backoff Bayesian Optimization with Two-Stage Kernels](https://mlsanity.com/paper/2101.05147/) (2021)
- [High-Dimensional Simulation Optimization via Brownian Fields and Sparse Grids](https://mlsanity.com/paper/2107.08595/) (2021)
- [Scaling Bayesian Optimization With Game Theory](https://mlsanity.com/paper/2110.03790/) (2021)
- [Selecting Critical Scenarios of DER Adoption in Distribution Grids Using Bayesian Optimization](https://mlsanity.com/paper/2501.14118/) (2025)
- [Sample-Constrained Black Box Optimization for Audio Personalization](https://mlsanity.com/paper/2507.12773/) (2025)
- [Nonlinear Dimensionality Reduction Techniques for Bayesian Optimization](https://mlsanity.com/paper/2510.15435/) (2025)

## Abstract (arXiv)

The challenge of taking many variables into account in optimization problems may be overcome under the hypothesis of low effective dimensionality. Then, the search of solutions can be reduced to the random embedding of a low dimensional space into the original one, resulting in a more manageable optimization problem. Specifically, in the case of time consuming black-box functions and when the budget of evaluations is severely limited, global optimization with random embeddings appears as a sound alternative to random search. Yet, in the case of box constraints on the native variables, defining suitable bounds on a low dimensional domain appears to be complex. Indeed, a small search domain does not guarantee to find a solution even under restrictive hypotheses about the function, while a larger one may slow down convergence dramatically. Here we tackle the issue of low-dimensional domain selection based on a detailed study of the properties of the random embedding, giving insight on the aforementioned difficulties. In particular, we describe a minimal low-dimensional set in correspondence with the embedded search space. We additionally show that an alternative equivalent embedding procedure yields simultaneously a simpler definition of the low-dimensional minimal set and better properties in practice. Finally, the performance and robustness gains of the proposed enhancements for Bayesian optimization are illustrated on numerical examples.