1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.LG2020★ 1 cited
Fully Gap-Dependent Bounds for Multinomial Logit Bandit
Jiaqi Yang
We study the multinomial logit (MNL) bandit problem, where at each time step, the seller offers an assortment of size at most from a pool of items, and the buyer purchases…
cs.LG2020
Linear Bandits with Limited Adaptivity and Learning Distributional Optimal Design
Yufei Ruan, Jiaqi Yang, Yuan Zhou
Motivated by practical needs such as large-scale learning, we study the impact of adaptivity constraints to linear contextual bandits, a central problem in online active learning.…