Cornell University
Grey-Box Bayesian Optimization: Improving Performance by Looking Inside the Black-Box
Abstract
dc:description.abstractNon-convex time-consuming objectives are often optimized using “black-box” optimization. These approaches assume very little about the objective. While broadly applicable, these approaches typically require more evaluations than methods exploiting more problem structure. In particular, often, we can acquire information about the objective function in ways other than direct evaluation, which is less time-consuming than evaluating the objective directly. This allows us to develop novel Bayesian optimization algorithms that outperform methods that rely only objective function evaluations. In this thesis, we consider three problems: optimization of sum and integrals of expensive-to-evaluate integrands; optimizing hyperparameters for iteratively trained supervised learning machine learning algorithms; and optimizing non-convex functions with a new efficient multistart stochastic gradient descent algorithm.
Degree
thesis:*- Name thesis:degree_name
- Ph. D., Operations Research and Information Engineering
- Level thesis:degree_level
- Doctor of Philosophy
- Discipline thesis:degree_discipline
- Operations Research and Information Engineering
- Grantor
- Cornell University
- Year dc:date.issued
- 2020
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Toscano Palmerin, Saul
- Chair dc:contributor.chair
-
- Frazier, Peter
- Committee members dc:contributor.committeemember
-
- Henderson, Shane
- Bindel, David
Subjects
dc:subject × 3Rights
- Language dc:language.iso
- en
Identifiers
dc:identifier.*- Dc Identifier Bibid
- 13254527
- Dc Identifier Other
-
ProQuest Submission ID: 11869
ProQuest Publication ID: 27670989