Name
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 $\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 $\ell^1$ regularization which are encompassed in this framework. As a byproduct, we obtain recovery guarantees for $\ell^\infty$ and $\ell^1-\ell^\infty$ regularization. |
Year | Venue | Field |
|---|---|---|
2013 | CoRR | Mathematical optimization,Noise level,Backus–Gilbert method,Robustness (computer science),Regularization (mathematics),Inverse problem,Hyperplane,Mathematics,Perturbation (astronomy),Regularization perspectives on support vector machines |
DocType | Volume | Citations |
Journal | abs/1304.6033 | 0 |
PageRank | References | Authors |
0.34 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Samuel Vaiter | 1 | 50 | 8.39 |
| Gabriel Peyré | 2 | 1195 | 79.60 |
| Jalal Fadili | 3 | 1184 | 80.08 |