<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T08:47:23Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/70478" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/70478</identifier><datestamp>2026-05-15T19:44:44Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Toscano Palmerin, Saul</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair">Frazier, Peter</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Henderson, Shane</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember">Bindel, David</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2020-08-10T20:24:49Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2020-08-10T20:24:49Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2020-05</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 11869</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 27670989</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/70478</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/3f24-n006</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">13254527</dim:field>
   <dim:field mdschema="dc" element="description">184 pages</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="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.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="subject">Bayesian optimization</dim:field>
   <dim:field mdschema="dc" element="subject">black-box optimization</dim:field>
   <dim:field mdschema="dc" element="subject">Gaussian process</dim:field>
   <dim:field mdschema="dc" element="title">Grey-Box Bayesian Optimization: Improving Performance by Looking Inside the Black-Box</dim:field>
   <dim:field mdschema="dc" element="type">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="localuri">https://catalog.library.cornell.edu/catalog/13254527</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Operations Research and Information Engineering</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Operations Research and Information Engineering</dim:field>
   <dim:field mdschema="dcterms" element="license">https://hdl.handle.net/1813/59810</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Toscano Palmerin, Saul</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="ab387b56-3cd1-4fde-acc1-634e5cd7d37d">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en&lt;/Language>
   	&lt;Title>Grey-Box Bayesian Optimization: Improving Performance by Looking Inside the Black-Box&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2020-05&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/3f24-n006&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Toscano Palmerin, Saul&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>Bayesian optimization&lt;/Keyword>
    &lt;Keyword>black-box optimization&lt;/Keyword>
    &lt;Keyword>Gaussian process&lt;/Keyword>
   	&lt;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.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>