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:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Singapore:20260130T100000
DTEND;TZID=Asia/Singapore:20260130T113000
DTSTAMP:20260420T194648
CREATED:20260122T062513Z
LAST-MODIFIED:20260122T062556Z
UID:27370-1769767200-1769772600@iora.nus.edu.sg
SUMMARY:DAO-ISEM-IORA Seminar Series: Seungki Min
DESCRIPTION:Name of Speaker\n\nSeungki Min\n\n\n\nSchedule \n\n\n30 Jan 2026\, 10am – 11.30am \n (60 min talk + 30 min Q&A)\n\n\n\nVenue \n\n\nBIZ1 0302\n\n\n\nLink to register \n(via Zoom)\n\nhttps://nus-sg.zoom.us/meeting/register/psLI6qAmQPyKNZ3DOtqRvw\n\n\n\n\nTitle\n\n\nAn Information-Theoretic Analysis of Nonstationary Bandit Learning\n\n\n\n\nAbstract \n\nIn many real-world bandit learning problems\, the underlying environment evolves over time\, requiring decision-makers to continually acquire information and adapt their action selection accordingly. In this talk\, I study Bayesian formulations of nonstationary bandit problems\, where environmental dynamics are modeled as stochastic processes\, and develop an information-theoretic framework for analyzing attainable performance. \nOur analysis yields generic regret upper bounds that extend classical results from stationary Bayesian bandits to nonstationary settings. A key insight is that the entropy rate of the optimal action process naturally quantifies the intrinsic difficulty introduced by nonstationarity. I further connect our results to existing frequentist analyses of nonstationary bandits\, showing that several well-known regret bounds in the literature can be recovered as special cases within our unified framework.\n\n\n\n\nAbout the Speaker\n\n\nSeungki Min is an Assistant Professor of Operations Management at Seoul National University Business School. His research focuses on bandit optimization and reinforcement learning\, with an emphasis on principled frameworks for dynamic decision problems arising in business and engineering applications\, including online platforms\, pricing\, and finance. His research has appeared in Operations Research\, Management Science\, and leading AI/ML conferences such as ICML and NeurIPS. He earned his Ph.D. from Columbia Business School. Prior to academia\, he worked in high-frequency trading domain.
URL:https://iora.nus.edu.sg/events/dao-isem-iora-seminar-series-30-jan-2026-10am-seungki-min/
CATEGORIES:IORA Seminar Series
END:VEVENT
END:VCALENDAR