Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1905.10040
Cited By
OSOM: A simultaneously optimal algorithm for multi-armed and linear contextual bandits
24 May 2019
Niladri S. Chatterji
Vidya Muthukumar
Peter L. Bartlett
Re-assign community
ArXiv
PDF
HTML
Papers citing
"OSOM: A simultaneously optimal algorithm for multi-armed and linear contextual bandits"
10 / 10 papers shown
Title
Estimating Optimal Policy Value in General Linear Contextual Bandits
Jonathan Lee
Weihao Kong
Aldo Pacchiano
Vidya Muthukumar
Emma Brunskill
35
0
0
19 Feb 2023
Exploration in Linear Bandits with Rich Action Sets and its Implications for Inference
Debangshu Banerjee
Avishek Ghosh
Sayak Ray Chowdhury
Aditya Gopalan
40
9
0
23 Jul 2022
Best of Both Worlds Model Selection
Aldo Pacchiano
Christoph Dann
Claudio Gentile
39
10
0
29 Jun 2022
Breaking the
T
\sqrt{T}
T
Barrier: Instance-Independent Logarithmic Regret in Stochastic Contextual Linear Bandits
Avishek Ghosh
Abishek Sankararaman
32
3
0
19 May 2022
Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification
Clémence Réda
Andrea Tirinzoni
Rémy Degenne
31
9
0
02 Nov 2021
Provably Efficient Representation Selection in Low-rank Markov Decision Processes: From Online to Offline RL
Weitong Zhang
Jiafan He
Dongruo Zhou
Amy Zhang
Quanquan Gu
OffRL
27
11
0
22 Jun 2021
Leveraging Good Representations in Linear Contextual Bandits
Matteo Papini
Andrea Tirinzoni
Marcello Restelli
A. Lazaric
Matteo Pirotta
38
26
0
08 Apr 2021
Regret Balancing for Bandit and RL Model Selection
Yasin Abbasi-Yadkori
Aldo Pacchiano
My Phan
26
26
0
09 Jun 2020
Rate-adaptive model selection over a collection of black-box contextual bandit algorithms
Aurélien F. Bibaut
Antoine Chambaz
Mark van der Laan
37
6
0
05 Jun 2020
Model selection for contextual bandits
Dylan J. Foster
A. Krishnamurthy
Haipeng Luo
OffRL
34
90
0
03 Jun 2019
1