<node id="632595">
  <nid>632595</nid>
  <type>event</type>
  <uid>
    <user id="27707"><![CDATA[27707]]></user>
  </uid>
  <created>1582046916</created>
  <changed>1582046916</changed>
  <title><![CDATA[PhD Defense by Samira Samadi]]></title>
  <body><![CDATA[<p><strong>Title:</strong>&nbsp;Human Aspects of Machine Learning</p>

<p>&nbsp;</p>

<p>Samira Samadi</p>

<p>School of Computer Science</p>

<p>College of Computing</p>

<p>Georgia Institute of Technology</p>

<p>&nbsp;</p>

<p><strong>Date:&nbsp;</strong> Thursday, March 5th, 2020</p>

<p><strong>Time:&nbsp;</strong> 11:00 am - 12:30 pm (EST)</p>

<p><strong>Location:</strong> Klaus 1315</p>

<p>&nbsp;</p>

<p><strong>Committee:</strong></p>

<p>Dr. Santosh Vempala (Advisor, School of Computer Science, Georgia Institute of Technology)</p>

<p>Dr. Adam Kalai (Senior Principal Researcher, Microsoft Research New England)</p>

<p>Dr. Jamie Morgenstern (School of Computer Science &amp; Engineering, University of Washington)</p>

<p>Dr. Vivek Sarkar (School of Computer Science, Georgia Institute of Technology)</p>

<p>Dr. Mohit Singh (School of Industrial &amp; Systems Engineering, Georgia Institute of Technology)</p>

<p>&nbsp;</p>

<p><strong>Abstract:</strong></p>

<p>As humans are inevitably being influenced by machine learning algorithms, it is crucial to study the human aspects of these algorithms. In my research, I investigate several ML paradigms from the viewpoint of human usability, security, and fairness.</p>

<p><br />
In the first line of work, I study human usability and security of password strategies &mdash; mental algorithms proposed by Blum and Vempala to help people calculate, in their heads, passwords for different websites without dependence on external devices. I present the first usability study of two password strategies: the 3-word strategy and the letter-code strategy. Furthermore, I show that given a limited amount of memorization, there are humanly usable password strategies that achieve the information-theoretic highest security guarantee.<br />
<br />
In the second line of work, I investigate different fairness criteria for several machine learning techniques including principal component analysis (PCA) and spectral clustering. I show on real-world data sets that PCA can inadvertently produce low-dimensional representations with different fidelity for two different populations (e.g., lighter- versus darker-skin tone individuals). I define the notion of Fair PCA and present an efficient algorithm for finding a low-dimensional representation of the data which is nearly-optimal for this measure. I conclude by a study of spectral clustering with the constraint that every demographic is proportionally represented in each cluster. For this goal, I develop variants of constrained spectral clustering and show that they help find fairer clusterings on real data.&nbsp;</p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Human Aspects of Machine Learning]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2020-03-05T11:00:00-05:00]]></value>
      <value2><![CDATA[2020-03-05T12:30: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[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[]]></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>
