BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//IORA - Institute of Operations Research and Analytics - ECPv6.15.11//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:IORA - Institute of Operations Research and Analytics
X-ORIGINAL-URL:https://iora.nus.edu.sg
X-WR-CALDESC:Events for IORA - Institute of Operations Research and Analytics
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Singapore
BEGIN:STANDARD
TZOFFSETFROM:+0800
TZOFFSETTO:+0800
TZNAME:+08
DTSTART:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Singapore:20211015T100000
DTEND;TZID=Asia/Singapore:20211015T113000
DTSTAMP:20260409T193624
CREATED:20210812T024727Z
LAST-MODIFIED:20211008T074956Z
UID:14192-1634292000-1634297400@iora.nus.edu.sg
SUMMARY:IORA Seminar Series – Yilun Chen
DESCRIPTION:Yilun Chen is an assistant professor in the School of Data Science at CUHK Shenzhen (currently on leave)\, and a postdoctoral researcher at Columbia Business School. He obtained a PhD in Operations Research at Cornell University in 2021. Yilun’s research interest lies broadly in applied probability\, with a specific focus on decision-making under uncertainty and its wide applications in Operations Research/Operations Management. His work was awarded first place in the 2019 INFORMS Nicholson Best Student Paper Competition. \n  \n\n\n\nName of Speaker\nDr Chen Yilun\n\n\nSchedule\nFriday 15 October\, 10am – 11.30am \n(60 min talk + 30 min Q&A)\n\n\nLink to Register\nhttps://nus-sg.zoom.us/meeting/register/tZcrde-rrDMsHNRtAlSfk8uzRR1XMiPuCd-f\n\n\n Title\nTractability of high-dimensional online decision-making with limited action changes\n\n\nAbstract\nData-driven online decision-making tasks arise frequently in various practical settings in OR/ OM\, finance\, healthcare\, etc. Such tasks often boil down to solving certain stochastic dynamic programs (DPs) with prohibitively large state space and complicated dynamics\, suffering from the computational challenge known as the curse of dimensionality. Existing approaches (e.g. ADP\, deep learning) typically focus on achieving practical success and have limited performance guarantees. We propose an algorithm that overcomes this computational obstacle for a rich class of problems\, subject only to a “limited-action-change’’ constraint\, which incorporate important special cases including optimal stopping and limited-price-change dynamic pricing. Assuming a black-box simulator of the problem’s dynamics\, our algorithm can return epsilon-optimal policies with sample and computational complexity scaling polynomially in T (the time horizon)\, and effectively independent of the underlying state space\, analogous to a “PTAS’’. We further demonstrate that the limited-action-change constraint is crucial for such efficient algorithms to exist through the construction of a hard instance. The recent algorithmic progress in high-dimensional optimal stopping of Chen and Goldberg 21 is a key building block of our algorithm.
URL:https://iora.nus.edu.sg/events/iora-seminar-series-yilun-chen/
CATEGORIES:IORA Seminar Series
ATTACH;FMTTYPE=image/jpeg:https://iora.nus.edu.sg/wp-content/uploads/2021/08/Chen-Yilun-pic.jpg
END:VEVENT
END:VCALENDAR