Conference paper · 2020 · Open access
Trading Convergence Rate with Computational Budget in High Dimensional Bayesian Optimization
Proceedings of the AAAI Conference on Artificial Intelligence, 34(03), 2425–2432 · Published 3 April 2020 · DOI 10.1609/aaai.v34i03.5623
In brief
“Trading Convergence Rate with Computational Budget in High Dimensional Bayesian Optimization” is a 2020 conference paper by Hung Tran-The and 3 co-authors, published in Proceedings of the AAAI Conference on Artificial Intelligence. OpenAlex counts 16 citations as of 19 November 2026, which puts it in the top 8% of works published in 2020 by citations. It is open access: the full text is free to read at Proceedings of the AAAI Conference on Artificial Intelligence.
- Citations
- 16
- Most cited in
- 2025 (4)
- Field-weighted impact
- 2.50
- References
- 23
- Authors
- 4
Abstract
Scaling Bayesian optimisation (BO) to high-dimensional search spaces is a active and open research problems particularly when no assumptions are made on function structure. The main reason is that at each iteration, BO requires to find global maximisation of acquisition function, which itself is a non-convex optimization problem in the original search space. With growing dimensions, the computational budget for this maximisation gets increasingly short leading to inaccurate solution of the maximisation. This inaccuracy adversely affects both the convergence and the efficiency of BO. We propose a novel approach where the acquisition function only requires maximisation on a discrete set of low dimensional subspaces embedded in the original high-dimensional search space. Our method is free of any low dimensional structure assumption on the function unlike many recent high-dimensional BO methods. Optimising acquisition function in low dimensional subspaces allows our method to obtain accurate solutions within limited computational budget. We show that in spite of this convenience, our algorithm remains convergent. In particular, cumulative regret of our algorithm only grows sub-linearly with the number of iterations. More importantly, as evident from our regret bounds, our algorithm provides a way to trade the convergence rate with the number of subspaces used in the optimisation. Finally, when the number of subspaces is "sufficiently large", our algorithm's cumulative regret is at most O*(√TγT) as opposed to O*(√DTγT) for the GP-UCB of Srinivas et al. (2012), reducing a crucial factor √D where D being the dimensional number of input space. We perform empirical experiments to evaluate our method extensively, showing that its sample efficiency is better than the existing methods for many optimisation problems involving dimensions up to 5000.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Tran-The, H., Gupta, S., Rana, S., & Venkatesh, S. (2020). Trading Convergence Rate with Computational Budget in High Dimensional Bayesian Optimization. Proceedings of the AAAI Conference on Artificial Intelligence, 34(03), 2425–2432. https://doi.org/10.1609/aaai.v34i03.5623
MLA 9
Tran-The, Hung, et al. “Trading Convergence Rate with Computational Budget in High Dimensional Bayesian Optimization.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 03, 2020, pp. 2425–2432. https://doi.org/10.1609/aaai.v34i03.5623.
Chicago
Tran-The, Hung, Sunil Gupta, Santu Rana, and Svetha Venkatesh. 2020. “Trading Convergence Rate with Computational Budget in High Dimensional Bayesian Optimization.” Proceedings of the AAAI Conference on Artificial Intelligence 34 (03): 2425–2432. https://doi.org/10.1609/aaai.v34i03.5623.
Harvard
Tran-The, H. et al. (2020) ‘Trading Convergence Rate with Computational Budget in High Dimensional Bayesian Optimization’, Proceedings of the AAAI Conference on Artificial Intelligence, 34(03), pp. 2425–2432. doi:10.1609/aaai.v34i03.5623.
IEEE
H. Tran-The, S. Gupta, S. Rana, and S. Venkatesh, “Trading Convergence Rate with Computational Budget in High Dimensional Bayesian Optimization,” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, no. 03, pp. 2425–2432, 2020, doi: 10.1609/aaai.v34i03.5623.
BibTeX
@inproceedings{tranthe2020trading,
title = {{Trading Convergence Rate with Computational Budget in High Dimensional Bayesian Optimization}},
author = {Tran-The, Hung and Gupta, Sunil and Rana, Santu and Venkatesh, Svetha},
booktitle = {Proceedings of the AAAI Conference on Artificial Intelligence},
year = {2020},
volume = {34},
number = {03},
pages = {2425--2432},
doi = {10.1609/aaai.v34i03.5623},
url = {https://doi.org/10.1609/aaai.v34i03.5623}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2020 | 2 | |
| 2021 | 2 | |
| 2022 | 2 | |
| 2023 | 2 | |
| 2024 | 2 | |
| 2025 | 4 | |
| 2026 | 2 |
Its field-weighted citation impact is 2.50: it has been cited 2.50 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- low-dimensional subspace
- convergence rate
- computational budget
- sample efficiency
- non-convex optimization
Work with this paper
Most-cited papers in Decision Sciences
- The PRISMA 2020 statement: an updated guideline for reporting systematic reviewsMatthew James Page, Joanne E. McKenzie, Patrick M. Bossuyt and 23 more · BMJ · 2021 · 144,919 citations
- Evaluating Structural Equation Models with Unobservable Variables and Measurement ErrorClaes Fornell, David F. Larcker · Journal of Marketing Research · 1981 · 118,336 citations
- Cutoff criteria for fit indexes in covariance structure analysis: Conventional criteria versus new alternativesLi‐tze Hu, Peter M. Bentler · Structural Equation Modeling A Multidisciplinary Journal · 1999 · 117,461 citations
- Common method biases in behavioral research: A critical review of the literature and recommended remedies.Philip M. Podsakoff, SCOTT B. MACKENZIE, Jeong Yeon Lee and 1 more · Journal of Applied Psychology · 2003 · 89,248 citations
- Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statementDavid Moher, Alessandro Liberati, Jennifer Tetzlaff and 2 more · BMJ · 2009 · 85,524 citations
Questions about this paper
How do I cite this paper in APA style?
Tran-The, H., Gupta, S., Rana, S., & Venkatesh, S. (2020). Trading Convergence Rate with Computational Budget in High Dimensional Bayesian Optimization. Proceedings of the AAAI Conference on Artificial Intelligence, 34(03), 2425–2432. https://doi.org/10.1609/aaai.v34i03.5623
How many times has this paper been cited?
16 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 Proceedings of the AAAI Conference on Artificial Intelligence: sign in and open the full text from this page.
Who wrote this paper?
Hung Tran-The, Sunil Gupta, Santu Rana, Svetha Venkatesh.
What is the DOI of this paper?
10.1609/aaai.v34i03.5623, permanently at https://doi.org/10.1609/aaai.v34i03.5623. 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.