Practical Learning of Predictive State Representations
Carlton Downey, Ahmed Hefny, Geoffrey Gordon

TL;DR
This paper introduces Inference Gradients, a novel method combining spectral initialization and gradient-based refinement to improve the practical learning and inference performance of Predictive State Representations.
Contribution
It proposes Inference Gradients, a new approach that enhances PSR learning by integrating spectral algorithms with PSIM-style updates for better inference accuracy.
Findings
Inference Gradients outperforms PSRs and PSIMs on real data
Combines spectral initialization with gradient refinement for PSRs
Provides a robust, fast, and practical learning method
Abstract
Over the past decade there has been considerable interest in spectral algorithms for learning Predictive State Representations (PSRs). Spectral algorithms have appealing theoretical guarantees; however, the resulting models do not always perform well on inference tasks in practice. One reason for this behavior is the mismatch between the intended task (accurate filtering or prediction) and the loss function being optimized by the algorithm (estimation error in model parameters). A natural idea is to improve performance by refining PSRs using an algorithm such as EM. Unfortunately it is not obvious how to apply apply an EM style algorithm in the context of PSRs as the Log Likelihood is not well defined for all PSRs. We show that it is possible to overcome this problem using ideas from Predictive State Inference Machines. We combine spectral algorithms for PSRs as a consistent and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Bayesian Modeling and Causal Inference · Explainable Artificial Intelligence (XAI)
