Publications

* corresponding author · underlined names are group members and alumni · (α–β) alphabetical author order

Preprints

Rate-optimal algorithm for adversarial linear CMDPs

Kihyun Yu, Honghao Wei, Dabeen Lee*

Preprint arXiv · October 2026 arXiv

Minimax optimal regret for causal logistic bandits with counterfactual fairness

Junhyuk Huh, Seoungbin Bae, Dabeen Lee*

Preprint arXiv · October 2026 arXiv

Learning infinite-horizon average-reward CMDPs via state augmentation

Kihyun Yu, Seoungbin Bae, Dabeen Lee*

Preprint arXiv · September 2026 arXiv

Nonpreemptive scheduling while learning context-dependent service rates

Wansoo Choi, Seoungbin Bae, Dabeen Lee*

Preprint arXiv · September 2026 arXiv

Constrained online convex optimization without Slater's condition

Kihyun Yu, Junehee Lee, Dabeen Lee*

Preprint arXiv · June 2026 arXiv

Chebyshev center-based direction selection for multi-objective optimization and training PINNs

Hoyeol Yoon, Seoungbin Bae, Nam Ho-Nguyen, Dabeen Lee*

Preprint arXiv · May 2026 arXiv

Learning to route and schedule LLMs from user retrials via contextual queueing bandits

Seoungbin Bae, Junyoung Son, Dabeen Lee*

Preprint arXiv · February 2026 arXiv

Parameter-free algorithms for performative regret minimization under decision-dependent distributions

Sungwoo Park, Junyeop Kwon, Byeongnoh Kim, Suhyun Chae, Jeeyong Lee, Dabeen Lee*

Preprint arXiv · February 2024 arXiv

Journal articles and conference papers

Algorithm for contextual queueing bandits with rate-optimal queue length regret

Seoungbin Bae, Dabeen Lee*

Conference NeurIPS 2026 · Conference on Neural Information Processing Systems arXiv

Learning weakly communicating average-reward CMDPs: strong duality and improved regret

Kihyun Yu, Beomhan Baek, Dabeen Lee*

Conference NeurIPS 2026 · Conference on Neural Information Processing Systems arXiv

Logistic bandits with Õ(√dT) regret without context diversity assumptions

Seoungbin Bae, Dabeen Lee*

Conference NeurIPS 2026 · Conference on Neural Information Processing Systems arXiv

Near-optimal primal-dual algorithm for learning linear mixture CMDPs with adversarial rewards

Kihyun Yu, Seoungbin Bae, Dabeen Lee*

Conference CDC 2026 · IEEE Conference on Decision and Control arXiv

Neural logistic bandits

Seoungbin Bae, Dabeen Lee*

Conference ICML 2026 · International Conference on Machine Learning arXiv

Queue length regret bounds for contextual queueing bandits

Seoungbin Bae, Garyeong Kang, Dabeen Lee*

Conference ICLR 2026 · International Conference on Learning Representations arXiv

Primal–dual policy optimization for linear CMDPs with adversarial losses

Kihyun Yu, Seoungbin Bae, Dabeen Lee*

Conference ICLR 2026 · International Conference on Learning Representations OpenReview

A projection-free method for solving convex bilevel optimization problems

Khanh-Hung Giang-Tran, Nam Ho-Nguyen, Dabeen Lee*

Journal Mathematical Programming · 213 (2025) 473–516 arXiv

Honorable Mention, INFORMS Undergraduate Operations Research Prize, 2024 INFORMS

From coordinate subspaces over finite fields to ideal multipartite uniform clutters

Ahmad Abdi, Dabeen Lee* (α–β)

Journal Mathematical Programming · 213 (2025) 823–861 arXiv

Improved regret bound for safe reinforcement learning via tighter cost pessimism reward optimism

Kihyun Yu, Duksang Lee, William Overman, Dabeen Lee*

Journal Reinforcement Learning Journal · 6 (2025) 493–546 paper

Conference RLC 2025 · Reinforcement Learning Conference

An optimistic algorithm for online CMDPs with anytime adversarial constraints

Jiahui Zhu, Kihyun Yu, Dabeen Lee, Xin Liu, Honghao Wei

Conference ICML 2025 · International Conference on Machine Learning arXiv

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

Conference AISTATS 2025 · International Conference on Artificial Intelligence and Statistics paper

Learning infinite-horizon average-reward linear mixture MDPs of bounded span

