On Query-efficient Planning in MDPs under Linear Realizability of the
Optimal State-value Function

v1v2v3 (latest)

On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function

3 February 2021

Philip Amortila

Barnabás Janzer

Yasin Abbasi-Yadkori

Csaba Szepesvári

ArXiv (abs)PDF HTML

Papers citing "On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function"

9 / 9 papers shown

Title
Hardness of Independent Learning and Sparse Equilibrium Computation in Markov Games Dylan J. Foster Noah Golowich Sham Kakade 88 11 0 22 Mar 2023
Learning in Observable POMDPs, without Computationally Intractable Oracles Noah Golowich Ankur Moitra Dhruv Rohatgi 78 27 0 07 Jun 2022
Computational-Statistical Gaps in Reinforcement Learning D. Kane Sihan Liu Shachar Lovett G. Mahajan 57 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 55 7 0 05 Oct 2021
A Boosting Approach to Reinforcement Learning Nataly Brukhim Elad Hazan Karan Singh 84 14 0 22 Aug 2021
Efficient Local Planning with Linear Function Approximation Dong Yin Botao Hao Yasin Abbasi-Yadkori N. Lazić Csaba Szepesvári 132 19 0 12 Aug 2021
Sample Efficient Reinforcement Learning In Continuous State Spaces: A Perspective Beyond Linearity Dhruv Malik Aldo Pacchiano Vishwak Srinivasan Yuanzhi Li 57 6 0 15 Jun 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 86 30 0 17 May 2021
When Is Generalizable Reinforcement Learning Tractable? Dhruv Malik Yuanzhi Li Pradeep Ravikumar OffRL 191 25 0 01 Jan 2021

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.