Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1710.09988
Cited By
Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes
27 October 2017
Aaron Sidford
Mengdi Wang
X. Wu
Yinyu Ye
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes"
10 / 10 papers shown
Title
Gap-Dependent Bounds for Q-Learning using Reference-Advantage Decomposition
Zhong Zheng
Haochen Zhang
Lingzhou Xue
OffRL
97
2
0
10 Oct 2024
Reinforcement learning
Florentin Wörgötter
67
2,569
0
16 May 2024
Settling the Sample Complexity of Online Reinforcement Learning
Zihan Zhang
Yuxin Chen
Jason D. Lee
S. Du
OffRL
125
22
0
25 Jul 2023
Lower Bound On the Computational Complexity of Discounted Markov Decision Problems
Yichen Chen
Mengdi Wang
33
18
0
20 May 2017
The Value Iteration Algorithm is Not Strongly Polynomial for Discounted Dynamic Programming
E. Feinberg
Jefferson Huang
41
33
0
19 Dec 2013
Improved and Generalized Upper Bounds on the Complexity of Policy Iteration
B. Scherrer
52
75
0
03 Jun 2013
On the Complexity of Solving Markov Decision Problems
Michael L. Littman
T. Dean
L. Kaelbling
52
584
0
20 Feb 2013
On the Complexity of Policy Iteration
Yishay Mansour
Satinder Singh
46
101
0
23 Jan 2013
On the Sample Complexity of Reinforcement Learning with a Generative Model
M. G. Azar
Rémi Munos
H. Kappen
52
156
0
27 Jun 2012
PAC Bounds for Discounted MDPs
Tor Lattimore
Marcus Hutter
68
188
0
17 Feb 2012
1