BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CREST - ECPv5.1.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CREST
X-ORIGINAL-URL:https://crest.science
X-WR-CALDESC:Events for CREST
BEGIN:VTIMEZONE
TZID:Europe/Helsinki
BEGIN:DAYLIGHT
TZOFFSETFROM:+0200
TZOFFSETTO:+0300
TZNAME:EEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0300
TZOFFSETTO:+0200
TZNAME:EET
DTSTART:20211031T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Helsinki:20210329T160000
DTEND;TZID=Europe/Helsinki:20210329T171500
DTSTAMP:20260712T082430
CREATED:20210305T064111Z
LAST-MODIFIED:20210305T064111Z
UID:10672-1617033600-1617038100@crest.science
SUMMARY:Csaba SZEPESVARI (University of Alberta) - "Towards Efficient Planning in Large Markov Decision Processes"
DESCRIPTION:\nStatistical Seminar: Every Monday at 2:00 pm.\nTime: 4:00 pm – 5:15 pm\nDate: 29th of March 2021\nPlace: Visio\nCsaba SZEPESVARI (University of Alberta) – “Towards Efficient Planning in Large Markov Decision Processes” \nAbstract: During the last decade reinforcement learning algorithms achieved outcomes far beyond expectations and not only in one area\, but in a diverse set of areas\, such as control\, robotics\, electronics\, or computer games\, just to list a few. What is common in the algorithms powering these breakthroughs that they all use powerful computers\, simulators and reinforcement learning algorithms with one common key component: function approximation. Formally\, these algorithms solve planning problems in large Markov decision processes where intractabality is avoided by using function approximation. Why\, when and how these algorithms succeed is the central questions of this talk\, in which I report on recent theoretical advances made on large scale planning in the presence of function approximation. The emerging picture is intriguingly complex: seemingly small changes to the way a problem is posed can cause a provably tractable problem to become intractable and vice versa. In this talk I will summarize the most striking of these results and will discuss a few of fascinating open questions. \nOrganizers:\nCristina BUTUCEA (CREST)\, Alexandre TSYBAKOV (CREST)\, Karim LOUNICI (CMAP) \, Zoltan SZABO (CMAP)\nSponsors:\nCREST-CMAP\n \n\n
URL:https://crest.science/event/csaba-szepesvari/
CATEGORIES:Statistics
ATTACH;FMTTYPE=:
END:VEVENT
END:VCALENDAR