Reinforcement Learning with General Utilities: Simpler Variance Reduction and Large State-Action Space
share
We consider the reinforcement learning (RL) problem with general utilities which consists in maximizing a function of the state-action occupancy measure. Beyond the standard cumulative reward RL setting, this problem includes as particular cases constrained RL, pure exploration and learning from demonstrations among others. For this problem, we propose a simpler single-loop parameter-free normalized policy gradient algorithm. Implementing a recursive momentum variance reduction mechanism, our algorithm achieves 𝒪̃(ϵ^-3) and 𝒪̃(ϵ^-2) sample complexities for ϵ-first-order stationarity and ϵ-global optimality respectively, under adequate assumptions. We further address the setting of large finite state action spaces via linear function approximation of the occupancy measure and show a 𝒪̃(ϵ^-4) sample complexity for a simple policy gradient method with a linear regression subroutine.
READ FULL TEXT