Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2010.12247
Cited By
An Asymptotically Optimal Primal-Dual Incremental Algorithm for Contextual Linear Bandits
23 October 2020
Andrea Tirinzoni
Matteo Pirotta
Marcello Restelli
A. Lazaric
Re-assign community
ArXiv
PDF
HTML
Papers citing
"An Asymptotically Optimal Primal-Dual Incremental Algorithm for Contextual Linear Bandits"
9 / 9 papers shown
Title
Sequential Learning of the Pareto Front for Multi-objective Bandits
Elise Crépon
Aurélien Garivier
Wouter M. Koolen
52
1
0
29 Jan 2025
Scalable Representation Learning in Linear Contextual Bandits with Constant Regret Guarantees
Andrea Tirinzoni
Matteo Papini
Ahmed Touati
A. Lazaric
Matteo Pirotta
33
4
0
24 Oct 2022
On Elimination Strategies for Bandit Fixed-Confidence Identification
Andrea Tirinzoni
Rémy Degenne
47
7
0
22 May 2022
Instance-Dependent Regret Analysis of Kernelized Bandits
S. Shekhar
T. Javidi
29
3
0
12 Mar 2022
Efficient Kernel UCB for Contextual Bandits
Houssam Zenati
A. Bietti
Eustache Diemert
Julien Mairal
Matthieu Martin
Pierre Gaillard
29
3
0
11 Feb 2022
Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridge
Reda Ouhamma
Odalric-Ambrym Maillard
Vianney Perchet
27
11
0
02 Nov 2021
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
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
Leveraging Good Representations in Linear Contextual Bandits
Matteo Papini
Andrea Tirinzoni
Marcello Restelli
A. Lazaric
Matteo Pirotta
35
26
0
08 Apr 2021
1