University of Cambridge > > Statistics > Heteroskedastic PCA: Algorithm, Optimality, and Applications

Heteroskedastic PCA: Algorithm, Optimality, and Applications

Add to your list(s) Download to your calendar using vCal

  • UserTony Cai, University of Pennsylvania
  • ClockThursday 11 October 2018, 16:00-17:00
  • HouseMR13.

If you have a question about this talk, please contact Dr Sergio Bacallado.

Principal component analysis (PCA) is a ubiquitous method in statistics, machine learning and applied mathematics. PCA has been well studied and used mostly in the homoskedastic noise case.

In this talk, we consider PCA in the setting where the noise is heteroskedastic, which arises naturally from a range of applications. We proposed an algorithm called DIALECT for heteroskedastic PCA and establish its optimality. A key technical step is a deterministic robust perturbation analysis, which can be of independent interest. We will also discuss some applications in the analysis of high-dimensional data, including heteroskedastic matrix SVD , community detection in bipartite stochastic block model, and noisy matrix completion.

This talk is part of the Statistics series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2024, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity