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

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Heteroskedastic PCA: Algorithm, Optimality, and Applications

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lubbock Room, Peterhouse Harrods Rm, Queens Building, Emmanuel College, Cambridge CB2 3AP Mary Allan Building room G12, Homerton College, Hills Road, Cambridge CB2 8PQ

Other talks

Title TBC LCLU Annual Talk: The Early Aqueous Environment of Mars Inferred From Mission Lifetime Results by the Curiosity Rover at Gale Crater Chemical strategies for biomolecule functionalisation, and biomaterial conjugation CSAR lecture: Decarbonizing road freight (TBC) Cambridge RNA Club - IN PERSON Morning Break
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity