English

HePPCAT: Probabilistic PCA for Data with Heteroscedastic Noise

Statistics Theory 2021-12-02 v3 Signal Processing Statistics Theory

Abstract

Principal component analysis (PCA) is a classical and ubiquitous method for reducing data dimensionality, but it is suboptimal for heterogeneous data that are increasingly common in modern applications. PCA treats all samples uniformly so degrades when the noise is heteroscedastic across samples, as occurs, e.g., when samples come from sources of heterogeneous quality. This paper develops a probabilistic PCA variant that estimates and accounts for this heterogeneity by incorporating it in the statistical model. Unlike in the homoscedastic setting, the resulting nonconvex optimization problem is not seemingly solved by singular value decomposition. This paper develops a heteroscedastic probabilistic PCA technique (HePPCAT) that uses efficient alternating maximization algorithms to jointly estimate both the underlying factors and the unknown noise variances. Simulation experiments illustrate the comparative speed of the algorithms, the benefit of accounting for heteroscedasticity, and the seemingly favorable optimization landscape of this problem. Real data experiments on environmental air quality data show that HePPCAT can give a better PCA estimate than techniques that do not account for heteroscedasticity.

Keywords

Cite

@article{arxiv.2101.03468,
  title  = {HePPCAT: Probabilistic PCA for Data with Heteroscedastic Noise},
  author = {David Hong and Kyle Gilman and Laura Balzano and Jeffrey A. Fessler},
  journal= {arXiv preprint arXiv:2101.03468},
  year   = {2021}
}

Comments

This article has been accepted for publication in the IEEE Transactions on Signal Processing. (c) 2021 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information. 26 pages, 14 figures

R2 v1 2026-06-23T21:57:25.479Z