Se-Young Yun
Publications 14
Instance-Optimal Estimation with Multiple LLM Judges on a Budget New
NeurIPS 2026
ICML 2026 CTB Workshop
· Best Paper Award (Long Paper track)
Looking Through the Mirror: Minimax-Optimal Regularized Regrets in Online Learning and Bandits New
NeurIPS 2026
CKAIA 2026
· Distinguished Paper Award
Provably Efficient Regularized Online RLHF with Generalized Bilinear Preferences New
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
AISTATS 2026
Near-Optimal Clustering in Mixture of Markov Chains
AISTATS 2026
A Jointly Efficient and Optimal Algorithm for Heteroskedastic Generalized Linear Bandits with Adversarial Corruptions
arXiv:2602.10971
AdaSTaR: Adaptive Data Sampling for Training Self-Taught Reasoners
NeurIPS 2025
FlickerFusion: Intra-trajectory Domain Generalizing Multi-Agent RL
ICLR 2025
NeurIPS 2024 OWA Workshop
Probability-Flow ODE in Infinite-Dimensional Function Spaces
ICLR 2025 DeLTa Workshop
arXiv:2503.10219
A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits
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
AISTATS 2024
Fair Streaming Principal Component Analysis: Statistical and Algorithmic Viewpoint
NeurIPS 2023
Flooding with Absorption: An Efficient Protocol for Heterogeneous Bandits over Complex Networks
OPODIS 2023
· Best Student Paper Award
Nearly Optimal Latent State Decoding in Block MDPs
AISTATS 2023
CKAIA 2022
· Best Paper Award