Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification

2 November 2021

Papers citing "Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification"

8 / 8 papers shown

Title
Optimal Regret Bounds for Collaborative Learning in Bandits Amitis Shidani Sattar Vakili 23 0 0 15 Dec 2023
Active Coverage for PAC Reinforcement Learning Aymen Al Marjani Andrea Tirinzoni E. Kaufmann OffRL 21 4 0 23 Jun 2023
On the Complexity of Representation Learning in Contextual Linear Bandits Andrea Tirinzoni Matteo Pirotta A. Lazaric 27 1 0 19 Dec 2022
$Choosing Answers in $\varepsilon$-Best-Answer Identification for Linear Bandits$ Choosing Answers in $\varepsilon$ -Best-Answer Identification for Linear Bandits Marc Jourdan Rémy Degenne 11 1 0 09 Jun 2022
Near-Optimal Collaborative Learning in Bandits Clémence Réda Sattar Vakili E. Kaufmann FedML 30 21 0 31 May 2022
Information-Directed Selection for Top-Two Algorithms Wei You Chao Qin Zihao Wang Shuoguang Yang 36 13 0 24 May 2022
On Elimination Strategies for Bandit Fixed-Confidence Identification Andrea Tirinzoni Rémy Degenne 41 7 0 22 May 2022
Optimal Clustering with Bandit Feedback Junwen Yang Zixin Zhong Vincent Y. F. Tan 11 12 0 09 Feb 2022