Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2011.14267
Cited By
Minimax Sample Complexity for Turn-based Stochastic Game
29 November 2020
Qiwen Cui
Lin F. Yang
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Minimax Sample Complexity for Turn-based Stochastic Game"
10 / 10 papers shown
Title
Settling the Sample Complexity of Online Reinforcement Learning
Zihan Zhang
Yuxin Chen
Jason D. Lee
S. Du
OffRL
167
23
0
25 Jul 2023
Q
Q
Q
-learning with Logarithmic Regret
Kunhe Yang
Lin F. Yang
S. Du
67
59
0
16 Jun 2020
Breaking the Sample Size Barrier in Model-Based Reinforcement Learning with a Generative Model
Gen Li
Yuting Wei
Yuejie Chi
Yuxin Chen
99
129
0
26 May 2020
Mastering Complex Control in MOBA Games with Deep Reinforcement Learning
Deheng Ye
Zhao Liu
Mingfei Sun
Bei Shi
P. Zhao
...
Tengfei Shi
Liang Wang
Qiang Fu
Wei Yang
Lanxiao Huang
55
316
0
20 Dec 2019
Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity
Aaron Sidford
Mengdi Wang
Lin F. Yang
Yinyu Ye
87
70
0
29 Aug 2019
Benchmarking Model-Based Reinforcement Learning
Tingwu Wang
Xuchan Bao
I. Clavera
Jerrick Hoang
Yeming Wen
Eric D. Langlois
Matthew Shunshi Zhang
Guodong Zhang
Pieter Abbeel
Jimmy Ba
OffRL
59
363
0
03 Jul 2019
Feature-Based Q-Learning for Two-Player Stochastic Games
Zeyu Jia
Lin F. Yang
Mengdi Wang
73
45
0
02 Jun 2019
Non-Asymptotic Gap-Dependent Regret Bounds for Tabular MDPs
Max Simchowitz
Kevin Jamieson
63
145
0
09 May 2019
Model-Based Reinforcement Learning for Atari
Lukasz Kaiser
Mohammad Babaeizadeh
Piotr Milos
B. Osinski
R. Campbell
...
Sergey Levine
Afroz Mohiuddin
Ryan Sepassi
George Tucker
Henryk Michalewski
OffRL
127
860
0
01 Mar 2019
Variance Reduced Value Iteration and Faster Algorithms for Solving Markov Decision Processes
Aaron Sidford
Mengdi Wang
X. Wu
Yinyu Ye
52
125
0
27 Oct 2017
1