Exponential Hardness of Reinforcement Learning with Linear Function Approximation

25 February 2023

Papers citing "Exponential Hardness of Reinforcement Learning with Linear Function Approximation"

3 / 3 papers shown

Title
Linear Bellman Completeness Suffices for Efficient Online Reinforcement Learning with Few Actions Noah Golowich Ankur Moitra OffRL 30 1 0 17 Jun 2024
Exploration is Harder than Prediction: Cryptographically Separating Reinforcement Learning from Supervised Learning Noah Golowich Ankur Moitra Dhruv Rohatgi OffRL 35 4 0 04 Apr 2024
Computationally Efficient PAC RL in POMDPs with Latent Determinism and Conditional Embeddings Masatoshi Uehara Ayush Sekhari Jason D. Lee Nathan Kallus Wen Sun 58 6 0 24 Jun 2022