Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2006.05879
Cited By
Planning in Markov Decision Processes with Gap-Dependent Sample Complexity
10 June 2020
Anders Jonsson
E. Kaufmann
Pierre Ménard
O. D. Domingues
Edouard Leurent
Michal Valko
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Planning in Markov Decision Processes with Gap-Dependent Sample Complexity"
10 / 10 papers shown
Title
Gap-Dependent Bounds for Q-Learning using Reference-Advantage Decomposition
Zhong Zheng
Haochen Zhang
Lingzhou Xue
OffRL
78
2
0
10 Oct 2024
Policy Finetuning in Reinforcement Learning via Design of Experiments using Offline Data
Ruiqi Zhang
Andrea Zanette
OffRL
OnRL
42
7
0
10 Jul 2023
Towards Theoretical Understanding of Inverse Reinforcement Learning
Alberto Maria Metelli
Filippo Lazzati
Marcello Restelli
29
13
0
25 Apr 2023
Fast Rates for Maximum Entropy Exploration
D. Tiapkin
Denis Belomestny
Daniele Calandriello
Eric Moulines
Rémi Munos
A. Naumov
Pierre Perrault
Yunhao Tang
Michal Valko
Pierre Menard
46
18
0
14 Mar 2023
Feeling Optimistic? Ambiguity Attitudes for Online Decision Making
Jared Beard
R. Butts
Yu Gu
19
0
0
07 Mar 2023
Gap-Dependent Unsupervised Exploration for Reinforcement Learning
Jingfeng Wu
Vladimir Braverman
Lin F. Yang
33
12
0
11 Aug 2021
Navigating to the Best Policy in Markov Decision Processes
Aymen Al Marjani
Aurélien Garivier
Alexandre Proutiere
35
21
0
05 Jun 2021
Adaptive Reward-Free Exploration
E. Kaufmann
Pierre Ménard
O. D. Domingues
Anders Jonsson
Edouard Leurent
Michal Valko
30
80
0
11 Jun 2020
POLY-HOOT: Monte-Carlo Planning in Continuous Space MDPs with Non-Asymptotic Analysis
Weichao Mao
Kaipeng Zhang
Qiaomin Xie
Tamer Basar
21
14
0
08 Jun 2020
Mixture Martingales Revisited with Applications to Sequential Tests and Confidence Intervals
E. Kaufmann
Wouter M. Koolen
21
117
0
28 Nov 2018
1