Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2104.03781
Cited By
Leveraging Good Representations in Linear Contextual Bandits
8 April 2021
Matteo Papini
Andrea Tirinzoni
Marcello Restelli
A. Lazaric
Matteo Pirotta
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Leveraging Good Representations in Linear Contextual Bandits"
23 / 23 papers shown
Title
Sparse Nonparametric Contextual Bandits
Hamish Flynn
Julia Olkhovskaya
Paul Rognon-Vael
51
0
0
20 Mar 2025
Linear Contextual Bandits with Hybrid Payoff: Revisited
Nirjhar Das
Gaurav Sinha
20
0
0
14 Jun 2024
Adaptive Regularization of Representation Rank as an Implicit Constraint of Bellman Equation
Qiang He
Dinesh Manocha
Meng Fang
S. Maghsudi
29
3
0
19 Apr 2024
Doubly High-Dimensional Contextual Bandits: An Interpretable Model for Joint Assortment-Pricing
Junhui Cai
Ran Chen
Martin J. Wainwright
Linda H. Zhao
16
4
0
14 Sep 2023
Active Coverage for PAC Reinforcement Learning
Aymen Al Marjani
Andrea Tirinzoni
E. Kaufmann
OffRL
21
4
0
23 Jun 2023
Federated Linear Contextual Bandits with User-level Differential Privacy
Ruiquan Huang
Huanyu Zhang
Luca Melis
Milan Shen
Meisam Hajzinia
J. Yang
FedML
23
11
0
08 Jun 2023
Ranking with Popularity Bias: User Welfare under Self-Amplification Dynamics
Guy Tennenholtz
Martin Mladenov
Nadav Merlis
Robert L. Axtell
Craig Boutilier
14
0
0
24 May 2023
On the Interplay Between Misspecification and Sub-optimality Gap in Linear Contextual Bandits
Weitong Zhang
Jiafan He
Zhiyuan Fan
Q. Gu
102
5
0
16 Mar 2023
Bounded (O(1)) Regret Recommendation Learning via Synthetic Controls Oracle
Hyunwook Kang
P. R. Kumar
OffRL
33
1
0
29 Jan 2023
On the Complexity of Representation Learning in Contextual Linear Bandits
Andrea Tirinzoni
Matteo Pirotta
A. Lazaric
27
1
0
19 Dec 2022
On Instance-Dependent Bounds for Offline Reinforcement Learning with Linear Function Approximation
Thanh Nguyen-Tang
Ming Yin
Sunil R. Gupta
Svetha Venkatesh
R. Arora
OffRL
58
16
0
23 Nov 2022
Scalable Representation Learning in Linear Contextual Bandits with Constant Regret Guarantees
Andrea Tirinzoni
Matteo Papini
Ahmed Touati
A. Lazaric
Matteo Pirotta
28
4
0
24 Oct 2022
Model Selection in Batch Policy Optimization
Jonathan Lee
George Tucker
Ofir Nachum
Bo Dai
OffRL
19
12
0
23 Dec 2021
Offline Neural Contextual Bandits: Pessimism, Optimization and Generalization
Thanh Nguyen-Tang
Sunil R. Gupta
A. Nguyen
Svetha Venkatesh
OffRL
29
28
0
27 Nov 2021
Universal and data-adaptive algorithms for model selection in linear contextual bandits
Vidya Muthukumar
A. Krishnamurthy
19
5
0
08 Nov 2021
Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification
Clémence Réda
Andrea Tirinzoni
Rémy Degenne
25
9
0
02 Nov 2021
Reinforcement Learning in Linear MDPs: Constant Regret and Representation Selection
Matteo Papini
Andrea Tirinzoni
Aldo Pacchiano
Marcello Restelli
A. Lazaric
Matteo Pirotta
19
18
0
27 Oct 2021
Representation Learning for Online and Offline RL in Low-rank MDPs
Masatoshi Uehara
Xuezhou Zhang
Wen Sun
OffRL
62
126
0
09 Oct 2021
Pessimistic Model-based Offline Reinforcement Learning under Partial Coverage
Masatoshi Uehara
Wen Sun
OffRL
98
9
0
13 Jul 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
22
11
0
22 Jun 2021
Feature and Parameter Selection in Stochastic Linear Bandits
Ahmadreza Moradipari
Berkay Turan
Yasin Abbasi-Yadkori
M. Alizadeh
Mohammad Ghavamzadeh
101
5
0
09 Jun 2021
Pareto Optimal Model Selection in Linear Bandits
Yinglun Zhu
Robert D. Nowak
8
13
0
12 Feb 2021
Stochastic Linear Contextual Bandits with Diverse Contexts
Weiqiang Wu
Jing Yang
Cong Shen
49
13
0
05 Mar 2020
1