Computational Hardness of Reinforcement Learning with Partial $q^{\ddot{I}}€$-Realizability

Shayan Karimi, Xiaoqi Tan

This paper investigates the computational complexity of reinforcement learning in a novel linear function approximation regime, termed partial $q^{\ddot{I}}€$-realizability. In this framewo…