Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2002.07125
Cited By
Agnostic Q-learning with Function Approximation in Deterministic Systems: Tight Bounds on Approximation Error and Sample Complexity
17 February 2020
S. Du
Jason D. Lee
G. Mahajan
Ruosong Wang
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Agnostic Q-learning with Function Approximation in Deterministic Systems: Tight Bounds on Approximation Error and Sample Complexity"
27 / 27 papers shown
Computational Hardness of Reinforcement Learning with Partial
q
π
q^π
q
π
-Realizability
Shayan Karimi
Xiaoqi Tan
183
0
0
24 Oct 2025
Exponential Hardness of Reinforcement Learning with Linear Function Approximation
Annual Conference Computational Learning Theory (COLT), 2023
Daniel M. Kane
Sihan Liu
Shachar Lovett
G. Mahajan
Csaba Szepesvári
Gellert Weisz
300
6
0
25 Feb 2023
A Few Expert Queries Suffices for Sample-Efficient RL with Resets and Linear Value Approximation
Neural Information Processing Systems (NeurIPS), 2022
Philip Amortila
Nan Jiang
Dhruv Madeka
Dean Phillips Foster
253
6
0
18 Jul 2022
Target Network and Truncation Overcome The Deadly Triad in
Q
Q
Q
-Learning
SIAM Journal on Mathematics of Data Science (SIMODS), 2022
Zaiwei Chen
John-Paul Clarke
S. T. Maguluri
308
31
0
05 Mar 2022
Computational-Statistical Gaps in Reinforcement Learning
D. Kane
Sihan Liu
Shachar Lovett
G. Mahajan
185
5
0
11 Feb 2022
Efficient Local Planning with Linear Function Approximation
International Conference on Algorithmic Learning Theory (ALT), 2021
Dong Yin
Botao Hao
Yasin Abbasi-Yadkori
N. Lazić
Csaba Szepesvári
417
24
0
12 Aug 2021
Going Beyond Linear RL: Sample Efficient Neural Function Approximation
Baihe Huang
Kaixuan Huang
Sham Kakade
Jason D. Lee
Qi Lei
Runzhe Wang
Jiaqi Yang
230
10
0
14 Jul 2021
A Short Note on the Relationship of Information Gain and Eluder Dimension
Kaixuan Huang
Sham Kakade
Jason D. Lee
Qi Lei
167
10
0
06 Jul 2021
Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learning
Christoph Dann
T. V. Marinov
M. Mohri
Julian Zimmert
OffRL
322
40
0
02 Jul 2021
Gap-Dependent Bounds for Two-Player Markov Games
Zehao Dou
Zhuoran Yang
Zhaoran Wang
S. Du
140
8
0
01 Jul 2021
Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting
Neural Information Processing Systems (NeurIPS), 2021
Gen Li
Yuxin Chen
Yuejie Chi
Yuantao Gu
Yuting Wei
OffRL
325
33
0
17 May 2021
Cautiously Optimistic Policy Optimization and Exploration with Linear Function Approximation
Annual Conference Computational Learning Theory (COLT), 2021
Andrea Zanette
Ching-An Cheng
Alekh Agarwal
352
58
0
24 Mar 2021
Bilinear Classes: A Structural Framework for Provable Generalization in RL
International Conference on Machine Learning (ICML), 2021
S. Du
Sham Kakade
Jason D. Lee
Shachar Lovett
G. Mahajan
Wen Sun
Ruosong Wang
OffRL
606
204
0
19 Mar 2021
Improved Variance-Aware Confidence Sets for Linear Bandits and Linear Mixture MDP
Neural Information Processing Systems (NeurIPS), 2021
Zihan Zhang
Jiaqi Yang
Xiangyang Ji
S. Du
452
49
0
29 Jan 2021
A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost
Minbo Gao
Tianle Xie
S. Du
Lin F. Yang
242
51
0
02 Jan 2021
Exponential Lower Bounds for Batch Reinforcement Learning: Batch RL can be Exponentially Harder than Online RL
International Conference on Machine Learning (ICML), 2020
Andrea Zanette
OffRL
808
75
0
14 Dec 2020
Minimax Sample Complexity for Turn-based Stochastic Game
Conference on Uncertainty in Artificial Intelligence (UAI), 2020
Qiwen Cui
Lin F. Yang
233
24
0
29 Nov 2020
Logarithmic Regret for Reinforcement Learning with Linear Function Approximation
International Conference on Machine Learning (ICML), 2020
Jiafan He
Dongruo Zhou
Quanquan Gu
296
107
0
23 Nov 2020
Implicit Under-Parameterization Inhibits Data-Efficient Deep Reinforcement Learning
International Conference on Learning Representations (ICLR), 2020
Aviral Kumar
Rishabh Agarwal
Dibya Ghosh
Sergey Levine
OffRL
400
151
0
27 Oct 2020
Provably Efficient Reward-Agnostic Navigation with Linear Value Iteration
Andrea Zanette
A. Lazaric
Mykel J. Kochenderfer
Emma Brunskill
269
66
0
18 Aug 2020
On the Sample Complexity of Reinforcement Learning with Policy Space Generalization
Wenlong Mou
Zheng Wen
Xi Chen
277
12
0
17 Aug 2020
On Reward-Free Reinforcement Learning with Linear Function Approximation
Ruosong Wang
S. Du
Lin F. Yang
Ruslan Salakhutdinov
OffRL
290
115
0
19 Jun 2020
FLAMBE: Structural Complexity and Representation Learning of Low Rank MDPs
Alekh Agarwal
Sham Kakade
A. Krishnamurthy
Wen Sun
OffRL
543
255
0
18 Jun 2020
Q
Q
Q
-learning with Logarithmic Regret
Kunhe Yang
Lin F. Yang
S. Du
416
72
0
16 Jun 2020
Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction
Gen Li
Yuting Wei
Yuejie Chi
Yuantao Gu
Yuxin Chen
OffRL
569
133
0
04 Jun 2020
Reinforcement Learning with General Value Function Approximation: Provably Efficient Approach via Bounded Eluder Dimension
Ruosong Wang
Ruslan Salakhutdinov
Lin F. Yang
279
55
0
21 May 2020
Provably Efficient Exploration for Reinforcement Learning Using Unsupervised Learning
Fei Feng
Ruosong Wang
W. Yin
S. Du
Lin F. Yang
OffRL
SSL
476
7
0
15 Mar 2020
1
Page 1 of 1
