Conditions on optimal support recovery in unmixing problems by means of multi-penalty regularization
Markus Grasmair, Valeriya Naumova

TL;DR
This paper investigates conditions for optimal support recovery in unmixing problems using multi-penalty regularization, demonstrating theoretical advantages and improved robustness over traditional methods through extensive simulations.
Contribution
It extends sparse recovery theory to multi-penalty regularization, showing enhanced support identification and robustness compared to single-parameter $ ext{l}^1$-minimization.
Findings
Multi-penalty regularization improves support recovery accuracy.
Theoretical support recovery conditions are extended to multi-penalty settings.
Numerical simulations confirm robustness and performance improvements.
Abstract
Inspired by several real-life applications in audio processing and medical image analysis, where the quantity of interest is generated by several sources to be accurately modeled and separated, as well as by recent advances in regularization theory and optimization, we study the conditions on optimal support recovery in inverse problems of unmixing type by means of multi-penalty regularization. We consider and analyze a regularization functional composed of a data-fidelity term, where signal and noise are additively mixed, a non-smooth, convex, sparsity promoting term, and a quadratic penalty term to model the noise. We prove not only that the well-established theory for sparse recovery in the single parameter case can be translated to the multi-penalty settings, but we also demonstrate the enhanced properties of multi-penalty regularization in terms of support identification compared…
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.
