Consistency of a myopic Bayesian algorithm for one-dimensional global optimization

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

A sequential Bayesian method for finding the maximum of a function based on myopically minimizing the expected dispersion of conditional probabilities is described. It is shown by example that an algorithm that generates a dense set of observations need not converge to the correct answer for some priors on continuous functions on the unit interval. For the Brownian motion prior the myopic algorithm is consistent; for any continuous function, the conditional probabilities converge weakly to a point mass at the true maximum.

Original languageEnglish (US)
Pages (from-to)223-232
Number of pages10
JournalJournal of Global Optimization
Volume3
Issue number2
DOIs
StatePublished - Jun 1 1993
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Management Science and Operations Research
  • Control and Optimization
  • Applied Mathematics

Keywords

  • Bayesian optimization
  • consistency

Fingerprint Dive into the research topics of 'Consistency of a myopic Bayesian algorithm for one-dimensional global optimization'. Together they form a unique fingerprint.

Cite this