Bayesian optimization with empirical constraints Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/6d570056c

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • Bayesian Optimization (BO) methods are often used to optimize an unknown function f(•) that is costly to evaluate. They typically work in an iterative manner. In each iteration, given a set of observation points, BO algorithms select k ≥ 1 points to be evaluated. The results of those points are then added to the set of observations and the procedure is repeated until a stopping criterion is met. The goal is to optimize the function f(•) with a small number of experiment evaluations. While this problem has been extensively studied, most existing approaches ignored some real world constraints frequently encountered in practical applications. In this thesis, we extend the BO framework in a number of important directions to incorporate some of these constraints. First, we introduce a constrained BO framework where instead of selecting a precise point at each iteration, we request a constrained experiment that is characterized by a hyper-rectangle in the input space. We introduce efficient sequential and non-sequential algorithms to select a set of constrained experiments that best optimize f(•) within a given budget. Second, we introduce one of the first attempts in batch BO where instead of selecting one experiment at each iteration, a set of k > 1 experiments is selected. This can significantly speedup the overall running time of BO. Third, we introduce scheduling algorithms for the BO framework when: 1) it is possible to run concurrent experiments; 2) the durations of experiments are stochastic, but with a known distribution; and 3) there is a limited number of experiments to run in a fixed amount of time. We propose both online and offline scheduling algorithms that effectively handle these constraints. Finally, we introduce a hybrid BO approach which switches between the sequential and batch mode. The proposed hybrid approach provides us with a substantial speedup against sequential policies without significant performance loss.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Committee Member
Academic Affiliation
Non-Academic Affiliation
Keyword
Subject
Rights Statement
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Approved for entry into archive by Julie Kurtz(julie.kurtz@oregonstate.edu) on 2012-09-19T16:49:15Z (GMT) No. of bitstreams: 1 Javad Azimi-PhD Dissertation.pdf: 1334089 bytes, checksum: 4a1ee0f47005b672e9fb6e1bf6e4ac1d (MD5)
  • description.provenance : Submitted by Javad Azimi (azimij@onid.orst.edu) on 2012-09-14T19:06:20Z No. of bitstreams: 1 Javad Azimi-PhD Dissertation.pdf: 1334089 bytes, checksum: 4a1ee0f47005b672e9fb6e1bf6e4ac1d (MD5)
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2012-09-19T20:54:26Z (GMT) No. of bitstreams: 1 Javad Azimi-PhD Dissertation.pdf: 1334089 bytes, checksum: 4a1ee0f47005b672e9fb6e1bf6e4ac1d (MD5)
  • description.provenance : Made available in DSpace on 2012-09-19T20:54:26Z (GMT). No. of bitstreams: 1 Javad Azimi-PhD Dissertation.pdf: 1334089 bytes, checksum: 4a1ee0f47005b672e9fb6e1bf6e4ac1d (MD5) Previous issue date: 2012-09-05

Relationships

In Administrative Set:
Last modified: 08/15/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items