login

A New Natural Policy Gradient by Stationary Distribution Metric

Lecture notes in computer sciencePublished 1 January 2008Open access
Tetsuro Morimura, Eiji Uchibe, Junichiro Yoshimoto, Kenji Doya
Citations13
SJR quartileQ2
SJR score0.35
SNIP0.55
View PDF

TL;DR

A Riemannian metric for the joint distribution of the state-action, which is directly linked with the average reward, is proposed and derived, and a new NPG named "Natural State-action Gradient"(NSG) is derived).

Abstract

The parameter space of a statistical learning machine has a Riemannian metric structure in terms of its objective function. [1] Amari proposed the concept of "natural gradient" that takes the Riemannian metric of the parameter space into account. Kakade [2] applied it to policy gradient reinforcement learning, called a natural policy gradient (NPG). Although NPGs evidently depend on the underlying Riemannian metrics, careful attention was not paid to the alternative choice of the metric in previous studies. In this paper, we propose a Riemannian metric for the joint distribution of the state-action, which is directly linked with the average reward, and derive a new NPG named "Natural State-action Gradient" (NSG). Then, we prove that NSG can be computed by fitting a certain linear model into the immediate reward function. In numerical experiments, we verify that the NSG learning can handle MDPs with a large number of states, for which the performances of the existing (N)PG methods degrade.

Keywords

Computer ScienceEconomics, Econometrics and Finance