University of Cambridge > > Machine Learning @ CUED > Learning to Learn for Structured Sparsity

Learning to Learn for Structured Sparsity

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

If you have a question about this talk, please contact Zoubin Ghahramani.

Structured sparsity has recently emerged in statistics, machine learning and signal processing as a promising paradigm for learning in high-dimensional settings. A number of methods have been proposed for learning under the assumption of structured sparsity, including group LASSO and graph LASSO . All of these methods rely on prior knowledge on how to penalize individual subsets of variables during the subset selection process. However, these weights on groups of variables are in general unknown. Inferring group weights from data is a key open problem in research on structured sparsity.

In this work, we propose a probabilistic approach to the problem of group weight learning. We model the group weights as hyperparameters of heavy-tailed priors on groups of variables and derive an approximate inference scheme to infer these hyperparameters. We empirically show that we are able to recover the model hyperparameters when the data are generated from the model and demonstrate the utility of learning group weights in denoising problems.

This talk is part of the Machine Learning @ CUED 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