{"id":{"repo_id":"cornell","oai_identifier":"oai:ecommons.cornell.edu:1813/70478"},"canonical_url":"https://search.ndltd.org/etd/cornell/oai:ecommons.cornell.edu:1813/70478","repository":{"repo_id":"cornell","name":"Cornell University","base_url":"https://ecommons.cornell.edu/server/oai/request"},"display":{"title":"Grey-Box Bayesian Optimization: Improving Performance by Looking Inside the Black-Box","abstract":"Non-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.","abstract_html":"Non-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.","abstract_has_math":false,"creators":["Toscano Palmerin, Saul"],"institution":"Cornell University","degree_name":"Ph. D., Operations Research and Information Engineering","degree_level":"Doctor of Philosophy","degree_discipline":"Operations Research and Information Engineering","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":["Frazier, Peter"],"committee_members":["Henderson, Shane","Bindel, David"],"year":2020,"date_issued":"2020-05","date_published":"2020-05","updated_at":"2026-11-19T03:21:11Z","subjects":["Bayesian optimization","black-box optimization","Gaussian process"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/3f24-n006"],"render_values":[{"text":"https://doi.org/10.7298/3f24-n006","href":"https://doi.org/10.7298/3f24-n006","code":true}]},{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["13254527"],"render_values":[{"text":"13254527","href":null,"code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 11869","ProQuest Publication ID: 27670989"],"render_values":[{"text":"ProQuest Submission ID: 11869","href":null,"code":true},{"text":"ProQuest Publication ID: 27670989","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1813/70478","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/1813/70478","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://ecommons.cornell.edu/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aecommons.cornell.edu%3A1813%2F70478","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.chair","label":"Chair","values":["Frazier, Peter"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Henderson, Shane","Bindel, David"]},{"key":"dc:creator","label":"Author","values":["Toscano Palmerin, Saul"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2020-08-10T20:24:49Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2020-08-10T20:24:49Z"]},{"key":"dc:date.issued","label":"Date","values":["2020-05"]},{"key":"dc:relation.uri","label":"Dc Relation URI","values":["https://catalog.library.cornell.edu/catalog/13254527"]},{"key":"dc:type","label":"Dc Type","values":["dissertation or thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Operations Research and Information Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctor of Philosophy"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph. D., Operations Research and Information Engineering"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Cornell University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Bayesian optimization","black-box optimization","Gaussian process"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["13254527"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/3f24-n006"]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 11869","ProQuest Publication ID: 27670989"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1813/70478"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"cerif:openaire","label":"Cerif Openaire","values":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"ab387b56-3cd1-4fde-acc1-634e5cd7d37d\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en</Language> <Title>Grey-Box Bayesian Optimization: Improving Performance by Looking Inside the Black-Box</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2020-05</PublicationDate> <DOI>https://doi.org/10.7298/3f24-n006</DOI> <Authors> <Author> <DisplayName>Toscano Palmerin, Saul</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>Bayesian optimization</Keyword> <Keyword>black-box optimization</Keyword> <Keyword>Gaussian process</Keyword> <Abstract>Non-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.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"]},{"key":"cris:virtual.author","label":"Cris Virtual Author","values":["Toscano Palmerin, Saul"]},{"key":"cris:virtualsource.collection","label":"Cris Virtualsource Collection","values":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"]},{"key":"dc:description","label":"Description","values":["184 pages"]},{"key":"dc:description.abstract","label":"Abstract","values":["Non-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."]},{"key":"dc:description.collection","label":"Dc Description Collection","values":["Cornell Theses and Dissertations"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dcterms:license","label":"Dcterms License","values":["https://hdl.handle.net/1813/59810"]},{"key":"dc:title","label":"Title","values":["Grey-Box Bayesian Optimization: Improving Performance by Looking Inside the Black-Box"]},{"key":"dspace:entity.type","label":"Dspace Entity Type","values":["Publication"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"cerif:openaire":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"ab387b56-3cd1-4fde-acc1-634e5cd7d37d\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en</Language> <Title>Grey-Box Bayesian Optimization: Improving Performance by Looking Inside the Black-Box</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2020-05</PublicationDate> <DOI>https://doi.org/10.7298/3f24-n006</DOI> <Authors> <Author> <DisplayName>Toscano Palmerin, Saul</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>Bayesian optimization</Keyword> <Keyword>black-box optimization</Keyword> <Keyword>Gaussian process</Keyword> <Abstract>Non-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.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"],"cris:virtual.author":["Toscano Palmerin, Saul"],"cris:virtualsource.collection":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"],"dc:contributor.chair":["Frazier, Peter"],"dc:contributor.committeemember":["Henderson, Shane","Bindel, David"],"dc:creator":["Toscano Palmerin, Saul"],"dc:date.accessioned":["2020-08-10T20:24:49Z"],"dc:date.available":["2020-08-10T20:24:49Z"],"dc:date.issued":["2020-05"],"dc:description":["184 pages"],"dc:description.abstract":["Non-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."],"dc:description.collection":["Cornell Theses and Dissertations"],"dc:format.mimetype":["application/pdf"],"dc:identifier.bibid":["13254527"],"dc:identifier.doi":["https://doi.org/10.7298/3f24-n006"],"dc:identifier.other":["ProQuest Submission ID: 11869","ProQuest Publication ID: 27670989"],"dc:identifier.uri":["https://hdl.handle.net/1813/70478"],"dc:language.iso":["en"],"dc:relation.uri":["https://catalog.library.cornell.edu/catalog/13254527"],"dc:subject":["Bayesian optimization","black-box optimization","Gaussian process"],"dcterms:license":["https://hdl.handle.net/1813/59810"],"dc:title":["Grey-Box Bayesian Optimization: Improving Performance by Looking Inside the Black-Box"],"dc:type":["dissertation or thesis"],"dspace:entity.type":["Publication"],"others:access_status":["open.access"],"thesis:degree_discipline":["Operations Research and Information Engineering"],"thesis:degree_level":["Doctor of Philosophy"],"thesis:degree_name":["Ph. D., Operations Research and Information Engineering"],"thesis:institution_name":["Cornell University"]},"updated_at":"2026-11-19T03:21:11Z"}