Papers
Communities
Events
Blog
Pricing
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
J. Lee
G. Mahajan
Ruosong Wang
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Agnostic Q-learning with Function Approximation in Deterministic Systems: Tight Bounds on Approximation Error and Sample Complexity"
14 / 14 papers shown
Title
Exponential Hardness of Reinforcement Learning with Linear Function Approximation
Daniel M. Kane
Sihan Liu
Shachar Lovett
G. Mahajan
Csaba Szepesvári
Gellert Weisz
46
3
0
25 Feb 2023
Provably Efficient Reinforcement Learning via Surprise Bound
Hanlin Zhu
Ruosong Wang
Jason D. Lee
OffRL
28
5
0
22 Feb 2023
A Few Expert Queries Suffices for Sample-Efficient RL with Resets and Linear Value Approximation
P. Amortila
Nan Jiang
Dhruv Madeka
Dean Phillips Foster
29
5
0
18 Jul 2022
Target Network and Truncation Overcome The Deadly Triad in
Q
Q
Q
-Learning
Zaiwei Chen
John-Paul Clarke
S. T. Maguluri
20
19
0
05 Mar 2022
Efficient Local Planning with Linear Function Approximation
Dong Yin
Botao Hao
Yasin Abbasi-Yadkori
N. Lazić
Csaba Szepesvári
32
19
0
12 Aug 2021
Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting
Gen Li
Yuxin Chen
Yuejie Chi
Yuantao Gu
Yuting Wei
OffRL
26
28
0
17 May 2021
Cautiously Optimistic Policy Optimization and Exploration with Linear Function Approximation
Andrea Zanette
Ching-An Cheng
Alekh Agarwal
32
52
0
24 Mar 2021
Improved Variance-Aware Confidence Sets for Linear Bandits and Linear Mixture MDP
Zihan Zhang
Jiaqi Yang
Xiangyang Ji
S. Du
71
36
0
29 Jan 2021
Exponential Lower Bounds for Batch Reinforcement Learning: Batch RL can be Exponentially Harder than Online RL
Andrea Zanette
OffRL
26
71
0
14 Dec 2020
Provably Efficient Reward-Agnostic Navigation with Linear Value Iteration
Andrea Zanette
A. Lazaric
Mykel J. Kochenderfer
Emma Brunskill
30
64
0
18 Aug 2020
FLAMBE: Structural Complexity and Representation Learning of Low Rank MDPs
Alekh Agarwal
Sham Kakade
A. Krishnamurthy
Wen Sun
OffRL
41
223
0
18 Jun 2020
Q
Q
Q
-learning with Logarithmic Regret
Kunhe Yang
Lin F. Yang
S. Du
43
59
0
16 Jun 2020
Reinforcement Learning with General Value Function Approximation: Provably Efficient Approach via Bounded Eluder Dimension
Ruosong Wang
Ruslan Salakhutdinov
Lin F. Yang
23
55
0
21 May 2020
Optimism in Reinforcement Learning with Generalized Linear Function Approximation
Yining Wang
Ruosong Wang
S. Du
A. Krishnamurthy
135
135
0
09 Dec 2019
1