Preprint · 2019 · Open access

Bayesian Search for Robust Optima

Nicholas D. Sanders, Richard Everson, Jonathan Edward Fieldsend, Alma Rahat

arXiv (Cornell University) · Published 25 April 2019 · DOI 10.48550/arxiv.1904.11416

Open PDFView at the publisherCite this paper

In brief

“Bayesian Search for Robust Optima” is a 2019 preprint by Nicholas D. Sanders and 3 co-authors, published in arXiv (Cornell University). OpenAlex counts 9 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
9
Most cited in
2021 (3)
References
38
Authors
4

Abstract

Many expensive black-box optimisation problems are sensitive to their inputs. In these problems it makes more sense to locate a region of good designs, than a single-possibly fragile-optimal design. Expensive black-box functions can be optimised effectively with Bayesian optimisation, where a Gaussian process is a popular choice as a prior over the expensive function. We propose a method for robust optimisation using Bayesian optimisation to find a region of design space in which the expensive function's performance is relatively insensitive to the inputs whilst retaining a good quality. This is achieved by sampling realisations from a Gaussian process that is modelling the expensive function, and evaluating the improvement for each realisation. The expectation of these improvements can be optimised cheaply with an evolutionary algorithm to determine the next location at which to evaluate the expensive function. We describe an efficient process to locate the optimum expected improvement. We show empirically that evaluating the expensive function at the location in the candidate uncertainty region about which the model is most uncertain, or at random, yield the best convergence in contrast to exploitative schemes. We illustrate our method on six test functions in two, five, and ten dimensions, and demonstrate that it is able to outperform two state-of-the-art approaches from the literature. We also demonstrate our method one two real-world problems in 4 and 8 dimensions, which involve training robot arms to push objects onto targets.

Cite this paper

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

APA 7

Sanders, N. D., Everson, R., Fieldsend, J. E., & Rahat, A. (2019). Bayesian Search for Robust Optima. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1904.11416

MLA 9

Sanders, Nicholas D., et al. “Bayesian Search for Robust Optima.” arXiv (Cornell University), 2019. https://doi.org/10.48550/arxiv.1904.11416.

Chicago

Sanders, Nicholas D., Richard Everson, Jonathan Edward Fieldsend, and Alma Rahat. 2019. “Bayesian Search for Robust Optima.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1904.11416.

Harvard

Sanders, N. D. et al. (2019) ‘Bayesian Search for Robust Optima’, arXiv (Cornell University). doi:10.48550/arxiv.1904.11416.

IEEE

N. D. Sanders, R. Everson, J. E. Fieldsend, and A. Rahat, “Bayesian Search for Robust Optima,” arXiv (Cornell University), 2019, doi: 10.48550/arxiv.1904.11416.

BibTeX

@misc{sanders2019bayesian,
  title     = {{Bayesian Search for Robust Optima}},
  author    = {Sanders, Nicholas D. and Everson, Richard and Fieldsend, Jonathan Edward and Rahat, Alma},
  howpublished = {arXiv (Cornell University)},
  year      = {2019},
  doi       = {10.48550/arxiv.1904.11416},
  url       = {https://doi.org/10.48550/arxiv.1904.11416}
}

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

Citations by year

YearCitationsShare of the best year
202011
202133
202322
202422
202511

Topic and keywords

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

  • robust optimization
  • Bayesian optimization
  • Gaussian processes
  • black-box optimization
  • expensive function evaluations
  • expected improvement
  • evolutionary algorithms
  • uncertainty regions

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?

Sanders, N. D., Everson, R., Fieldsend, J. E., & Rahat, A. (2019). Bayesian Search for Robust Optima. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1904.11416

How many times has this paper been cited?

9 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?

Nicholas D. Sanders, Richard Everson, Jonathan Edward Fieldsend, Alma Rahat.

What is the DOI of this paper?

10.48550/arxiv.1904.11416, permanently at https://doi.org/10.48550/arxiv.1904.11416. 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.