<node id="614555">
  <nid>614555</nid>
  <type>event</type>
  <uid>
    <user id="27707"><![CDATA[27707]]></user>
  </uid>
  <created>1543249245</created>
  <changed>1543341927</changed>
  <title><![CDATA[PhD Proposal by Samira Samadi]]></title>
  <body><![CDATA[<p><strong>Title:</strong> Human Aspects of Machine Learning</p>

<p>&nbsp;</p>

<p>Samira Samadi</p>

<p>Ph.D. Student</p>

<p>School of Computer Science</p>

<p>College of Computing</p>

<p>Georgia Institute of Technology</p>

<p><a href="http://www.samirasamadi.com/" target="_blank">http://www.samirasamadi.com</a></p>

<p>&nbsp;</p>

<p>Date: Thursday, November 29th, 2018</p>

<p>Time: 9:30am to 11am (EDT)</p>

<p>Location: KACB 3402</p>

<p>&nbsp;</p>

<p><strong>Committee:</strong></p>

<p>&nbsp;</p>

<p>Dr. Santosh Vempala (Advisor,&nbsp;School of Computer Science, Georgia Institute of Technology)</p>

<p>Dr. Mohit Singh (School of Computer Science, Georgia Institute of Technology)</p>

<p>Dr. Jamie Morgenstern (School of Computer Science, Georgia Institute of Technology)</p>

<p>&nbsp;</p>

<p>&nbsp;</p>

<p><strong>Abstract:</strong></p>

<p>&nbsp;</p>

<p>As humans are inevitably being influenced by machine learning algorithms, it is crucial to study the human aspects of these algorithms. In this proposal, I investigate several ML paradigms from the viewpoint of&nbsp; human usability and fairness. In the first line of work, I present the first usability study of humanly computable password strategies -- mental algorithms proposed by Blum and Vempala to help people calculate, in their heads, passwords for different websites without dependence on third-party tools or external devices. In the second line of work, I study fairness for Principal Component Analysis (PCA), one of the most commonly used dimensionality reduction techniques. We show on real-world data sets that PCA can inadvertently produce low-dimensional representations with different fidelity for two different populations (e.g., men and women). We define the notion of Fair PCA and present a polynomial-time algorithm for finding a low-dimensional representation of the data which is nearly-optimal with respect to this measure. Finally, I will discuss two of my ongoing projects: (a) spectral clustering with the fairness constraint that each population should have approximately equal representation in every cluster, and (b) fair interpretable classifiers for structured outcomes.&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[2018-11-29T09:30:00-05:00]]></value>
      <value2><![CDATA[2018-11-29T23: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[Public]]></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>102851</tid>
        <value><![CDATA[Phd proposal]]></value>
      </item>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
