Heteroskedastic PCA: Algorithm, Optimality, and Applications

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

• Tony Cai, University of Pennsylvania
• Thursday 11 October 2018, 16:00-17:00
• MR13.

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.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Cambridge Forum of Science and Humanities
• Cambridge Language Sciences
• Cambridge talks
• Chris Davis' list
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Guy Emerson's list
• Hanchen DaDaDash
• Interested Talks
• MR13
• Machine Learning
• School of Physical Sciences
• Statistical Laboratory info aggregator
• Statistics
• Statistics Group
• bld31
• custom
• rp587

Note that ex-directory lists are not shown.