Bandits

Publications 9

Looking Through the Mirror: Minimax-Optimal Regularized Regrets in Online Learning and Bandits New

Junghyun Lee, Yujun Kim, Chulhee Yun, Se-Young Yun

NeurIPS 2026

CKAIA 2026 · Distinguished Paper Award

Provably Efficient Regularized Online RLHF with Generalized Bilinear Preferences New

Junghyun Lee, Minju Hong, Kwang-Sung Jun, Chulhee Yun, Se-Young Yun

NeurIPS 2026

ICML 2026 Pluralistic Alignment Workshop

CKAIA 2026 · Distinguished Paper Award

GL-LowPopArt: A Nearly Instance-Wise Minimax-Optimal Estimator for Generalized Low-Rank Trace Regression

Junghyun Lee, Kyoungseok Jang, Kwang-Sung Jun, Milan Vojnović, Se-Young Yun

AISTATS 2026

Pointwise or Pairwise: When Do Pairwise Losses Help Reward Learning, Provably?

Junghyun Lee, Minsoo Ha

Equal contribution; authorship in α-β order

Equal contribution; authorship in α-β order

, Yeongjong Kim

Equal contribution; authorship in α-β order

Equal contribution; authorship in α-β order

Equal contribution; authorship in α-β order

, Kwang-Sung Jun

arXiv:2609.37209

A Jointly Efficient and Optimal Algorithm for Heteroskedastic Generalized Linear Bandits with Adversarial Corruptions

Equal contribution

Equal contribution

arXiv:2602.10971

Cumulative Distribution Regret Minimization with Max-Quantile Threshold in Multi-Armed Bandit

Equal contribution

Equal contribution

KCC 2026 · Best Paper Award

A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits

Junghyun Lee, Se-Young Yun, Kwang-Sung Jun

PDF Code Poster Slides

NeurIPS 2024

ICML 2024 ARLET Workshop · Oral

CKAIA 2024 · Best Paper Award

Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion

Junghyun Lee, Se-Young Yun, Kwang-Sung Jun

PDF Code Poster Slides

AISTATS 2024

Flooding with Absorption: An Efficient Protocol for Heterogeneous Bandits over Complex Networks

Junghyun Lee, Laura Schmid, Se-Young Yun

PDF Code Poster Slides

OPODIS 2023 · Best Student Paper Award