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:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
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
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20241016T110000
DTEND;TZID=America/New_York:20241016T120000
DTSTAMP:20260603T040816
CREATED:20241003T134027Z
LAST-MODIFIED:20241003T134027Z
UID:12293-1729076400-1729080000@seasevents.nmsdev7.com
SUMMARY:ESE Guest Seminar - "Safe Offline RL for Constrained Markov Decision Process: Theory and Practice"
DESCRIPTION:Many constrained sequential decision-making processes such as safe AV navigation\, wireless network control\, caching\, cloud computing\, etc.\, can be cast as Constrained Markov Decision Processes (CMDP). Reinforcement Learning (RL) algorithms have been used to learn optimal policies for unknown unconstrained MDP. Extending these RL algorithms to unknown CMDP\, brings the additional challenge of not only maximizing the reward but also satisfying the constraints. Further\, in most of the practical applications\, one has to rely on the offline database as online interaction might be costly or infeasible. \nWhile the unconstrained offline RL setting is relatively well-understood\, the offline CMDP or safe offline RL setup is not. For example\, consider a database that consists of data coming from a safe behavioral policy\, it remained an open problem on how to develop an algorithm that would provide safety while maximizing the reward with provable guarantee. In particular\, the existing works on safe offline RL rely on the assumption that the database must contain state-action pairs coming from all the policies which is not practical in safety-critical setup as the database might not contain unsafe state-action pairs. We closed the gap in our recent research. In our work\, we developed a weighted safe actor-critic (WSAC) algorithm that can produce a policy that outperforms any behavioral policy while maintaining the same level of safety\, which is critical to designing a safe algorithm for offline RL. Additionally\, we compare WSAC with existing state-of-the-art safe offline RL algorithms in several continuous control environments. WSAC outperforms all baselines across a range of tasks\, supporting the theoretical results.
URL:https://seasevents.nmsdev7.com/event/ese-seminar-safe-offline-rl-for-constrained-markov-decision-process-theory-and-practice/
LOCATION:Greenberg Lounge (Room 114)\, Skirkanich Hall\, 210 South 33rd Street\, Philadelphia\, PA\, 19104\, United States
CATEGORIES:Seminar
ORGANIZER;CN="Electrical and Systems Engineering":MAILTO:eseevents@seas.upenn.edu
END:VEVENT
END:VCALENDAR