<node id="650757">
  <nid>650757</nid>
  <type>event</type>
  <uid>
    <user id="27707"><![CDATA[27707]]></user>
  </uid>
  <created>1631707772</created>
  <changed>1631707772</changed>
  <title><![CDATA[PhD Proposal by He Jia]]></title>
  <body><![CDATA[<p><strong>Title:&nbsp;Robust Learning in High dimension</strong><br />
<br />
<strong>Date:</strong>&nbsp;Thursday, 23 September, 2021<br />
<strong>Time:</strong>&nbsp;10:00 am (EST)<br />
<strong>Location (Physical):</strong>&nbsp;Klaus 2100 (featuring snacks)<br />
<strong>Location (Virtual):</strong>&nbsp;<a href="https://bluejeans.com/851759942/0635">https://bluejeans.com/851759942/0635</a>&nbsp;&nbsp;<br />
<br />
<strong>He Jia</strong><br />
PhD Student<br />
School of Computer Science<br />
Georgia Institute of Technology<br />
<br />
<strong>Committee:</strong><br />
Santosh Vempala (Advisor) - School of Computer Science,&nbsp;Georgia Institute of Technology<br />
Konstantin Tikhomirov - School of Mathematics,&nbsp;Georgia Institute of Technology<br />
Ashwin Pananjady -&nbsp;School of Industrial &amp; Systems Engineering, Georgia Institute of Technology<br />
<br />
<strong>Abstract:</strong><br />
Given a collection of observations and a class of models, the objective of a typical unsupervised learning algorithm is to find the model in the class that best fits the&nbsp;data. However, real datasets are typically exposed to some source of noise. Robust statistics focuses on the design of outlier-robust estimators &mdash; algorithms that can&nbsp;tolerate a constant fraction of corrupted data points or other small departures from model assumptions, independent of the dimension. In the outlier-robust setting, it is&nbsp;challenging to develop efficient learning algorithms for many well-known high-dimensional models.&nbsp;<br />
<br />
We give an efficient algorithm for the problem of robustly learning Gaussian mixtures. The main tools are an efficient&nbsp;partial clustering&nbsp;algorithm that relies on the&nbsp;sum-of-squares method, and a novel&nbsp;tensor decomposition&nbsp;algorithm that allows errors in both Frobenius norm and low-rank terms. I will also discuss the problems of&nbsp;robustly learning affine transformations and robustly learning multi-view models, and the possible approaches to solve these problems: e.g., robust tensor&nbsp;decomposition.</p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Robust Learning in High dimension]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2021-09-23T11:00:00-04:00]]></value>
      <value2><![CDATA[2021-09-23T13: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[Public]]></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[https://bluejeans.com/851759942/0635]]></url>
      <title><![CDATA[Bluejeans]]></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>102851</tid>
        <value><![CDATA[Phd proposal]]></value>
      </item>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
