Model Selection with Low Complexity Priors
Samuel Vaiter (CEREMADE), Mohammad Golbabaee (CEREMADE), Jalal M., Fadili (GREYC), Gabriel Peyr\'e (CEREMADE)

TL;DR
This paper introduces a unified framework for low-dimensional regularization in inverse problems using partly smooth functions, enabling sharp analysis of exact and robust recovery across various regularizers.
Contribution
It defines partly smooth functions relative to linear manifolds and shows their closure properties, unifying analysis of multiple regularization techniques.
Findings
Unified analysis of exact and robust recovery guarantees.
Applicable to a broad class of regularizers including L1, L2, Linfty, and total variation.
Illustrated with case studies and performance analysis in compressed sensing.
Abstract
Regularization plays a pivotal role when facing the challenge of solving ill-posed inverse problems, where the number of observations is smaller than the ambient dimension of the object to be estimated. A line of recent work has studied regularization models with various types of low-dimensional structures. In such settings, the general approach is to solve a regularized optimization problem, which combines a data fidelity term and some regularization penalty that promotes the assumed low-dimensional/simple structure. This paper provides a general framework to capture this low-dimensional structure through what we coin partly smooth functions relative to a linear manifold. These are convex, non-negative, closed and finite-valued functions that will promote objects living on low-dimensional subspaces. This class of regularizers encompasses many popular examples such as the L1 norm, L1-L2…
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.
