University of Cambridge > > Isaac Newton Institute Seminar Series > Graph Total Variation for Inverse Problems with Highly Correlated Designs

Graph Total Variation for Inverse Problems with Highly Correlated Designs

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

If you have a question about this talk, please contact

STSW02 - Statistics of geometric features and new data types

Co-authors: Garvesh Raskutti (University of Wisconsin), Yuan Li (University of Wisconsin)

Sparse high-dimensional linear regression and inverse problems have received substantial attention over the past two decades. Much of this work assumes that explanatory variables are only mildly correlated. However, in modern applications ranging from functional MRI to genome-wide association studies, we observe highly correlated explanatory variables and associated design matrices that do not exhibit key properties (such as the restricted eigenvalue condition). In this talk, I will describe novel methods for robust sparse linear regression in these settings. Using side information about the strength of correlations among explanatory variables, we form a graph with edge weights corresponding to pairwise correlations. This graph is used to define a graph total variation regularizer that promotes similar weights for correlated explanatory variables. I will show how the graph structure encapsulated by this regularizer interacts with correlated design matrices to yield provably a ccurate estimates. The proposed approach outperforms standard methods in a variety of experiments on simulated and real fMRI data.

This is joint work with Yuan Li and Garvesh Raskutti.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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