Award Abstract # 1254298
CAREER: Methodology for Optimization via Simulation: Bayesian Methods, Frequentist Guarantees, and Applications to Cardiovascular Medicine

NSF Org: CMMI
Division of Civil, Mechanical, and Manufacturing Innovation
Recipient: CORNELL UNIVERSITY
Initial Amendment Date: December 18, 2012
Latest Amendment Date: December 18, 2012
Award Number: 1254298
Award Instrument: Standard Grant
Program Manager: Georgia-Ann Klutke
CMMI
 Division of Civil, Mechanical, and Manufacturing Innovation
ENG
 Directorate for Engineering
Start Date: July 1, 2013
End Date: June 30, 2019 (Estimated)
Total Intended Award Amount: $400,000.00
Total Awarded Amount to Date: $400,000.00
Funds Obligated to Date: FY 2013 = $400,000.00
History of Investigator:
  • Peter Frazier (Principal Investigator)
    pf98@cornell.edu
Recipient Sponsored Research Office: Cornell University
341 PINE TREE RD
ITHACA
NY  US  14850-2820
(607)255-5014
Sponsor Congressional District: 19
Primary Place of Performance: Cornell University
232 Rhodes Hall
Ithaca
NY  US  14853-7501
Primary Place of Performance
Congressional District:
19
Unique Entity Identifier (UEI): G56PUALJ3KT5
Parent UEI:
NSF Program(s): SERVICE ENTERPRISE SYSTEMS,
OPERATIONS RESEARCH
Primary Program Source: 01001314DB NSF RESEARCH & RELATED ACTIVIT
Program Reference Code(s): 076E, 078E, 1045, 1787, 5514, 8023
Program Element Code(s): 178700, 551400
Award Agency Code: 4900
Fund Agency Code: 4900
Assistance Listing Number(s): 47.041

ABSTRACT

The objective of this Faculty Early Career Development (CAREER) Program award is to develop improved methods for optimization via simulation, and to apply them to decision-making problems in cardiovascular medicine. Optimization via simulation is required whenever we wish to find the best among several options, and evaluating the quality of an option requires running a stochastic simulation. Two types of improved methods will be developed. First, methods for ranking and selection will be developed using a link between Bayesian average-case and frequentist worst-case performance. These methods promise to produce solutions more quickly than do existing methods, with frequentist statistical guarantees on solution quality that are tighter and whose form is more natural for engineering applications. Second, multistart gradient-based methods will be developed using Bayesian value of information analysis to efficiently allocate simulation effort across starts, allowing those starts more likely to have high-quality local optima to converge first. These methods promise to produce high-quality solutions more quickly than do existing approaches for allocating simulation effort across starts. The new methods will be demonstrated via application to two problems in cardiovascular medicine: the design of post-operative surveillance strategies for patients undergoing endovascular aneurysm repair; and the design and placement of grafts in patients undergoing bypass surgery.

If successful, this research will both serve as an enabling technology within operations research, and will have specific benefits within cardiovascular medicine. Better post-operative surveillance will allow problems occurring after surgery to be detected more quickly, reducing the risk of aneurysm rupture. Better graft design will improve the reliability and longevity of surgical repairs, improving patient health. More broadly, as an enabling technology, the improved simulation optimization methods developed with this award will allow practitioners and researchers to solve a wider variety of optimization via simulation problems with greater speed and accuracy.

PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH

Note:  When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

(Showing: 1 - 10 of 32)
B. Chen and P. I. Frazier "The Bayesian Linear Information Filtering Problem" IEEE International Conference on Tools with Artificial Intelligence (ICTAI) , 2016
B. Chen, P.I. Frazier "Dueling Bandits with Weak Regret" International Conference on Machine Learning (ICML) , 2017
B. Chen, P.I. Frazier "The Bayesian Linear Information Filtering Problem" IEEE International Conference on Tools with Artificial Intelligence (ICTAI) , 2016
B. Chen, P.I. Frazier, D. Kempe "Incentivizing Exploration with Heterogeneous Preferences" Conference on Learning Theory (COLT) , 2018
B. Yang and C. Cardie and P.I. Frazier "A Hierarchical Distance-dependent Bayesian Model for Event Coreference Resolution" Transactions of the Association for Computational Linguistics , v.3 , 2015 , p.517
I.O. Ryzhov and P.I. Frazier and W.B. Powell "A New Optimal Stepsize Rule for Approximate Dynamic Programming" IEEE Transactions on Automatic Control , v.60 , 2015 , p.743 00189286
J. Wu and P.I. Frazier "The Parallel Knowledge Gradient Method for Batch Bayesian Optimization" Neural Information Processing Systems (NIPS) , 2016
J. Wu, M.U. Poloczek, A.G. Wilson, P.I. Frazier, "Bayesian Optimization with Gradients" Neural Information Processing Systems (NIPS) , 2017
J. Wu, P.I. Frazier "Practical Two-Step Lookahead Bayesian Optimization" Neural Information Processing Systems (NeurIPS) , 2019
J. Wu, S. Toscano, A.G. Wilson, P.I. Frazier "Practical Multi-fidelity Bayesian Optimization of Iterative Machine Learning Algorithms" Conference on Uncertainty in Artificial Intelligence (UAI) , 2019
Lee, L.H. and Chew, E.P. and Frazier, P.I. and Jia, Q.S. and Chen, C.H. "Advances in Simulation Optimization and its Applications" IIE Transactions , v.45 , 2013 , p.683--684 10.1080/0740817X.2013.778709
(Showing: 1 - 10 of 32)

