Preferential subspace identification (PSID) with forward-backward smoothing
Omid G. Sani, Maryam M. Shanechi

TL;DR
This paper extends Preferential Subspace Identification (PSID) to include optimal filtering and smoothing for multivariate time-series, improving model estimation and prediction by incorporating all available data.
Contribution
The authors develop a novel PSID extension that enables optimal filtering and smoothing, including a forward-backward smoothing algorithm inspired by Kalman smoothers.
Findings
Accurately recovers ground-truth model parameters for filtering.
Achieves optimal filtering and smoothing decoding performance.
Validates methods on simulated data with high accuracy.
Abstract
System identification methods for multivariate time-series, such as neural and behavioral recordings, have been used to build models for predicting one from the other. For example, Preferential Subspace Identification (PSID) builds a state-space model of a primary time-series (e.g., neural activity) to optimally predict a secondary time-series (e.g., behavior). However, PSID focuses on optimal prediction using past primary data, even though in offline applications, better estimation can be achieved by incorporating concurrent data (filtering) or all available data (smoothing). Here, we extend PSID to enable optimal filtering and smoothing. First, we show that the presence of a secondary signal makes it possible to uniquely identify a model with an optimal Kalman update step (to enable filtering) from a family of otherwise equivalent state-space models. Our filtering solution augments…
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.
