<node id="660238">
  <nid>660238</nid>
  <type>event</type>
  <uid>
    <user id="35702"><![CDATA[35702]]></user>
  </uid>
  <created>1660743934</created>
  <changed>1661787047</changed>
  <title><![CDATA[ARC Colloquium: Yuansi Chen (Duke University)]]></title>
  <body><![CDATA[<p align ="center"><strong>Algorithms &amp; Randomness Center (ARC)</strong></p>

<p align = "center"><strong>Yuansi Chen (Duke University)</strong></p>

<p align = "center"><strong>September 12, 2022</strong></p>

<p align = "center"><strong>Klaus 1116 - 11:00 am</strong></p>

<p>&nbsp;</p>

<p><strong>Title:</strong> Localization&nbsp;schemes: A framework for proving mixing bounds for Markov chains<strong> </strong></p>

<p><strong>Abstract:&nbsp;&nbsp;</strong>Our work is motivated by two recent and seemingly-unrelated techniques for proving mixing bounds for Markov chains:</p>

<p>(i) the concept of spectral independence, introduced by Anari, Liu and Oveis Gharan, and its numerous extensions, which have given rise to&nbsp;several breakthroughs in the analysis of mixing times of discrete Markov chains and<br />
(ii) the stochastic&nbsp;localization&nbsp;technique which has proven useful in establishing mixing and expansion bounds for both log-concave measures and&nbsp;for measures on the discrete hypercube.<br />
&nbsp;<br />
In this work, we present a framework which connects ideas from both techniques and allows us to unify proofs in the mixing time of MCMC&nbsp;algorithms on high dimensional distributions. In its center is the concept of a&nbsp;localization&nbsp;scheme which, to every probability measure , assigns a&nbsp;martingale of probability measures which localize in space as time evolves. This viewpoint provides tools for deriving mixing bounds for the&nbsp;dynamics through the analysis of the corresponding&nbsp;localization&nbsp;process.&nbsp; Generalizations of concepts of spectral independence naturally arise&nbsp;from our definitions. In particular we show via our framework that it is possible to recover the main theorems in the spectral independence&nbsp;frameworks via simple martingale arguments, while completely bypassing the theory of high-dimensional expanders.&nbsp; As applications, we discuss&nbsp;how to use it to obtain the first O(nlogn) bound for mixing time of the hardcore-model (of arbitrary degree) in the tree-uniqueness regime, under&nbsp;Glauber dynamics and to prove a KL-divergence decay bound for log-concave sampling via the Restricted Gaussian Oracle, which achieves&nbsp;optimal mixing under any exp(n)-warm start.</p>

<p>---------------------------------------------------------------</p>

<p><a href="http://www2.stat.duke.edu/~yc443/">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><em> and <a href="http://arc.gatech.edu/node/121">http://arc.gatech.edu/node/121</a> </em></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[Localization schemes: A framework for proving mixing bounds for Markov chains - Klaus 1116 at 11am]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2022-09-12T12:00:00-04:00]]></value>
      <value2><![CDATA[2022-09-12T13:00:00-04: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>
