Assistant Professor, Department of Mathematical Sciences, Seoul National University (SNU)
Affiliate Professor, Interdisciplinary Program in AI, Seoul National University (SNU) Affiliate Professor, Center for AI and Natural Sciences, Korea Institute for Advanced Study (KIAS)
Office: 27-205, Tel: 02-880-1328 E-mail: dabeenl [at] snu [dot] ac [dot] kr
I am an assistant professor in the Department of Mathematical Sciences at the Seoul National University (SNU). Prior to joining SNU, I was an assistant professor in the Department of Industrial and Systems Engineering (ISysE) at the Korea Advanced Institute of Science and Technology (KAIST), a post-doc in the Discrete Mathematics Group at the Institute for Basic Science (IBS), hosted by Sang-il Oum, and a recipient of the IBS Young Scientist Fellowship (YSF).
I obtained my Ph.D. in the Algorithms, Combinatorics, and Optimization (ACO) program at the Tepper School of Business, Carnegie Mellon University, advised by Gérard Cornuéjols. My thesis won the Gerald L. Thompson Doctoral Dissertation Award for the best Ph.D. thesis in the area of management Science, and I was supported by Henry J. Gailliot Presidential Fellowship. A part of my thesis received Second Place in the INFORMS Optimization Society Best Student Paper Prize Competition 2019.
CV (pdf)
I am interested in designing algorithms and mathematical programming frameworks for broad areas of optimization spanning discrete, combinatorial, integer, continuous, convex, online, stochastic, robust, and distributionally robust optimization. Currently, I am working on nonlinear combinatorial optimization and the seamless integration of machine learning and optimization with applications in combinatorial decision-making. My latest research projects are on bilevel polynomial optimization, online reinforcement learning theory, stochastic optimization under decision-dependent distributions, first-order methods for constrained optimization, and distributionally robust optimization frameworks.
MA1407.000500 Mathematical Algorithms II, Fall 2025, 2026
3341.454 Mathematical and Numerical Optimization, Spring 2026
IE331 Operations Research: Optimization, Spring 2023, 2024
IE539 Convex Optimization, Fall 2022, 2023, 2024
IE631 Integer Programming, Spring 2023, 2025
DS801 Advanced Optimization for Data Science, Spring 2024
Introduction to Modern Combinatorial Optimization, Winter Lecture Series 2025 at POSTECH
Constrained Online Convex Optimization without Slater's Condition, June 2026
Kihyun Yu, Junehee Lee, Dabeen Lee*
Algorithm for Contextual Queueing Bandits with Rate-Optimal Queue Length Regret, June 2026
Seoungbin Bae, Dabeen Lee*
Learning weakly communicating average-reward CMDPs: strong duality and improved regret, May 2026
Kihyun Yu, Beomhan Baek, Dabeen Lee*
Chebyshev center-based direction selection for multi-objective optimization and training PINNs, May 2026
Hoyeol Yoon, Seoungbin Bae, Nam Ho-Nguyen, Dabeen Lee*
Logistic bandits with Õ(√dT) regret without context diversity assumptions, April 2026
Seoungbin Bae, Dabeen Lee*
Learning to route and schedule LLMs from user retrials via contextual queueing bandits, February 2026
Seoungbin Bae, Junyoung Son, Dabeen Lee*
Parameter-free algorithms for performative regret minimization under decision-dependent distributions, February 2024
Sungwoo Park, Junyeop Kwon, Byeongnoh Kim, Suhyun Chae, Jeeyong Lee, Dabeen Lee*
Near-optimal primal-dual algorithm for learning linear mixture CMDPs with adversarial rewards
Kihyun Yu, Seoungbin Bae, Dabeen Lee*
CDC 2026 (IEEE Conference on Decision and Control)
Neural logistic bandits
Seoungbin Bae, Dabeen Lee*
ICML 2026 (International Conference on Machine Learning)
Queue length regret bounds for contextual queueing bandits
Seoungbin Bae, Garyeong Kang, Dabeen Lee*
ICLR 2026 (International Conference on Learning Representations)
Primal–dual policy optimization for linear CMDPs with adversarial losses
Kihyun Yu, Seoungbin Bae, Dabeen Lee*
ICLR 2026 (International Conference on Learning Representations)
A projection-free method for solving convex bilevel optimization problems
Khanh-Hung Giang-Tran, Nam Ho-Nguyen, Dabeen Lee*
Mathematical Programming 213 (2025) 473-516.
Honorable Mention in the INFORMS Undergraduate Operations Research Prize, 2024
From coordinate subspaces over finite fields to ideal multipartite uniform clutters
Ahmad Abdi, Dabeen Lee* (α - β)
Mathematical Programming 213 (2025) 823-861.
Improved regret bound for safe reinforcement learning via tighter cost pessimism reward optimism
Kihyun Yu, Duksang Lee, William Overman, Dabeen Lee*
RLC 2025 (Reinforcement Learning Conference).
Journal version: Reinforcement Learning Journal 6 (2025) 493-546.
An optimistic algorithm for online CMDPS with anytime adversarial constraints
Jiahui Zhu, Kihyun Yu, Dabeen Lee, Xin Liu, Honghao Wei
ICML 2025 (International Conference on Machine Learning)
Reinforcement learning for infinite-horizon average-reward linear MDPs via approximation by discounted-reward MDPs
Kihyuk Hong, Woojin Chae, Yufan Zhang, Dabeen Lee, Ambuj Tewari
AISTATS 2025 (International Conference on Artificial Intelligence and Statistics).
Learning infinite-horizon average-reward linear mixture MDPs of bounded span
Woojin Chae, Kihyuk Hong, Yufan Zhang, Ambuj Tewari, Dabeen Lee*
AISTATS 2025 (International Conference on Artificial Intelligence and Statistics).
Infinite-horizon reinforcement learning with multinomial logit function approximation
Jaehyun Park, Junyeop Kwon, Dabeen Lee*
AISTATS 2025 (International Conference on Artificial Intelligence Statistics).
Conic mixed-binary sets: convex hull characterizations applications
Fatma Kılınç-Karzan, Simge Küçükyavuz, Dabeen Lee*, Soroosh Shafieezadeh-Abadeh (α - β)
Operations Research 73(1) (2025) 251-269.
Stochastic-constrained stochastic optimization with Markovian data
Yeongjong Kim, Dabeen Lee*.
Journal of Machine Learning Research 25(416) (2024) 1-69.
Strong formulations for distributionally robust chance-constrained programs with left-hand side uncertainty under Wasserstein ambiguity
Nam Ho-Nguyen, Fatma Kılınç-Karzan, Simge Küçükyavuz, Dabeen Lee* (α - β)
INFORMS Journal on Optimization 5(2) (2023) 211-232.
Test score algorithms for budgeted stochastic utility maximization
Dabeen Lee*, Milan Vojnovic, Se-Young Yun.
INFORMS Journal on Optimization 5(1) (2023) 27-67.
Distributionally robust chance-constrained programs with right-hand side uncertainty under Wasserstein ambiguity
Nam Ho-Nguyen, Fatma Kılınç-Karzan, Simge Küçükyavuz, Dabeen Lee* (α - β)
Mathematical Programming 196 (2022) 641-672.
Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens
Fatma Kılınç-Karzan, Simge Küçükyavuz, Dabeen Lee* (α - β)
Mathematical Programming 195 (2022) 283-326.
On a generalization of the Chvátal-Gomory closure
Sanjeeb Dash, Oktay Günlük, Dabeen Lee* (α - β)
Mathematical Programming 192 (2022) 149-175.
Conference version: IPCO 2020 (Integer Programming and Combinatorial Optimization), LNCS 12125 (2020) 117-129 (pdf).
Idealness of k-wise intersecting families
Ahmad Abdi, Gérard Cornuéjols, Tony Huynh, Dabeen Lee (α - β)
Mathematical Programming 192 (2022) 29-50 (Erratum: link).
Conference version: IPCO 2020 (Integer Programming and Combinatorial Optimization), LNCS 12125 (2020) 1-12 (pdf).
Scheduling jobs with stochastic holding costs
Dabeen Lee*, Milan Vojnovic
September 2022.
NeurIPS 2021 (Conference on Neural Information Processing Systems) 34 (2021) 19375-19384
Generalized Chvátal-Gomory closures for integer programs with bounds on variables
Sanjeeb Dash, Oktay Günlük, Dabeen Lee* (α - β)
Mathematical Programming 190 (2021) 393-425.
Resistant sets in the unit hypercube
Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee (α - β)
Mathematics of Operations Research 46 (2021) 82-114.
Intersecting restrictions in clutters
Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee (α - β)
Combinatorica 40 (2020) 605-623.
Cuboids, a class of clutters
Ahmad Abdi, Gérard Cornuéjols, Natália Guričanová, Dabeen Lee (α - β)
Journal of Combinatorial Theory B 142 (2020) 144-209.
On the rational polytopes with Chvátal rank 1
Gérard Cornuéjols, Dabeen Lee*, Yanjun Li (α - β)
Mathematical Programming 179 (2020) 21-46.
Identically self-blocking clutters
Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee (α - β)
IPCO 2019 (Integer Programming and Combinatorial Optimization), LNCS 11480 (2019) 1-12.
On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube
Dabeen Lee*
Discrete Optimization 32 (2019) 11-18.
Deltas, extended odd holes and their blockers
Ahmad Abdi, Dabeen Lee (α - β)
Journal of Combinatorial Theory B 136 (2019) 193-203.
On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank
Gérard Cornuéjols, Dabeen Lee (α - β)
Mathematical Programming 172 (2018) 467-503.
Conference version: IPCO 2016 (Integer Programming and Combinatorial Optimization), LNCS 9682 (2016) 300-311 (pdf).
Second-place in the INFORMS Optimization Society Student Paper Prize Competition, 2019
Center for foundations of mathematical algorithms and security, 2026-2033
Science Research Center (SRC), National Research Foundation (NRF) of Korea, Co-PI
Beyond transformer, beyond next-token prediction: hierarchical spectral state-space model with mathematical guarantees and unified learning algorithms, 2026-2031
Next Generation AI+S&T, National Research Foundation (NRF) of Korea, Co-PI
SOTA-MATH: center for specialized orchestration and training of AI for frontier mathematics, 2026-2032
AI4S&T, National Research Foundation (NRF) of Korea, Co-PI
Intelligent national defense swarm system, 2024-2031
ITRC, Institute for Information & communication Technology Planning & evaluation (IITP) of Korea, Co-PI
Artificial intelligence-based end-to-end framework for black-box combinatorial optimization, 2024-2027
Young Researcher Grant, National Research Foundation (NRF) of Korea, PI
Deep learning foundation model for combinatorial optimization and its applications to various industrial problems, 2024-2025
Basic Research Lab (BRL), National Research Foundation (NRF) of Korea, Co-PI
Combinatorial optimization for data-driven decision making, 2021-2023
Young Scientist Fellowship (YSF), Institute for Basic Science (IBS) of Korea, PI
Generative AI-based JEDEC vector generator, SK Hynix, 2025.
Multi-system IO margin optimization via test mode register set (TMRS) combination search, Samsung Electronics DRAM AE Team, 2024.
Optimal test mode register set (TMRS) combination search, Samsung Electronics DRAM AE Team, 2023.
Seoungbin Bae (KAIST ISE, 2024 - )
Kihyun Yu (KAIST ISE, 2024 - )
Hoyeol Yoon (KAIST ISE, 2025 - )
Junehee Lee (SNU Math, 2025 - )
Juhyeok Choi (SNU Math, 2025 - )
Taewoong Eom (SNU Math, 2026 - )
Jinwoo Kim (SNU Math, 2026 - )
Euro Kim (SNU AI, 2026 - )
Jimin Chae (SNU Math, 2026 - )
Minsuk Yoo (SNU Math, 2026 - )
Duksang Lee (Post-doc, KAIST ISE, 2022 - 2023)
Yeongjong Kim (Ph.D. Intern, KAIST Math, 2022 - 2023)
Jaehyun Park (M.S. in KAIST ISE, 2025)
Junyeop Kwon (M.S. in KAIST ISE, 2025)
Sungwoo Park (M.S. in KAIST ISE, 2025)
Junyoung Son (M.S. in KAIST ISE, 2026)
Garyeong Kang (URP KAIST ISE, 2025)
Woojin Chae (URP KAIST Math, 2024)
Ahmad Abdi, Gérard Cornuéjols, Sanjeeb Dash, Khanh-Hung Giang-Tran, Oktay Günlük, Natália Guričanová, Kihyuk Hong, Nam Ho-Nguyen, Tony Huynh, Fatma Kılınç-Karzan, Yeongjong Kim, Simge Küçükyavuz, Duksang Lee, Yanjun Li, Xin Liu, William Overman, Soroosh Shafieezadeh-Abadeh, Ambuj Tewari, Milan Vojnovic, Honghao Wei, Se-Young Yun, Jiahui Zhu