Conference paper · 2020 · Open access
Confidence Bound Minimization for Bayesian optimization with Student's-t Processes
Applications Intelligent Systems, 1–5 · Published 7 January 2020 · DOI 10.1145/3378184.3378193
In brief
“Confidence Bound Minimization for Bayesian optimization with Student's-t Processes” is a 2020 conference paper by Conor Clare and 3 co-authors, published in Applications Intelligent Systems. OpenAlex counts 2 citations as of 19 November 2026. It is open access: the full text is free to read at Applications Intelligent Systems.
- Citations
- 2
- Most cited in
- 2020 (1)
- Field-weighted impact
- 0.31
- References
- 18
- Authors
- 4
Abstract
Bayesian optimization seeks the global optimum of a black-box, objective function f (x), in the fewest possible iterations. Recent work applied knowledge of the true value of the optimum to the Gaussian Process probabilistic model typically used in Bayesian optimization. This, together with a new acquisition function called Confidence Bound Minimization, resulted in a Gaussian probabilistic posterior in which the predictions were no greater than the known maximum (and no less than for minimum). Our novel work applies Confidence Bound Minimization to Bayesian optimization with Student's-t Processes, a probabilistic alternative which addresses known weaknesses in Gaussian Processes - outliers' probability and the calculation of posterior covariance. The new model is applied to the problem of hyperparameter tuning for an XGBoost classifier. Experiments show superior regret minimization and predictive accuracy, versus the popular Expected Improvement acquisition function. Combining Confidence Bound Minimization with a transformed Student's-t Process probabilistic model and known optima produces superior training regret minimization and posterior predictions for the Six-Hump Camel(2D) and Levy(4D) benchmark problems, which do not fall below true minima.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Clare, C., Hawe, G. I., Lin, Z., & McClean, S. I. (2020). Confidence Bound Minimization for Bayesian optimization with Student's-t Processes. Applications Intelligent Systems, 1–5. https://doi.org/10.1145/3378184.3378193
MLA 9
Clare, Conor, et al. “Confidence Bound Minimization for Bayesian optimization with Student's-t Processes.” Applications Intelligent Systems, 2020, pp. 1–5. https://doi.org/10.1145/3378184.3378193.
Chicago
Clare, Conor, Glenn I. Hawe, Zhiwei Lin, and Sally I. McClean. 2020. “Confidence Bound Minimization for Bayesian optimization with Student's-t Processes.” Applications Intelligent Systems: 1–5. https://doi.org/10.1145/3378184.3378193.
Harvard
Clare, C. et al. (2020) ‘Confidence Bound Minimization for Bayesian optimization with Student's-t Processes’, Applications Intelligent Systems, pp. 1–5. doi:10.1145/3378184.3378193.
IEEE
C. Clare, G. I. Hawe, Z. Lin, and S. I. McClean, “Confidence Bound Minimization for Bayesian optimization with Student's-t Processes,” Applications Intelligent Systems, pp. 1–5, 2020, doi: 10.1145/3378184.3378193.
BibTeX
@inproceedings{clare2020confidence,
title = {{Confidence Bound Minimization for Bayesian optimization with Student's-t Processes}},
author = {Clare, Conor and Hawe, Glenn I. and Lin, Zhiwei and McClean, Sally I.},
booktitle = {Applications Intelligent Systems},
year = {2020},
pages = {1--5},
doi = {10.1145/3378184.3378193},
url = {https://doi.org/10.1145/3378184.3378193}
}
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
- acquisition functions
- black-box optimization
- hyperparameter optimization
- XGBoost
- regret minimization
- outliers
- posterior covariance
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?
Clare, C., Hawe, G. I., Lin, Z., & McClean, S. I. (2020). Confidence Bound Minimization for Bayesian optimization with Student's-t Processes. Applications Intelligent Systems, 1–5. https://doi.org/10.1145/3378184.3378193
How many times has this paper been cited?
2 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 Applications Intelligent Systems: sign in and open the PDF from this page.
Who wrote this paper?
Conor Clare, Glenn I. Hawe, Zhiwei Lin, Sally I. McClean.
What is the DOI of this paper?
10.1145/3378184.3378193, permanently at https://doi.org/10.1145/3378184.3378193. 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.