<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.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-09-20T07:49:12Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/108189" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/108189</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_10761</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_10755</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Telgarsky, Matus J</dc:contributor>
          <dc:creator>Lizama, Justin N</dc:creator>
          <dc:date>2020-08-26T23:58:48Z</dc:date>
          <dc:date>2020-08-26T23:58:48Z</dc:date>
          <dc:date>2022-08-26T23:58:55Z</dc:date>
          <dc:date>2020-05-12</dc:date>
          <dc:date>2020-05</dc:date>
          <dc:description>A new loss function is proposed which learns the hinge loss function an infinite number of times pushing $f(x_i)y_i \to \infty$.  It is proven that for a linear model on linearly separable data this modified hinge loss function converges in the direction of the $\ell_2$ max-margin separator at a rate of $\bigO\left( \sqrt{d/t} \right)$ where $d$ is the dimension of the data. Then, an explicit formula for the underlying dynamical system of the gradient descent iterates for two-layer linear networks on the inner product loss function is derived.  Using the derived dynamical system, a precise explicit algorithm is developed which when implemented reproduces the gradient descent iterates of two-layer ReLU nets on the inner product exactly.  This result is studied further to extrapolate conclusions for neural network optimization.</dc:description>
          <dc:description>Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2022-05-01</dc:description>
          <dc:description>The student, Justin Lizama, accepted the attached license on 2020-05-12 at 12:38.</dc:description>
          <dc:description>The student, Justin Lizama, submitted this Thesis for approval on 2020-05-12 at 13:23.</dc:description>
          <dc:description>This Thesis was approved for publication on 2020-05-12 at 15:00.</dc:description>
          <dc:description>DSpace SAF Submission Ingestion Package generated from Vireo submission #15352 on 2020-08-25 at 17:31:13</dc:description>
          <dc:description>Made available in DSpace on 2020-08-26T23:58:48Z (GMT). No. of bitstreams: 2
LIZAMA-THESIS-2020.pdf: 1342025 bytes, checksum: a56819a442a48f4562e0e97587b99fd7 (MD5)
LICENSE.txt: 4210 bytes, checksum: 0761322496976fd61d67a6ec4cb5f931 (MD5)
  Previous issue date: 2020-05-12</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 115802
Lift date: 2022-08-26T23:58:55Z
Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system</dc:description>
          <dc:description>Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD system</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>http://hdl.handle.net/2142/108189</dc:identifier>
          <dc:language>en</dc:language>
          <dc:rights>Copyright 2020 Justin Lizama</dc:rights>
          <dc:subject>implicit</dc:subject>
          <dc:subject>regularization</dc:subject>
          <dc:subject>hinge</dc:subject>
          <dc:subject>loss</dc:subject>
          <dc:title>Completion of hinge loss has an implicit bias</dc:title>
          <dc:type>text</dc:type>
          <dc:type>Thesis</dc:type>
          <degree>
            <department>Computer Science</department>
            <discipline>Computer Science</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Thesis</level>
            <name>M.S.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
