<?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-22T09:54:13Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/116035" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/116035</identifier><datestamp>2026-05-15T19:51:49Z</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">Xie, Miaolan</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair" lang="en_US">Scheinberg, Katya</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Henderson, Shane</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Davis, Damek</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2024-11-05T19:47:35Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2024-11-05T19:47:35Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2024-05</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 14277</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 31242760</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/116035</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">https://doi.org/10.7298/bqzz-6h43</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">16575424</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">150 pages</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Solving real-world stochastic optimization problems (e.g., in machine learning) presents two key challenges: the messiness of real-world data, which can be noisy, biased, or corrupted due to factors like outliers, distribution shifts, and even adversarial attacks; and the laborious, time-intensive requirement of manually tuning step sizes in many existing algorithms. I study stochastic adaptive optimization algorithms under a simple, common framework. The algorithms in this framework avoid the need for manual step size tuning by adaptively adjusting it in each iteration based on the algorithm's progress. To address the issue of messy data, the framework only assumes access to function-related information through probabilistic oracles, which may be biased and corrupted. This framework is very general, encompassing a wide range of algorithms, and is applicable to multiple problem settings, such as expected loss minimization in machine learning, simulation optimization, and derivative-free optimization. We establish iteration complexity bounds for two algorithms within it — stochastic adaptive step search and stochastic adaptive cubic-regularized Newton method — under reasonable oracle conditions. Additionally, we derive a meta-theorem to bound the sample complexity for any algorithm in the framework.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Mathematical Optimization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Nonlinear Optimization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Optimization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Stochastic Optimization</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Reliable and Adaptive Stochastic Optimization in the Face of Messy Data</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="relation" qualifier="localuri">https://newcatalog.library.cornell.edu/catalog/16575424</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.2</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">Xie, Miaolan</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="4bbaf9cc-8c7c-472d-b77c-b3022cbb33d0">
	&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>Reliable and Adaptive Stochastic Optimization in the Face of Messy Data&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2024-05&lt;/PublicationDate>
   	&lt;DOI>https://doi.org/10.7298/bqzz-6h43&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Xie, Miaolan&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>Mathematical Optimization&lt;/Keyword>
    &lt;Keyword>Nonlinear Optimization&lt;/Keyword>
    &lt;Keyword>Optimization&lt;/Keyword>
    &lt;Keyword>Stochastic Optimization&lt;/Keyword>
   	&lt;Abstract>Solving real-world stochastic optimization problems (e.g., in machine learning) presents two key challenges: the messiness of real-world data, which can be noisy, biased, or corrupted due to factors like outliers, distribution shifts, and even adversarial attacks; and the laborious, time-intensive requirement of manually tuning step sizes in many existing algorithms. I study stochastic adaptive optimization algorithms under a simple, common framework. The algorithms in this framework avoid the need for manual step size tuning by adaptively adjusting it in each iteration based on the algorithm&amp;apos;s progress. To address the issue of messy data, the framework only assumes access to function-related information through probabilistic oracles, which may be biased and corrupted. This framework is very general, encompassing a wide range of algorithms, and is applicable to multiple problem settings, such as expected loss minimization in machine learning, simulation optimization, and derivative-free optimization. We establish iteration complexity bounds for two algorithms within it — stochastic adaptive step search and stochastic adaptive cubic-regularized Newton method — under reasonable oracle conditions. Additionally, we derive a meta-theorem to bound the sample complexity for any algorithm in the framework.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>