Efficiently learning linear-linear exponential family predictive representations of state

Exponential Family PSR (EFPSR) models capture stochastic dynamical systems by representing state as the parameters of an exponential family distribution over a shortterm window of future observations. They are appealing from a learning perspective because they are fully observed (meaning expressions for maximum likelihood do not involve hidden quantities), but are still expressive enough to both capture existing models and predict new models. While maximumlikelihood learning algorithms for EFPSRs exist, they are not computationally feasible. We present a new, computationally efficient, learning algorithm based on an approximate likelihood function. The algorithm can be interpreted as attempting to induce stationary distributions of observations, features and states which match their empirically observed counterparts. The approximate likelihood, and the idea of matching stationary distributions, may apply to other models.

• Type: Conference
• Year: 2008
• Where: ICML
• Authors: David Wingate, Satinder P. Singh
• Keywords: Approximate Likelihood Function, Capture Existing Models, Exponential Family PSR, ICML 2008, Machine Learning