Selecting Bases in Spectral learning of Predictive State Representations via Model Entropy
Yunlong Liu, Hexing Zhu

TL;DR
This paper introduces a novel basis selection method for spectral learning of Predictive State Representations (PSRs) using model entropy, improving model accuracy with limited data.
Contribution
It proposes a new approach for selecting columns in spectral PSR learning based on model entropy, addressing practical limitations of data size and computational resources.
Findings
The proposed basis selection method improves learning accuracy.
Experimental results validate the effectiveness of the entropy-based approach.
The method enhances spectral PSR learning in practical scenarios.
Abstract
Predictive State Representations (PSRs) are powerful techniques for modelling dynamical systems, which represent a state as a vector of predictions about future observable events (tests). In PSRs, one of the fundamental problems is the learning of the PSR model of the underlying system. Recently, spectral methods have been successfully used to address this issue by treating the learning problem as the task of computing an singular value decomposition (SVD) over a submatrix of a special type of matrix called the Hankel matrix. Under the assumptions that the rows and columns of the submatrix of the Hankel Matrix are sufficient~(which usually means a very large number of rows and columns, and almost fails in practice) and the entries of the matrix can be estimated accurately, it has been proven that the spectral approach for learning PSRs is statistically consistent and the learned…
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
TopicsFault Detection and Control Systems · Neural Networks and Applications · Gaussian Processes and Bayesian Inference
