Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2102.02049
Cited By
v1
v2
v3 (latest)
On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function
Annual Conference Computational Learning Theory (COLT), 2021
3 February 2021
Gellert Weisz
Philip Amortila
Barnabás Janzer
Yasin Abbasi-Yadkori
Nan Jiang
Csaba Szepesvári
OffRL
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function"
16 / 16 papers shown
Hybrid Reinforcement Learning from Offline Observation Alone
Yuda Song
J. Andrew Bagnell
Aarti Singh
OffRL
349
6
0
11 Jun 2024
RL in Markov Games with Independent Function Approximation: Improved Sample Complexity Bound under the Local Access Model
International Conference on Artificial Intelligence and Statistics (AISTATS), 2024
Junyi Fan
Yuxuan Han
Jialin Zeng
Jian-Feng Cai
Yang Wang
Yang Xiang
Jiheng Zhang
501
1
0
18 Mar 2024
Sample-Efficiency in Multi-Batch Reinforcement Learning: The Need for Dimension-Dependent Adaptivity
International Conference on Learning Representations (ICLR), 2023
Emmeran Johnson
Ciara Pike-Burke
Patrick Rebeschini
OffRL
382
2
0
02 Oct 2023
Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Games
International Conference on Machine Learning (ICML), 2023
Dylan J. Foster
Noah Golowich
Sham Kakade
287
14
0
22 Mar 2023
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
301
6
0
25 Feb 2023
Linear Reinforcement Learning with Ball Structure Action Space
International Conference on Algorithmic Learning Theory (ALT), 2022
Zeyu Jia
Randy Jia
Dhruv Madeka
Dean Phillips Foster
203
1
0
14 Nov 2022
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
254
6
0
18 Jul 2022
On the Statistical Efficiency of Reward-Free Exploration in Non-Linear RL
Neural Information Processing Systems (NeurIPS), 2022
Jinglin Chen
Aditya Modi
A. Krishnamurthy
Nan Jiang
Alekh Agarwal
416
29
0
21 Jun 2022
Learning in Observable POMDPs, without Computationally Intractable Oracles
Neural Information Processing Systems (NeurIPS), 2022
Noah Golowich
Ankur Moitra
Dhruv Rohatgi
279
33
0
07 Jun 2022
Computational-Statistical Gaps in Reinforcement Learning
D. Kane
Sihan Liu
Shachar Lovett
G. Mahajan
192
5
0
11 Feb 2022
TensorPlan and the Few Actions Lower Bound for Planning in MDPs under Linear Realizability of Optimal Value Functions
Gellert Weisz
Csaba Szepesvári
András Gyorgy
175
8
0
05 Oct 2021
A Boosting Approach to Reinforcement Learning
Neural Information Processing Systems (NeurIPS), 2021
Nataly Brukhim
Elad Hazan
Karan Singh
259
15
0
22 Aug 2021
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
419
24
0
12 Aug 2021
Sample Efficient Reinforcement Learning In Continuous State Spaces: A Perspective Beyond Linearity
International Conference on Machine Learning (ICML), 2021
Dhruv Malik
Aldo Pacchiano
Vishwak Srinivasan
Yuanzhi Li
190
7
0
15 Jun 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
When Is Generalizable Reinforcement Learning Tractable?
Neural Information Processing Systems (NeurIPS), 2021
Dhruv Malik
Yuanzhi Li
Pradeep Ravikumar
OffRL
623
27
0
01 Jan 2021
1
Page 1 of 1