Online Learning

Publications 3

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

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

Equal contribution

Equal contribution

arXiv:2602.10971

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