<node id="655069">
  <nid>655069</nid>
  <type>event</type>
  <uid>
    <user id="27544"><![CDATA[27544]]></user>
  </uid>
  <created>1643819431</created>
  <changed>1643998638</changed>
  <title><![CDATA[ARC Colloquium: Manolis Vlatakis (Columbia)]]></title>
  <body><![CDATA[<p align = "center"><strong>Algorithms &amp; Randomness Center (ARC)</strong></p>

<p align = "center"><strong>Manolis Vlatakis (Columbia)</strong></p>

<p align = "center"><strong>Monday, February 7, 2022</strong></p>

<p align = "center"><strong>Virtual via BlueJeans - 11:00 am</strong></p>

<p>&nbsp;</p>

<p><strong>Title:&nbsp;</strong> Building Optimization beyond Minimization: A Journey in Game Dynamics</p>

<p><strong>Abstract:</strong>&nbsp; Motivated by recent advances in both theoretical and applied aspects of multiplayer games, spanning from e-sports to multi-agent generative adversarial networks, a surge of different studies&nbsp;have been focused on the core problem of&nbsp;understanding the behavior of game dynamics in general&nbsp;N-player games. From the seminal settings of two competitive players and Min-Max Optimization to the complete&nbsp;understanding of how the day-to-day behavior of the dynamics correlates to the game&#39;s different notion of equilibria is much more limited, and only partial results are known for certain classes of games (such as zero-sum or congestion games). In this talk, we study from two different perspectives&nbsp;arguably the most well-studied class of no-regret dynamics, &quot;Follow-the-regularized-leader&quot; (FTRL) and Discretizations of Gradient Flow (GDA/OGDA/EG), &nbsp;and we establish a sweeping negative result showing that the notion of mixed Nash equilibrium is antithetical to no-regret learning. Specifically, we show that any Nash equilibrium which is not strict (in that every player has a unique best response) cannot be stable and attracting under the dynamics of FTGL. This result has significant implications for predicting the outcome of a learning process as it shows unequivocally that only strict (and hence, pure) Nash equilibria can emerge as stable limit points thereof. For a final happy end story, we present either structural examples of families where convergence is possible providing the last-iterate convergence rates or even new methods inspired from other areas like control theory &amp; planning.&nbsp;</p>

<p>Bio:<br />
Emmanouil (Manolis) V. Vlatakis Gkaragkounis is a final year PhD student in the Department of Computer Science at Columbia University, under the supervision of prof. Mihalis Yannakakis and Rocco Servedio. Currently, he is Simons-Google Research fellow at the University of California at Berkeley.&nbsp;Before joining Columbia University, he interned at &quot;Athena&quot; Research &amp; Innovation Center in Athens, Greece. He received his integrated B.s &amp; M.s in ECE Department of National Technical University of Athens, where he was advised by Dimitris Fotakis. Manolis&#39;s primary interest is in the intersection of Theoretical Computer Science &amp; Machine Learning, with a particular focus in&nbsp;Algorithmic Game Theory, Optimization, Computational Complexity and Beyond Worst-case Analysis of Algorithms .&nbsp;</p>

<p>----------------------------------</p>

<p><a href="http://www.cs.columbia.edu/~emvlatakis/">Speaker&#39;s Webpage</a></p>

<p><em>Videos of recent talks are available at: </em><a href="https://smartech.gatech.edu/handle/1853/46836"><em>https://smartech.gatech.edu/handle/1853/46836</em></a></p>

<p><a href="https://mailman.cc.gatech.edu/mailman/listinfo/arc-colloq"><em>Click here to subscribe to the seminar email list: arc-colloq@Klauscc.gatech.edu </em></a></p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[ Building Optimization beyond Minimization: A Journey in Game Dynamics - Virtual via BlueJeans at 11am]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2022-02-07T11:00:00-05:00]]></value>
      <value2><![CDATA[2022-02-07T12: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[Faculty/Staff]]></value>
      </item>
          <item>
        <value><![CDATA[Postdoc]]></value>
      </item>
          <item>
        <value><![CDATA[Graduate students]]></value>
      </item>
          <item>
        <value><![CDATA[Undergraduate students]]></value>
      </item>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_contact>
  <field_location>
    <item>
      <value><![CDATA[]]></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>70263</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[ARC]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1795</tid>
        <value><![CDATA[Seminar/Lecture/Colloquium]]></value>
      </item>
      </field_categories>
  <field_keywords>
      </field_keywords>
  <userdata><![CDATA[]]></userdata>
</node>
