Se-Young Yun

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

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

Logistic bandit is a ubiquitous framework of modeling users' choices, e.g., click vs. no click for advertisement recommender system. We observe that the prior works overlook or …

avatar
Junghyun Lee
Fair Streaming Principal Component Analysis: Statistical and Algorithmic Viewpoint featured image

Fair Streaming Principal Component Analysis: Statistical and Algorithmic Viewpoint

Proposes a framework for performing fair PCA in memory limited, streaming setting. Sample complexity results and empirical discussions show the superiority of our approach compared …

avatar
Junghyun Lee
Flooding with Absorption: An Efficient Protocol for Heterogeneous Bandits over Complex Networks featured image

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

A novel problem setting where heterogeneous multi-agent bandits collaborate over a network to minimize their group regret. To deal with the high communication complexity of the …

avatar
Junghyun Lee
Nearly Optimal Latent State Decoding in Block MDPs featured image

Nearly Optimal Latent State Decoding in Block MDPs

First theoretical analysis of model estimation and reward-free RL of block MDP, without resorting to function approximation frameworks. Lower bounds and algorithms with …

yassir-jedra