Variational Policy Gradient Method for Reinforcement Learning with General Utilities

TL;DR

This paper introduces a variational policy gradient method for reinforcement learning with general utility functions, enabling policy optimization beyond traditional reward sums, with proven convergence guarantees and improved rates.

Contribution

It derives a new variational policy gradient theorem for general utilities, providing a practical algorithm with convergence analysis and rate improvements over existing methods.

Findings

The proposed algorithm converges globally to the optimal policy.

It achieves an $O(1/t)$ convergence rate, faster under hidden convexity.

It generalizes policy gradient methods to broader utility functions.

Abstract

In recent years, reinforcement learning (RL) systems with general goals beyond a cumulative sum of rewards have gained traction, such as in constrained problems, exploration, and acting upon prior experiences. In this paper, we consider policy optimization in Markov Decision Problems, where the objective is a general concave utility function of the state-action occupancy measure, which subsumes several of the aforementioned examples as special cases. Such generality invalidates the Bellman equation. As this means that dynamic programming no longer works, we focus on direct policy search. Analogously to the Policy Gradient Theorem \cite{sutton2000policy} available for RL with cumulative rewards, we derive a new Variational Policy Gradient Theorem for RL with general utilities, which establishes that the parametrized policy gradient may be obtained as the solution of a stochastic saddle point problem involving the Fenchel dual of the utility function. We develop a variational Monte Carlo gradient estimation algorithm to compute the policy gradient based on sample paths. We prove that the variational policy gradient scheme converges globally to the optimal policy for the general objective, though the optimization problem is nonconvex. We also establish its rate of convergence of the order $O(1/t)$ by exploiting the hidden convexity of the problem, and proves that it converges exponentially when the problem admits hidden strong convexity. Our analysis applies to the standard RL problem with cumulative rewards as a special case, in which case our result improves the available convergence rate.