Adaptive probabilistic principal component analysis
Adam Farooq, Yordan P. Raykov, Luc Evers, Max A. Little

TL;DR
This paper introduces an adaptive probabilistic PCA model that employs Bayesian nonparametrics to dynamically adjust complexity and subspace projections based on observed data, enhancing interpretability and flexibility.
Contribution
It presents a novel nonparametric latent feature Gaussian model that relaxes traditional PCA constraints and adapts complexity with data, along with two Gibbs sampling inference methods.
Findings
Effective on sensor data for health monitoring
Model adapts complexity as more data is observed
Provides interpretable local PCA-like projections
Abstract
Using the linear Gaussian latent variable model as a starting point we relax some of the constraints it imposes by deriving a nonparametric latent feature Gaussian variable model. This model introduces additional discrete latent variables to the original structure. The Bayesian nonparametric nature of this new model allows it to adapt complexity as more data is observed and project each data point onto a varying number of subspaces. The linear relationship between the continuous latent and observed variables make the proposed model straightforward to interpret, resembling a locally adaptive probabilistic PCA (A-PPCA). We propose two alternative Gibbs sampling procedures for inference in the new model and demonstrate its applicability on sensor data for passive health monitoring.
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
TopicsBayesian Methods and Mixture Models · Gaussian Processes and Bayesian Inference · Time Series Analysis and Forecasting
MethodsPrincipal Components Analysis
