University of Cambridge > Talks.cam > Statistics > Graph-Guided Banding for Covariance Estimation

Graph-Guided Banding for Covariance Estimation

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

If you have a question about this talk, please contact Quentin Berthet.

Reliable estimation of the covariance matrix is notoriously difficult in high dimensions. Numerous methods assume that the population covariance (or inverse covariance) matrix is sparse while making no particular structural assumptions on the desired sparsity pattern. A highly-related, yet complementary, literature studies the setting in which the measured variables have a known ordering, in which case a banded (or near-banded) population matrix is assumed. This work focuses on the broad middle ground that lies between the former approach of complete neutrality to the sparsity pattern and the latter highly restrictive assumption of having a known ordering. We develop a class of convex regularizers that is in the spirit of banding and yet attains sparsity structures that can be customized to a wide variety of applications.

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 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity