Learning the Structure for Structured Sparsity
Nino Shervashidze (SIERRA, LIENS), Francis Bach (SIERRA, LIENS)

TL;DR
This paper introduces a Bayesian method for learning group weights in structured sparsity models, enabling automatic adaptation of penalties for high-dimensional data analysis.
Contribution
It proposes a novel Bayesian approach to infer group weights as hyperparameters, addressing a key open problem in structured sparsity.
Findings
Successfully recovers model hyperparameters from data.
Improves denoising performance in synthetic and real datasets.
Demonstrates practical utility of learned weights.
Abstract
Structured sparsity has recently emerged in statistics, machine learning and signal processing as a promising paradigm for learning in high-dimensional settings. All existing methods for learning under the assumption of structured sparsity rely on prior knowledge on how to weight (or how to penalize) individual subsets of variables during the subset selection process, which is not available in general. Inferring group weights from data is a key open research problem in structured sparsity.In this paper, we propose a Bayesian 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 we demonstrate the utility of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
