LGMLSep 26, 2013

Hilbert Space Embeddings of Predictive State Representations

arXiv:1309.6819v197 citations
Originality Incremental advance
AI Analysis

This work addresses the problem of modeling controlled stochastic processes with continuous variables for researchers in machine learning and control, representing an incremental extension of PSRs.

The authors tackled the limitation of Predictive State Representations (PSRs) to finite actions and observations by generalizing them to infinite sets using Hilbert space embeddings, resulting in models that outperform competing algorithms on prediction benchmarks.

Predictive State Representations (PSRs) are an expressive class of models for controlled stochastic processes. PSRs represent state as a set of predictions of future observable events. Because PSRs are defined entirely in terms of observable data, statistically consistent estimates of PSR parameters can be learned efficiently by manipulating moments of observed training data. Most learning algorithms for PSRs have assumed that actions and observations are finite with low cardinality. In this paper, we generalize PSRs to infinite sets of observations and actions, using the recent concept of Hilbert space embeddings of distributions. The essence is to represent the state as a nonparametric conditional embedding operator in a Reproducing Kernel Hilbert Space (RKHS) and leverage recent work in kernel methods to estimate, predict, and update the representation. We show that these Hilbert space embeddings of PSRs are able to gracefully handle continuous actions and observations, and that our learned models outperform competing system identification algorithms on several prediction benchmarks.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes