Preprint · 2020 · Open access

Noisy-Input Entropy Search for Efficient Robust Bayesian Optimization

Lukas P. Fröhlich, Edgar D. Klenske, Julia Vinogradska, Christian Daniel, Melanie N. Zeilinger

arXiv (Cornell University), 108, 2262–2272 · Published 7 February 2020 · DOI 10.48550/arxiv.2002.02820

Open PDFView at the publisherCite this paper

In brief

“Noisy-Input Entropy Search for Efficient Robust Bayesian Optimization” is a 2020 preprint by Lukas P. Fröhlich and 4 co-authors, published in arXiv (Cornell University). OpenAlex counts 46 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
46
Most cited in
2022 (11)
References
38
Authors
5

Abstract

We consider the problem of robust optimization within the well-established Bayesian optimization (BO) framework. While BO is intrinsically robust to noisy evaluations of the objective function, standard approaches do not consider the case of uncertainty about the input parameters. In this paper, we propose Noisy-Input Entropy Search (NES), a novel information-theoretic acquisition function that is designed to find robust optima for problems with both input and measurement noise. NES is based on the key insight that the robust objective in many cases can be modeled as a Gaussian process, however, it cannot be observed directly. We evaluate NES on several benchmark problems from the optimization literature and from engineering. The results show that NES reliably finds robust optima, outperforming existing methods from the literature on all benchmarks.

Cite this paper

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

APA 7

Fröhlich, L. P., Klenske, E. D., Vinogradska, J., Daniel, C., & Zeilinger, M. N. (2020). Noisy-Input Entropy Search for Efficient Robust Bayesian Optimization. arXiv (Cornell University), 108, 2262–2272. https://doi.org/10.48550/arxiv.2002.02820

MLA 9

Fröhlich, Lukas P., et al. “Noisy-Input Entropy Search for Efficient Robust Bayesian Optimization.” arXiv (Cornell University), vol. 108, 2020, pp. 2262–2272. https://doi.org/10.48550/arxiv.2002.02820.

Chicago

Fröhlich, Lukas P., Edgar D. Klenske, Julia Vinogradska, Christian Daniel, and Melanie N. Zeilinger. 2020. “Noisy-Input Entropy Search for Efficient Robust Bayesian Optimization.” arXiv (Cornell University) 108: 2262–2272. https://doi.org/10.48550/arxiv.2002.02820.

Harvard

Fröhlich, L. P. et al. (2020) ‘Noisy-Input Entropy Search for Efficient Robust Bayesian Optimization’, arXiv (Cornell University), 108, pp. 2262–2272. doi:10.48550/arxiv.2002.02820.

IEEE

L. P. Fröhlich, E. D. Klenske, J. Vinogradska, C. Daniel, and M. N. Zeilinger, “Noisy-Input Entropy Search for Efficient Robust Bayesian Optimization,” arXiv (Cornell University), vol. 108, pp. 2262–2272, 2020, doi: 10.48550/arxiv.2002.02820.

BibTeX

@misc{frohlich2020noisy,
  title     = {{Noisy-Input Entropy Search for Efficient Robust Bayesian Optimization}},
  author    = {Fröhlich, Lukas P. and Klenske, Edgar D. and Vinogradska, Julia and Daniel, Christian and Zeilinger, Melanie N.},
  howpublished = {arXiv (Cornell University)},
  year      = {2020},
  volume    = {108},
  pages     = {2262--2272},
  doi       = {10.48550/arxiv.2002.02820},
  url       = {https://doi.org/10.48550/arxiv.2002.02820}
}

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

Citations by year

YearCitationsShare of the best year
202033
202166
20221111
202322
202499
20251010
202655

Topic and keywords

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

  • acquisition functions
  • measurement noise
  • Kriging surrogate model
  • information-theoretic optimization
  • noisy objective functions

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?

Fröhlich, L. P., Klenske, E. D., Vinogradska, J., Daniel, C., & Zeilinger, M. N. (2020). Noisy-Input Entropy Search for Efficient Robust Bayesian Optimization. arXiv (Cornell University), 108, 2262–2272. https://doi.org/10.48550/arxiv.2002.02820

How many times has this paper been cited?

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

Lukas P. Fröhlich, Edgar D. Klenske, Julia Vinogradska, Christian Daniel, Melanie N. Zeilinger.

What is the DOI of this paper?

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