MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Bayesian optimization with a finite budget: An approximate dynamic programming approach

Author(s)
Wolpert, David H.; Lam, Remi Roger Alain Paul; Willcox, Karen E
Thumbnail
Download6188-bayesian-optimization-with-a-finite-budget-an-approximate-dynamic-programming-approach.pdf (402.7Kb)
PUBLISHER_POLICY

Publisher Policy

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.

Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
We consider the problem of optimizing an expensive objective function when a finite budget of total evaluations is prescribed. In that context, the optimal solution strategy for Bayesian optimization can be formulated as a dynamic programming instance. This results in a complex problem with uncountable, dimension-increasing state space and an uncountable control space. We show how to approximate the solution of this dynamic programming problem using rollout, and propose rollout heuristics specifically designed for the Bayesian optimization setting. We present numerical experiments showing that the resulting algorithm for optimization with a finite budget outperforms several popular Bayesian optimization algorithms.
Date issued
2016-12
URI
http://hdl.handle.net/1721.1/115164
Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Journal
Advances in Neural Information Processing Systems 29 (NIPS 2016)
Publisher
Neural Information Processing Systems Foundation
Citation
Lam, Rem, Karen Willcox, and David H. Wolpert. "Bayesian Optimization with a Finite Budget: An Approximate Dynamic Programming Approach." Advances in Neural Information Processing Systems 29 (NIPS 2016), 5-12 December, 2016, Barcelona, Spain, Neural Information Processing Systems Foundation, 2016. © 2016 NIPS Foundation
Version: Final published version

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.