Woojin Chae, Kihyuk Hong, Yufan Zhang, Ambuj Tewari, Dabeen Lee*

Conference AISTATS 2025 · International Conference on Artificial Intelligence and Statistics paper

Infinite-horizon reinforcement learning with multinomial logit function approximation

Jaehyun Park, Junyeop Kwon, Dabeen Lee*

Conference AISTATS 2025 · International Conference on Artificial Intelligence and Statistics paper

Conic mixed-binary sets: convex hull characterizations and applications

Fatma Kılınç-Karzan, Simge Küçükyavuz, Dabeen Lee*, Soroosh Shafieezadeh-Abadeh (α–β)

Journal Operations Research · 73(1) (2025) 251–269 arXiv

Stochastic-constrained stochastic optimization with Markovian data

Yeongjong Kim, Dabeen Lee*

Journal Journal of Machine Learning Research · 25(416) (2024) 1–69 paper

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* (α–β)

Journal INFORMS Journal on Optimization · 5(2) (2023) 211–232 arXiv

Test score algorithms for budgeted stochastic utility maximization

Dabeen Lee*, Milan Vojnovic, Se-Young Yun

Journal INFORMS Journal on Optimization · 5(1) (2023) 27–67 arXiv

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* (α–β)

Journal Mathematical Programming · 196 (2022) 641–672 arXiv

Joint chance-constrained programs and the intersection of mixing sets through a submodularity lens

Fatma Kılınç-Karzan, Simge Küçükyavuz, Dabeen Lee* (α–β)

Journal Mathematical Programming · 195 (2022) 283–326 arXiv

On a generalization of the Chvátal-Gomory closure

Sanjeeb Dash, Oktay Günlük, Dabeen Lee* (α–β)

Journal Mathematical Programming · 192 (2022) 149–175 arXiv

Conference 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 (α–β)

Journal Mathematical Programming · 192 (2022) 29–50 arXiv erratum

Conference IPCO 2020 · Integer Programming and Combinatorial Optimization, LNCS 12125 (2020) 1–12 pdf

Scheduling jobs with stochastic holding costs

Dabeen Lee*, Milan Vojnovic

Conference NeurIPS 2021 · Conference on Neural Information Processing Systems 34 (2021) 19375–19384 paper

Generalized Chvátal-Gomory closures for integer programs with bounds on variables

Sanjeeb Dash, Oktay Günlük, Dabeen Lee* (α–β)

Journal Mathematical Programming · 190 (2021) 393–425 pdf

Resistant sets in the unit hypercube

Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee (α–β)

Journal Mathematics of Operations Research · 46 (2021) 82–114 pdf

Intersecting restrictions in clutters

Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee (α–β)

Journal Combinatorica · 40 (2020) 605–623 pdf

Cuboids, a class of clutters

Ahmad Abdi, Gérard Cornuéjols, Natália Guričanová, Dabeen Lee (α–β)

Journal Journal of Combinatorial Theory B · 142 (2020) 144–209 pdf

On the rational polytopes with Chvátal rank 1

Gérard Cornuéjols, Dabeen Lee*, Yanjun Li (α–β)

Journal Mathematical Programming · 179 (2020) 21–46 pdf

Identically self-blocking clutters

Ahmad Abdi, Gérard Cornuéjols, Dabeen Lee (α–β)

Conference IPCO 2019 · Integer Programming and Combinatorial Optimization, LNCS 11480 (2019) 1–12 pdf

On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube

Dabeen Lee*

Journal Discrete Optimization · 32 (2019) 11–18 pdf

Deltas, extended odd holes and their blockers

Ahmad Abdi, Dabeen Lee (α–β)

Journal Journal of Combinatorial Theory B · 136 (2019) 193–203 pdf

On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank

Gérard Cornuéjols, Dabeen Lee (α–β)

Journal Mathematical Programming · 172 (2018) 467–503 pdf

Conference IPCO 2016 · Integer Programming and Combinatorial Optimization, LNCS 9682 (2016) 300–311 pdf

Second Place, INFORMS Optimization Society Student Paper Prize, 2019 INFORMS

Egon Balas Award, Tepper School of Business, CMU, 2016 Tepper

Ph.D. thesis

Cutting planes and integrality of polyhedra: structure and complexity

Dabeen Lee

Tepper School of Business, Carnegie Mellon University, 2019 pdf slides

Gerald L. Thompson Doctoral Dissertation Award, Tepper School of Business, CMU, 2019 Tepper