Introduces transductive linear bandits, gives instance-dependent lower bounds, and presents an algorithm matching them up to logarithmic factors, including the first non-asymptotic near-optimal method for standard linear bandits.
Combinatorial pure exploration of multi-armed bandits
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sequential Experimental Design for Transductive Linear Bandits
Introduces transductive linear bandits, gives instance-dependent lower bounds, and presents an algorithm matching them up to logarithmic factors, including the first non-asymptotic near-optimal method for standard linear bandits.