We develop a framework for warm-starting Bayesian optimization, that reduces the solution time required to solve an optimization problem that is one in a sequence of related problems. This is useful when optimizing the output of a stochastic simulator that fails to provide derivative information, for which Bayesian optimization methods are well-suited. Solving sequences of related optimization problems arises when making several business decisions using one optimization model and input data collected over different time periods or markets. While many gradient-based methods can be warm started by initiating optimization at the solution to the previous problem, this warm start approach does not apply to Bayesian optimization methods, which carry a full metamodel of the objective function from iteration to iteration. Our approach builds a joint statistical model of the entire collection of related objective functions, and uses a value of information calculation to recommend points to evaluate.
Warm starting Bayesian optimization
Matthias Poloczek,Jialei Wang,P. Frazier
Published 2016 in Online World Conference on Soft Computing in Industrial Applications
ABSTRACT
PUBLICATION RECORD
- Publication year
2016
- Venue
Online World Conference on Soft Computing in Industrial Applications
- Publication date
2016-08-11
- Fields of study
Mathematics, Business, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-24 of 24 references · Page 1 of 1
CITED BY
Showing 1-69 of 69 citing papers · Page 1 of 1