Constructing Basis Functions from Directed Graphs for Value Function Approximation. Johns, Mahadevan. ICML 2007.

Graph Laplacian for directed graphs, where adjacent (in one direction) states may have very different value functions.

“We provide an analysis using the Dirichlet sum of the graph Laplacian to show how the smoothness of the basis functions is affected by the graph’s invariant distribution.”

Standard graph laplacian only works when weights are symmetric

Graph must be strongly connected and aperiodic – pretty mild assumptions

Equations for the combinatorial and normalized directed Laplacians are not terribly complex

<I take that back – it needs something called the Perron vector of the transition matrix, but it requires this weird manipulation that pushes the actual transition distribution in the direction of the uniform distribution. Its not totally clear if this always has to be done, or just in special-case graphs. Need to learn more before I make a decision about it. Here its computed by an iterative update.>

<Its not yet clear to me how much this actually fixes the problem – would have to spend more time, because in the end you still create an undirected graph, which seems like it shouldn’t be able to represent everything in a directed graph?>

“The undirected Laplacian is a special case of the directed Laplacian.”

Test on 2-room gridworld (where rooms are connected by directional doors), inverted pendulum (which is done by basically keeping track of balls around sampled points)

<Results aren’t very impressive – performance in pendulum is flat for 30-50 basis functions, and is about 20% below optimal.>

Privacy & Cookies: This site uses cookies. By continuing to use this website, you agree to their use.
To find out more, including how to control cookies, see here:
Cookie Policy