Skip to content

Author

Qing-Yue Zhao

3 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization

A sharp analysis of KL-PCB (Zhao et al., 2026), showing that it achieves a sample complexity of $\tilde{O}(\eta SAC^{\pi^*}/\epsilon)$ under large regularization and a sample complexity of $\tilde{\Omega}(SAC^{\pi^*}/\epsilon^2)$ under small regularization.

Kaixuan Ji, Qi-Wei Di, He-Yang Zhao et al. · 4 citations · ⚡1
#machine learning Preprint Oct 2026

High-Probability Regret Bounds for Feel-Good Thompson Sampling

Feel-good Thompson sampling (FGTS) augments the posterior of vanilla Thompson sampling with an exploration term that favors reward functions with high predicted optimal values. This modification achieves minimax-optimal regret up to logarithmic factors in linear contextual bandits, but existing analyses of its two stan...

Xu-Heng Li, Qing-Yue Zhao, Quan-Quan Gu · 0 citations

Bandits with Multiple Optimal Arms: Minimax Regret and Non-Adaptivity

We study multi-armed bandits (MAB) with multiple optimal arms, motivated by the fact that many practical decision making problems admit multiple correct answers. For $K$-armed bandits with $A$ optimal arms, we first provide a sharper analysis of previous sub-sampling algorithms (De Heide et al., 2021; Zhu and Nowak, 20...

Kaixuan Ji, Qi-Wei Di, Qing-Yue Zhao et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.