PROJECT OUTCOMES REPORT

Disclaimer

This Project Outcomes Report for the General Public is displayed verbatim as submitted by the Principal Investigator (PI) for this award. Any opinions, findings, and conclusions or recommendations expressed in this Report are those of the PI and do not necessarily reflect the views of the National Science Foundation; NSF has not approved or endorsed its content.

Research under this award designed new Bayesian optimization (BayesOpt) methods that better optimize slow-to-evaluate black-box functions. The mathematical tools created by this research support better decisions in medicine, materials science, transportation, logistics, e-commerce, aerospace, and neural network design. This research also contributed to the creation of a startup company, SigOpt, which provides enterprise BayesOpt software. This research has also has been incorporated into two widely used open-source BayesOpt software packages, Yelp's Metrics Optimization Engine and Facebook's BoTorch.

To illustrate the optimization problems considered by this award, consider using a patient-specific cardiovascular simulator to support coronary bypass surgery. The long-term success of the surgery (the "objective function", or "objective") as predicted by the simulator depends on the design of the bypass graft: the position and angle at which each end of the graft attaches to the artery. We can evaluate graft designs in the simulator and use the best one evaluated in surgery.

Unfortunately, complex simulators often require hours of computer time per evaluation. This and a deadline on graft selection limits the number of evaluations we can perform. As a result, we can evaluate only a small fraction of the search space, potentially missing the best designs.

Compounding the challenge, a complex simulator's output often depends on its input in a non-convex "bumpy" way. Classical hill-climbing approaches may get stuck on a solution that is substantially worse than the global best. Moreover, complex simulators often do not calculate derivatives, requiring such hill-climbing approaches to use many simulator evaluations to approximate them. Black-box methods like genetic algorithms deal well with non-convex objective functions and do not require derivatives but typically require too many evaluations for slow-to-evaluate simulators.

This award developed new BayesOpt methods for optimizing functions calculated by cardiovascular bypass graft simulators and other complex slow-to-evaluate non-convex functions. They can also be used to optimize functions that are evaluated using physical experiments, as in materials design and drug discovery.

BayesOpt uses machine learning to predict the objective function at unevaluated inputs. It then uses this prediction (with uncertainty) to define an "acquisition function" quantifying the value of the information from evaluating the objective function at a new point. By evaluating at points providing the most valuable information (which can be found efficiently because acquisition functions often evaluate quickly and provide derivatives) we can find a good solution to our optimization problem with few evaluations. The figure illustrates this.

Intellectual Merit: The research supported by this award has created new methods and analyses for BayesOpt and two other closely-related problems: multi-armed bandits and ranking and selection. Highlights include:

  • Grey-box BayesOpt: Historically, BayesOpt has treated the objective function as a black box. This research showed that query efficiency can be substantially improved by "looking inside the box", i.e., by using knowledge of how the objective function is computed. This research developed grey-box methods for these settings: objectives with derivative observations; objectives that are sums or integrals of the outputs of a slow-to-evaluate black box function; objectives that are compositions of a known function and a vector-valued black box function (important in simulator calibration and inverse reinforcement learning); and objective functions that produce "traces", i.e., timeseries that converge to the objective function value, as produced in neural network design.
  • Parallel BayesOpt: This research developed a new efficient approach to optimizing Monte Carlo acquisition functions. This enabled development of two new query-efficient parallel BayesOpt methods now widely used in practice.
  • Multi-Information Source BayesOpt: Multi-information source optimization (MISO) leverages other sources of information that are faster to evaluate than our objective but provide noisy biased estimates. For example, when optimizing a prediction from a partial differential equation, we may predict more quickly but less accurately using a coarser mesh or a simpler partial differential equation. This research developed new BayesOpt methods for MISO.
  • Large-scale Ranking and Selection (R&S): This research developed new R&S methods that have theoretical performance guarantees and scale to large problems.

Broader Impact: The research in this award has led to applied work with broader impact in materials science, transportation, e-commerce, finance, aerospace, and neural network design. This impact has arisen directly through the PI and others using the methods developed and through the broader application of BayesOpt facilitated by the software development (Metrics Optimization Engine, BoTorch) and startup company (SigOpt) resulting from this research and from a widely read tutorial article written by the PI and an associated video.

Methods, examples, and insights from this research were incorporated into several courses taught at Cornell: ORIE 3120 "Practical Tools in Operations Research, Machine Learning and Data Science"; ORIE 6750 "Optimal Learning"; and a 1-week computational laboratory focused on optimization in medical decision-making and healthcare operations for female high school students within Cornell's CURIE Academy summer program. This research also provided training opportunities for 13 PhD students, 1 Masters student, and 10 undergraduates.

 


Last Modified: 03/26/2020
Modified by: Peter I Frazier

Please report errors in award information by writing to: awardsearch@nsf.gov.

Print this page

Back to Top of page