Computationally Efficient RL under Linear Bellman Completeness for Deterministic Dynamics

Understand

We study computationally and statistically efficient Reinforcement Learning algorithms for the linear Bellman Complete setting.

• This setting uses linear function approximation to capture value functions and unifies existing models like linear Markov Decision Processes (MDP) and Linear Quadratic Regulators (LQR).
• While it is known from the prior works that this setting is statistically tractable, it remained open whether a computationally efficient algorithm exists.
• Our work provides a computationally efficient algorithm for the linear Bellman complete setting that works for MDPs with large action spaces, random initial states, and random rewards but relies on the underlying dynamics to be deterministic.