Preprint · 2010 · Open access
A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning
arXiv (Cornell University) · Published 12 December 2010 · DOI 10.48550/arxiv.1012.2599
In brief
“A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning” is a 2010 preprint by Eric Brochu and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 3,285 citations as of 19 November 2026. It is open access under a public domain licence: the full text is free to read at arXiv (Cornell University).
- Citations
- 3,285
- Most cited in
- 2021 (400)
- References
- 99
- Authors
- 3
Abstract
We present a tutorial on Bayesian optimization, a method of finding the maximum of expensive cost functions. Bayesian optimization employs the Bayesian technique of setting a prior over the objective function and combining it with evidence to get a posterior function. This permits a utility-based selection of the next observation to make on the objective function, which must take into account both exploration (sampling from areas of high uncertainty) and exploitation (sampling areas likely to offer improvement over the current best observation). We also present two detailed extensions of Bayesian optimization, with experiments---active user modelling with preferences, and hierarchical reinforcement learning---and a discussion of the pros and cons of Bayesian optimization based on our experiences.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Brochu, E., Cora, V. M., & de Freitas, N. (2010). A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1012.2599
MLA 9
Brochu, Eric, et al. “A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning.” arXiv (Cornell University), 2010. https://doi.org/10.48550/arxiv.1012.2599.
Chicago
Brochu, Eric, Vlad M. Cora, and Nando de Freitas. 2010. “A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1012.2599.
Harvard
Brochu, E., Cora, V. M. and de Freitas, N. (2010) ‘A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning’, arXiv (Cornell University). doi:10.48550/arxiv.1012.2599.
IEEE
E. Brochu, V. M. Cora, and N. de Freitas, “A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning,” arXiv (Cornell University), 2010, doi: 10.48550/arxiv.1012.2599.
BibTeX
@misc{brochu2010tutorial,
title = {{A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning}},
author = {Brochu, Eric and Cora, Vlad M. and de Freitas, Nando},
howpublished = {arXiv (Cornell University)},
year = {2010},
doi = {10.48550/arxiv.1012.2599},
url = {https://doi.org/10.48550/arxiv.1012.2599}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 146 | |
| 2018 | 221 | |
| 2019 | 294 | |
| 2020 | 377 | |
| 2021 | 400 | |
| 2022 | 320 | |
| 2023 | 347 | |
| 2024 | 348 | |
| 2025 | 298 | |
| 2026 | 224 |
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- Bayesian optimization
- exploration-exploitation balance
- hierarchical reinforcement learning
- preference elicitation
- surrogate models
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?
Brochu, E., Cora, V. M., & de Freitas, N. (2010). A Tutorial on Bayesian Optimization of Expensive Cost Functions, with Application to Active User Modeling and Hierarchical Reinforcement Learning. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1012.2599
How many times has this paper been cited?
3,285 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 arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Eric Brochu, Vlad M. Cora, Nando de Freitas.
What is the DOI of this paper?
10.48550/arxiv.1012.2599, permanently at https://doi.org/10.48550/arxiv.1012.2599. 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.