Stein Variational Policy Gradient

Stein Variational Policy Gradient, or SVPG, is a policy gradient based method in reinforcement learning that uses Stein Variational Gradient Descent to allow simultaneous exploitation and exploration of multiple policies. Unlike traditional policy optimization which attempts to learn a single policy, SVPG models a distribution of policy parameters, where samples from this distribution will represent strong policies. SVPG optimizes this distribution of policy parameters with (relative) entropy regularization. The (relative) entropy term explicitly encourages exploration in the parameter space while also optimizing the expected utility of polices drawn from this distribution. Stein variational gradient descent (SVGD) is then used to optimize this distribution. SVGD leverages efficient deterministic dynamics to transport a set of particles to approximate given target posterior distributions.

The update takes the form:

$$ $$

∇θᵢ = 1/n∑ⱼ₌₁ⁿ ∇_(θⱼ) (1/α J(θⱼ) + logq₀(θⱼ))k(θⱼ, θᵢ) + ∇_(θⱼ) k(θⱼ, θᵢ)

Note that here the magnitude of α adjusts the relative importance between the policy gradient and the prior term ∇_(θⱼ) (1/α J(θⱼ) + logq₀(θⱼ))k(θⱼ, θᵢ) and the repulsive term ∇_(θⱼ) k(θⱼ, θᵢ). The repulsive functional is used to diversify particles to enable parameter exploration. A suitable α provides a good trade-off between exploitation and exploration. If α is too large, the Stein gradient would only drive the particles to be consistent with the prior q₀. As α→0, this algorithm is reduced to running n copies of independent policy gradient algorithms, if {θᵢ} are initialized very differently. A careful annealing scheme of α allows efficient exploration in the beginning of training and later focuses on exploitation towards the end of training.