English

Robust Polyhedral Regularization

Information Theory 2013-04-23 v1 math.IT

Abstract

In this paper, we establish robustness to noise perturbations of polyhedral regularization of linear inverse problems. We provide a sufficient condition that ensures that the polyhedral face associated to the true vector is equal to that of the recovered one. This criterion also implies that the 2\ell^2 recovery error is proportional to the noise level for a range of parameter. Our criterion is expressed in terms of the hyperplanes supporting the faces of the unit polyhedral ball of the regularization. This generalizes to an arbitrary polyhedral regularization results that are known to hold for sparse synthesis and analysis 1\ell^1 regularization which are encompassed in this framework. As a byproduct, we obtain recovery guarantees for \ell^\infty and 1\ell^1-\ell^\infty regularization.

Keywords

Cite

@article{arxiv.1304.6033,
  title  = {Robust Polyhedral Regularization},
  author = {Samuel Vaiter and Gabriel Peyré and Jalal Fadili},
  journal= {arXiv preprint arXiv:1304.6033},
  year   = {2013}
}

Comments

To be published in 10th international conference on Sampling Theory and Applications - Full papers

R2 v1 2026-06-22T00:04:19.034Z