- Seminar Calendar
- Seminar Archive
- 2024-2025 Semester 2
- 2024-2025 Semester 1
- 2023-2024 Semester 2
- 2023-2024 Semester 1
- 2022-2023 Semester 2
- 2022-2023 Semester 1
- 2021-2022 Semester 2
- 2021-2022 Semester 1
- 2020-2021 Semester 2
- 2020-2021 Semester 1
- 2019-2020 Semester 2
- 2019-2020 Semester 1
- 2018-2019 Semester 2
- 2018-2019 Semester 1
- 2017-2018 Semester 2
- 2017-2018 Semester 1
- 2016-2017 Semester 2
- 2016-2017 Semester 1
- 2015-2016 Semester 1
- 2015-2016 Semester 2
- 2014-2015 Semester 2
- 2014-2015 Semester 1
- 2013-2014 Semester 2
- 2013-2014 Semester 1
- 2012-2013 Semester 2
- 2012-2013 Semester 1
- 2011-2012 Semester 2
- 2011-2012 Semester 1
- 2010-2011 Semester 2
- 2010-2011 Semester 1
- 2009-2010 Semester 2
- 2009-2010 Semester 1
- 2008-2009 Semester 2
- 2008-2009 Semester 1
- 2007-2008 Semester 2
- 2007-2008 Semester 1
- 2006-2007 Semester 2
- 2006-2007 Semester 1
- 2005-2006 Semester 2
- 2005-2006 Semester 1
- Contact
- Site Map
On the Foundation and Tractability of Robust Markov Decision Processes
----------------------------------------------------------------------------------------------------
Department of Systems Engineering and Engineering Management
The Chinese University of Hong Kong
----------------------------------------------------------------------------------------------------
Date: Friday, Feburary 28, 4:30 pm – 5:30 pm
Venue: ERB 513, The Chinese University of Hong Kong
Title: On the Foundation and Tractability of Robust Markov Decision Processes
Speaker: Professor Nian Si, HKUST
Abstract: The main theme of this talk is to investigate the existence
or absence of the dynamic programming principle (DPP).
In the first part, we focus on rectangular uncertainty sets and
develop a comprehensive modeling framework for distributionally robust
Markov decision processes (DRMDPs). This framework requires the
decision maker to optimize against the worst-case distributional shift
induced by an adversary. By unifying and extending existing
formulations, we rigorously construct DRMDPs that accommodate various
modeling attributes for both the decision maker and the adversary.
These attributes include different levels of adaptability granularity,
ranging from history-dependent to Markov and Markov time-homogeneous
dynamics. We further explore the flexibility of adversarial shifts by
examining SA- and S-rectangularity. Within this DRMDP framework, we
analyze conditions under which the DPP holds or fails, systematically
studying different combinations of decision-maker and adversary
attributes.
In the second part, we extend our analysis beyond rectangular
uncertainty sets and introduce the notion of tractability.
Surprisingly, we show that, in full generality—without any assumptions
on instantaneous rewards—rectangular uncertainty sets are the onlytractable models. Our analysis further reveals that existing
non-rectangular models, including R-rectangular uncertainty and its
generalizations, are only weakly tractable. A key insight underlying
our results is the novel simultaneous solvability property, which we
identify as central to several fundamental properties of robust MDPs,
including the existence of stationary optimal policies and dynamic
programming principles. This property enables a unified approach to
analyzing the tractability of all uncertainty models, whether
rectangular or non-rectangular.
This talk is based on two papers: https://arxiv.org/abs/2311.09018 and
https://arxiv.org/abs/2411.08435.
Bio: Nian Si is an assistant professor at HKUST IEDA. He was a
postdoctoral principal researcher at the University of Chicago Booth
School of Business, working with Professor Baris Ata. He obtained my
Ph.D. in the Department of Management Science and Engineering (MS&E)
at Stanford University, where he was advised by Professor Jose
Blanchet and closely worked with Professor Ramesh Johari. He was a
member of the Stanford Operations Research Group. Previously, He
obtained a B.A. in Economics and a B.S. in Mathematics and Applied
Mathematics both from Peking University in 2017.
His research lies at the interface of operations research, statistics,
machine learning, and economics. He is also interested in real-world
operational problems arising from online platforms, including A/B
tests, recommendation systems, online advertising, cloud computing,
AI, etc.
Everyone is welcome to attend the talk!
Date:
Friday, February 28, 2025 - 16:30 to 17:30