7 citations · 11 across the 9 of their papers we have counts for
Showing stat.MLShow all
2 papers · 1 filter
stat.ML2023★ 2 cited
Optimal Exploration is no harder than Thompson Sampling
Zhaoqi Li, Kevin Jamieson, Lalit Jain
Given a set of arms and an unknown parameter vector , the pure exploration linear bandit problem aims to return $\arg\max_{…
stat.ML2015★ 7 cited
Sparse Dueling Bandits
Kevin Jamieson, Sumeet Katariya, Atul Deshpande +1
The dueling bandit problem is a variation of the classical multi-armed bandit in which the allowable actions are noisy comparisons between pairs of arms. This paper focuses on a ne…