Conference paper · 2026 · Open access

Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension

Hong Qian, Xiang Shu, Xiang Xia, Xuhui Liu, 傅揚德, Bei Liang, Huibin Wang, Liang Dou

International Joint Conference on Artificial Intelligence, 4732–4740 · Published 1 September 2026 · DOI 10.24963/ijcai.2026/527

Open PDFView at the publisherCite this paper

In brief

“Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension” is a 2026 conference paper by Hong Qian and 7 co-authors, published in International Joint Conference on Artificial Intelligence. OpenAlex counts 0 citations as of 19 November 2026. It is open access: the full text is free to read at International Joint Conference on Artificial Intelligence.

Citations
0
References
30
Authors
8

Abstract

Bayesian optimization is widely employed for optimizing complex black-box functions but struggles with the curse of dimensionality. Random embedding, as a dimension reduction strategy, simplifies tasks that possess the effective dimension by optimizing within a low-dimensional subspace. However, determining the effective dimension of a task in advance remains a significant challenge, which influences the selection of the subspace dimensionality and the optimization performance. Traditional methods use fixed subspace dimensions provided by experts or rely on trial and error to estimate subspace dimensions with resources consumed. To this end, this paper proposes an automated random embedding for high-dimensional Bayesian optimization with unknown effective dimension, called Dynamic Shared Embedding Bayesian Optimization (DSEBO). DSEBO starts with a low dimension and switches to a higher subspace if the solutions in the current subspace show preliminary convergence. DSEBO dynamically determines the dimension of the next subspace based on the quality of the solutions in different subspaces and shares the queried solutions with the new subspace for a better initialization. Theoretically, we derive a regret bound for DSEBO and demonstrate that DSEBO can better balance approximation and optimization errors. Extensive experiments on functions with dimensionality of varying magnitudes and real-world tasks with unknown effective dimensions reveal that, compared with state-of-the-art methods, alternating optimization across different subspaces results in significant improvements in high-dimensional optimization, both in terms of optimization regret and time.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Qian, H., Shu, X., Xia, X., Liu, X., 傅揚德, Liang, B., Wang, H., & Dou, L. (2026). Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension. International Joint Conference on Artificial Intelligence, 4732–4740. https://doi.org/10.24963/ijcai.2026/527

MLA 9

Qian, Hong, et al. “Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension.” International Joint Conference on Artificial Intelligence, 2026, pp. 4732–4740. https://doi.org/10.24963/ijcai.2026/527.

Chicago

Qian, Hong, Xiang Shu, Xiang Xia, Xuhui Liu, 傅揚德, Bei Liang, Huibin Wang, and Liang Dou. 2026. “Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension.” International Joint Conference on Artificial Intelligence: 4732–4740. https://doi.org/10.24963/ijcai.2026/527.

Harvard

Qian, H. et al. (2026) ‘Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension’, International Joint Conference on Artificial Intelligence, pp. 4732–4740. doi:10.24963/ijcai.2026/527.

IEEE

H. Qian et al., “Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension,” International Joint Conference on Artificial Intelligence, pp. 4732–4740, 2026, doi: 10.24963/ijcai.2026/527.

BibTeX

@inproceedings{qian2026automated,
  title     = {{Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension}},
  author    = {Qian, Hong and Shu, Xiang and Xia, Xiang and Liu, Xuhui and 傅揚德 and Liang, Bei and Wang, Huibin and Dou, Liang},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2026},
  pages     = {4732--4740},
  doi       = {10.24963/ijcai.2026/527},
  url       = {https://doi.org/10.24963/ijcai.2026/527}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research

  • Bayesian optimization
  • random embeddings
  • effective dimension
  • dimensionality reduction
  • curse of dimensionality
  • regret bounds
  • black-box optimization

Work with this paper

Most-cited papers in Decision Sciences

All highly cited Decision Sciences papers

Questions about this paper

How do I cite this paper in APA style?

Qian, H., Shu, X., Xia, X., Liu, X., 傅揚德, Liang, B., Wang, H., & Dou, L. (2026). Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension. International Joint Conference on Artificial Intelligence, 4732–4740. https://doi.org/10.24963/ijcai.2026/527

How many times has this paper been cited?

0 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at International Joint Conference on Artificial Intelligence: sign in and open the PDF from this page.

Who wrote this paper?

Hong Qian, Xiang Shu, Xiang Xia, Xuhui Liu, 傅揚德, Bei Liang, Huibin Wang, Liang Dou.

What is the DOI of this paper?

10.24963/ijcai.2026/527, permanently at https://doi.org/10.24963/ijcai.2026/527. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.