Kwang-Sung Jun

Second-Order Bounds for $[0,1]$-Valued Regression via Betting Loss COLT 2026 Fixing the Loose Brake: Exponential-Tailed Stopping Time in Best Arm Identification ICML 2025 HAVER: Instance-Dependent Error Bounds for Maximum Mean Estimation and Applications to Q-Learning and Monte Carlo Tree Search AISTATS 2025 Improved Offline Contextual Bandits with Second-Order Bounds: Betting and Freezing COLT 2025 Minimum Empirical Divergence for Sub-Gaussian Linear Bandits AISTATS 2025 Adaptive Experimentation When You Can't Experiment NeurIPS 2024 A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits NeurIPS 2024 Better-than-KL PAC-Bayes Bounds COLT 2024 Efficient Low-Rank Matrix Estimation, Experimental Design, and Arm-Set-Dependent Low-Rank Bandits ICML 2024 Improved Regret Bounds of (Multinomial) Logistic Bandits via Regret-to-Confidence-Set Conversion AISTATS 2024 Noise-Adaptive Confidence Sets for Linear Bandits and Application to Bayesian Optimization ICML 2024 Kullback-Leibler Maillard Sampling for Multi-armed Bandits with Bounded Rewards NeurIPS 2023 Revisiting Simple Regret: Fast Rates for Returning a Good Arm ICML 2023 Tighter PAC-Bayes Bounds Through Coin-Betting COLT 2023 An Experimental Design Approach for Regret Minimization in Logistic Bandits AAAI 2022 Improved Regret Analysis for Variance-Adaptive Linear Bandits and Horizon-Free Linear Mixture MDPs NeurIPS 2022 Jointly Efficient and Optimal Algorithms for Logistic Bandits AISTATS 2022 Maillard Sampling: Boltzmann Exploration Done Optimally AISTATS 2022 Norm-Agnostic Linear Bandits AISTATS 2022 PopArt: Efficient Sparse Regression and Experimental Design for Optimal Sparse Linear Bandits NeurIPS 2022 Improved Confidence Bounds for the Linear Logistic Model and Applications to Bandits ICML 2021 Improved Regret Bounds of Bilinear Bandits using Action Space Analysis ICML 2021 Crush Optimism with Pessimism: Structured Bandits Beyond Asymptotic Optimality NeurIPS 2020 Bilinear Bandits with Low-rank Structure ICML 2019 Kernel Truncated Randomized Ridge Regression: Optimal Rates and Low Noise Acceleration NeurIPS 2019 Parameter-Free Online Convex Optimization with Sub-Exponential Noise COLT 2019 Adversarial Attacks on Stochastic Bandits NeurIPS 2018 Improved Strongly Adaptive Online Learning using Coin Betting AISTATS 2017 Scalable Generalized Linear Bandits: Online Computation and Hashing NeurIPS 2017 Anytime Exploration for Multi-armed Bandits using Confidence Information ICML 2016 Top Arm Identification in Multi-Armed Bandits with Batch Arm Pulls AISTATS 2016 Human Memory Search as Initial-Visit Emitting Random Walk NeurIPS 2015 Learning from Human-Generated Lists ICML 2013 Learning from Bullying Traces in Social Media NAACL 2012