<node id="693297">
  <nid>693297</nid>
  <type>event</type>
  <uid>
    <user id="27707"><![CDATA[27707]]></user>
  </uid>
  <created>1792424922</created>
  <changed>1792424995</changed>
  <title><![CDATA[PhD Defense by Sebastián Gutiérrez Hernández.]]></title>
  <body><![CDATA[<p><strong>Title:</strong> ‘Learning and optimizing paths between probability distributions. From action minimization to boundary-valued Hamiltonian flows’.</p><p><strong>Date:</strong>&nbsp; November 4th&nbsp;</p><p><strong>Time:</strong>&nbsp;9.00am (EST)</p><p><strong>Room:&nbsp;</strong>006</p><p><strong>Zoom link:&nbsp;</strong><a href="https://nam12.safelinks.protection.outlook.com/?url=https%3A%2F%2Fgatech.zoom.us%2Fj%2F91925737499&amp;data=05%7C02%7Cannouncements%40grad.gatech.edu%7C965bf546d6bd47800c1708df291cecaf%7C482198bbae7b4b258b7a6d7f32faa083%7C1%7C0%7C639274876397334306%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C0%7C%7C%7C&amp;sdata=Fa%2FOCQj2JEjSW2gMYk5fxI8TOz9AKd9IKwHyhcTTtOs%3D&amp;reserved=0"><strong>https://gatech.zoom.us/j/91925737499</strong></a></p><p>&nbsp;</p><p><strong>Committee members</strong>:</p><p>Dr. Haomin Zhou (Advisor)</p><p>Dr. Peng Chen (Co-advisor)</p><p>Dr. Sung Ha Kang</p><p>Dr. Luca Dieci</p><p>Dr. Shu Liu</p><p>&nbsp;</p><p><strong>Abstract:</strong></p><p>Finding a path between two probability distributions is a recurring problem in optimal transport, generative modeling, population dynamics, and control. A broad class of these problems can be formulated through an action functional defined over curves of probability distributions. The corresponding first-order optimality conditions lead to a coupled Hamilton–Jacobi and continuity system, which can be written as a boundary-value Hamiltonian flow in density space.</p><p>We take three approaches for learning and optimizing them: Hamiltonian Rectification (HR), Neural Multiple Shooting (NMS), and Parametric Density Path Optimization (PDPO). In the talk, we are going to focus on Neural Multiple Shooting.&nbsp;</p><p>The central idea of NMS is to reformulate the boundary-value problem in density space as a multiple-shooting problem in particle space. Since the particle dynamics are determined by the prescribed Hamiltonian system once the momentum is specified, the unknowns reduce to momentum maps that initialize a sequence of Hamiltonian initial-value problems. The resulting hybrid method combines neural approximation with classical multiple shooting: neural networks determine the momentum at the beginning of each shooting segment, while an ODE solver propagates the corresponding trajectories according to the prescribed dynamics.</p><p>&nbsp;</p><p>&nbsp;</p><p>&nbsp;</p>]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Learning and optimizing paths between probability distributions. From action minimization to boundary-valued Hamiltonian flows’]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[<p>Learning and optimizing paths between probability distributions. From action minimization to boundary-valued Hamiltonian flows’</p>]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2026-11-04T09:00:20-05:00]]></value>
      <value2><![CDATA[2026-11-04T11:00:00-05:00]]></value2>
      <rrule><![CDATA[]]></rrule>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_time>
  <field_fee>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_fee>
  <field_extras>
      </field_extras>
  <field_audience>
          <item>
        <value><![CDATA[Public]]></value>
      </item>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_contact>
  <field_location>
    <item>
      <value><![CDATA[Skiles room 006. ]]></value>
    </item>
  </field_location>
  <field_sidebar>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_sidebar>
  <field_phone>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_phone>
  <field_url>
    <item>
      <url><![CDATA[]]></url>
      <title><![CDATA[]]></title>
            <attributes><![CDATA[]]></attributes>
    </item>
  </field_url>
  <field_email>
    <item>
      <email><![CDATA[]]></email>
    </item>
  </field_email>
  <field_boilerplate>
    <item>
      <nid><![CDATA[]]></nid>
    </item>
  </field_boilerplate>
  <links_related>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>221981</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[Graduate Studies]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1788</tid>
        <value><![CDATA[Other/Miscellaneous]]></value>
      </item>
      </field_categories>
  <field_keywords>
          <item>
        <tid>100811</tid>
        <value><![CDATA[Phd Defense]]></value>
      </item>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
