<node id="620481">
  <nid>620481</nid>
  <type>event</type>
  <uid>
    <user id="27707"><![CDATA[27707]]></user>
  </uid>
  <created>1555435586</created>
  <changed>1555435586</changed>
  <title><![CDATA[PhD Proposal by Ching-An Cheng]]></title>
  <body><![CDATA[<p><strong>Title:</strong>&nbsp;Efficient and Principled Robot Learning:&nbsp;Theory and Algorithms</p>

<p>&nbsp;</p>

<p>Ching-An Cheng</p>

<p>Robotics PhD student</p>

<p>School of&nbsp;Interactive Computing</p>

<p>Georgia Institute of Technology</p>

<p>&nbsp;</p>

<p><strong>Date:</strong>&nbsp;Tuesday, April 30, 2019</p>

<p><strong>Time:</strong>&nbsp;1:00pm - 3:00pm (EST)</p>

<p><strong>Location:</strong>&nbsp;CCB 340</p>

<p>&nbsp;</p>

<p><strong>Committee:</strong></p>

<p>Dr. Byron Boots (advisor), School of Interactive Computing, Georgia Institute of Technology</p>

<p>Dr. Seth Hutchinson, School of Interactive Computing, Georgia Institute of Technology</p>

<p>Dr. Karen Liu, School of Interactive Computing, Georgia Institute of Technology</p>

<p>Dr. Evangelos Theodorou, School of Aerospace Engineering, Georgia Institute of Technology</p>

<p>Dr. Geoff Gordon, Microsoft Research and Machine Learning Department, Carnegie Mellon University</p>

<p>&nbsp;</p>

<p><strong>Abstract:</strong></p>

<p>Roboticists have long envisioned fully-automated robots that can operate reliably in unstructured environments. This is an exciting but extremely diﬃcult&nbsp;problem; in order to succeed, robots must reason about sequential decisions and their consequences in face of uncertainty. As a result, in practice, the engineering eﬀort required to build reliable robotic systems is both demanding and expensive. This research aims to provide a set of techniques for efficient and principled robot learning. It tackles this challenge from a theoretical perspective, in order to provide a panoramic perspective on the underlying diﬃculties and indicate systematic directions for improvement. A better theoretical formulation for system design, that more closely integrates analysis and practical needs, is a key to address current deﬁciencies. Here these theoretical principles are applied to design better algorithms in three important aspects of robot learning: policy optimization, uncertainty modeling, and development of structural policies. It uses and extends online learning,&nbsp;optimization, and control theory, and is demonstrated on applications including reinforcement and imitation learning, Gaussian process learning, and integrated motion planning and control. A shared feature across this research is the reciprocal interaction between the development of practical algorithms and the advancement of abstract analyses. Real-world challenges force the rethinking of proper theoretical formulations, which in turn lead to reﬁned analyses and new algorithms that can rigorously leverage these insights to achieve better performance.</p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[Efficient and Principled Robot Learning: Theory and Algorithms]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2019-04-30T14:00:00-04:00]]></value>
      <value2><![CDATA[2019-04-30T16: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[]]></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>
