<?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-22T10:21:39Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/117239" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/117239</identifier><datestamp>2026-05-15T19:49:10Z</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">Tran, Trang</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">Pender, Jamol</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Henderson, Shane</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2025-06-30T22:04:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2025-06-30T22:04:04Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2024-12</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Submission ID: 14752</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="other">ProQuest Publication ID: 31641026</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/117239</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="doi">http://doi.org/10.7298/dwpv-0366</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">16922018</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">288 pages</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">This dissertation investigates stochastic optimization methods where exact gradient computations are prohibitively expensive, necessitating potentially biased gradient estimators. Such challenges arise in applications like empirical risk minimization in machine learning, where unbiased gradient estimates are not always feasible, and in derivative-free settings where only function values are accessible. We focus on stochastic gradient methods with biased estimates from shuffling-based sampling schemes, which lack standard assumptions of independence and unbiasedness. While unbiased methods like i.i.d. SGD are well-studied, the analytical challenges of biased shuffling methods, particularly when combined with momentum, are underexplored. This work addresses these gaps by examining the theoretical and practical impacts of shuffling schemes in stochastic first-order methods, including stochastic gradient descent and its variant with heavy ball momentum and Nesterov's acceleration. Additionally, we analyze a backtracking variant of FISTA and extend a stochastic analysis framework from prior work to both ISTA and backtracking FISTA, showing that, without requiring unbiased gradient estimators, these methods retain their deterministic complexity.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">bias</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">gradient methods</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">momentum</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">stochastic optimization</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Stochastic Gradient Methods with Bias and Momentum</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/16922018</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">Tran, Trang</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="280ba623-f1c5-4518-b3e4-ce65bcca9edc">
	&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>Stochastic Gradient Methods with Bias and Momentum&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2024-12&lt;/PublicationDate>
   	&lt;DOI>http://doi.org/10.7298/dwpv-0366&lt;/DOI>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Tran, Trang&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>bias&lt;/Keyword>
    &lt;Keyword>gradient methods&lt;/Keyword>
    &lt;Keyword>momentum&lt;/Keyword>
    &lt;Keyword>stochastic optimization&lt;/Keyword>
   	&lt;Abstract>This dissertation investigates stochastic optimization methods where exact gradient computations are prohibitively expensive, necessitating potentially biased gradient estimators. Such challenges arise in applications like empirical risk minimization in machine learning, where unbiased gradient estimates are not always feasible, and in derivative-free settings where only function values are accessible. We focus on stochastic gradient methods with biased estimates from shuffling-based sampling schemes, which lack standard assumptions of independence and unbiasedness. While unbiased methods like i.i.d. SGD are well-studied, the analytical challenges of biased shuffling methods, particularly when combined with momentum, are underexplored. This work addresses these gaps by examining the theoretical and practical impacts of shuffling schemes in stochastic first-order methods, including stochastic gradient descent and its variant with heavy ball momentum and Nesterov&amp;apos;s acceleration. Additionally, we analyze a backtracking variant of FISTA and extend a stochastic analysis framework from prior work to both ISTA and backtracking FISTA, showing that, without requiring unbiased gradient estimators, these methods retain their deterministic complexity.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>