BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Penn Engineering Events - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Penn Engineering Events
X-ORIGINAL-URL:https://seasevents.nmsdev7.com
X-WR-CALDESC:Events for Penn Engineering Events
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20261101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20250618T090000
DTEND;TZID=America/New_York:20250618T090000
DTSTAMP:20260602T050816
CREATED:20250530T131221Z
LAST-MODIFIED:20250530T131221Z
UID:14097-1750237200-1750237200@seasevents.nmsdev7.com
SUMMARY:ESE Ph.D. Thesis Defense: "Statistical Limits and Efficient Algorithms for Learning-Enabled Control"
DESCRIPTION:As the adoption of large-scale learning for control continues to grow\, developing sample-efficient algorithms has become critical. Yet\, even in simple settings\, algorithms achieving optimal sample complexity for specific problem instances often remain unknown. Motivated by this limitation\, we discuss recent progress toward understanding sample-efficient methods in learning-enabled control. We first examine the statistical limits of offline reinforcement learning with continuous state\, action\, and observation spaces by deriving lower bounds on the cost of a learned controller that characterize inherently challenging problem instances. We then introduce efficient algorithms and establish tight finite-sample bounds on the cost they incur for controlling a general class of nonlinear dynamical systems. These results underscore the critical role of dataset quality and motivate our subsequent exploration of optimal task-oriented experiment design. Finally\, we consider large-scale pre-trained models for control\, analyzing how models trained across diverse tasks can be fine-tuned for new control objectives with limited data. We approach this problem through the lens of representation learning in adaptive control and provide upper bounds on the incurred regret.
URL:https://seasevents.nmsdev7.com/event/ese-ph-d-thesis-defense-statistical-limits-and-efficient-algorithms-for-learning-enabled-control/
LOCATION:Amy Gutmann Hall\, Room 414\, 3333 Chestnut Street\, Philadelphia\, 19104\, United States
CATEGORIES:Dissertation or Thesis Defense
ORGANIZER;CN="Electrical and Systems Engineering":MAILTO:eseevents@seas.upenn.edu
END:VEVENT
END:VCALENDAR