Dissertation · 2019 · Open access
Robust Adaptive Decision Making: Bayesian Optimization and Beyond
Infoscience (Ecole Polytechnique Fédérale de Lausanne) · Published 1 January 2019 · DOI 10.5075/epfl-thesis-9147
In brief
“Robust Adaptive Decision Making: Bayesian Optimization and Beyond” is a 2019 dissertation by Ilija Bogunovic, published in Infoscience (Ecole Polytechnique Fédérale de Lausanne). OpenAlex counts 1 citations as of 19 November 2026. It is open access: the full text is free to read at Infoscience (Ecole Polytechnique Fédérale de Lausanne).
- Citations
- 1
- Most cited in
- 2019 (1)
- References
- 114
- Authors
- 1
Abstract
The central task in many interactive machine learning systems can be formalized as the sequential optimization of a black-box function. Bayesian optimization (BO) is a powerful model-based framework for \emph{adaptive} experimentation, where the primary goal is the optimization of the black-box function via sequentially chosen decisions. In many real-world tasks, it is essential for the decisions to be \emph{robust} against, e.g., adversarial failures and perturbations, dynamic and time-varying phenomena, a mismatch between simulations and reality, etc. Under such requirements, the standard methods and BO algorithms become inadequate. In this dissertation, we consider four research directions with the goal of enhancing robust and adaptive decision making in BO and associated problems. First, we study the related problem of level-set estimation (LSE) with Gaussian Processes (GPs). While in BO the goal is to find a maximizer of the unknown function, in LSE one seeks to find all "sufficiently good" solutions. We propose an efficient confidence-bound based algorithm that treats BO and LSE in a unified fashion. It is effective in settings that are non-trivial to incorporate into existing algorithms, including cases with pointwise costs, heteroscedastic noise, and multi-fidelity setting. Our main result is a general regret guarantee that covers these aspects. Next, we consider GP optimization with robustness requirement: An adversary may perturb the returned design, and so we seek to find a robust maximizer in the case this occurs. This requirement is motivated by, e.g., settings where the functions during optimization and implementation stages are different. We propose a novel robust confidence-bound based algorithm. The rigorous regret guarantees for this algorithm are established and complemented with an algorithm-independent lower bound. We experimentally demonstrate that our robust approach consistently succeeds in finding a robust maximizer while standard BO methods fail. We then investigate the problem of GP optimization in which the reward function varies with time. The setting is motivated by many practical applications in which the function to be optimized is not static. We model the unknown reward function via a GP whose evolution obeys a simple Markov model. Two confidence-bound based algorithms with the ability to "forget" about old data are proposed. We obtain regret bounds for these algorithms that jointly depend on the time horizon and the rate at which the function varies. Finally, we consider the maximization of a set function subject to a cardinality constraint $k$ in the case a number of items $\tau$ from the returned set may be removed. One notable application is in batch BO where we need to select experiments to run, but…
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Bogunovic, I. (2019). Robust Adaptive Decision Making: Bayesian Optimization and Beyond. Infoscience (Ecole Polytechnique Fédérale de Lausanne). https://doi.org/10.5075/epfl-thesis-9147
MLA 9
Bogunovic, Ilija. “Robust Adaptive Decision Making: Bayesian Optimization and Beyond.” Infoscience (Ecole Polytechnique Fédérale de Lausanne), 2019. https://doi.org/10.5075/epfl-thesis-9147.
Chicago
Bogunovic, Ilija. 2019. “Robust Adaptive Decision Making: Bayesian Optimization and Beyond.” Infoscience (Ecole Polytechnique Fédérale de Lausanne). https://doi.org/10.5075/epfl-thesis-9147.
Harvard
Bogunovic, I. (2019) ‘Robust Adaptive Decision Making: Bayesian Optimization and Beyond’, Infoscience (Ecole Polytechnique Fédérale de Lausanne). doi:10.5075/epfl-thesis-9147.
IEEE
I. Bogunovic, “Robust Adaptive Decision Making: Bayesian Optimization and Beyond,” Infoscience (Ecole Polytechnique Fédérale de Lausanne), 2019, doi: 10.5075/epfl-thesis-9147.
BibTeX
@phdthesis{bogunovic2019robust,
title = {{Robust Adaptive Decision Making: Bayesian Optimization and Beyond}},
author = {Bogunovic, Ilija},
year = {2019},
doi = {10.5075/epfl-thesis-9147},
url = {https://doi.org/10.5075/epfl-thesis-9147}
}
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
- robust optimization
- level set estimation
- Gaussian processes
- confidence limits
- regret bounds
- adversarial perturbations
- Markov processes
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?
Bogunovic, I. (2019). Robust Adaptive Decision Making: Bayesian Optimization and Beyond. Infoscience (Ecole Polytechnique Fédérale de Lausanne). https://doi.org/10.5075/epfl-thesis-9147
How many times has this paper been cited?
1 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 Infoscience (Ecole Polytechnique Fédérale de Lausanne): sign in and open the full text from this page.
Who wrote this paper?
Ilija Bogunovic.
What is the DOI of this paper?
10.5075/epfl-thesis-9147, permanently at https://doi.org/10.5075/epfl-thesis-9147. 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.