Accuracy guarantees for L1-recovery - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Information Theory Année : 2011

Accuracy guarantees for L1-recovery

Résumé

We discuss two new methods of recovery of sparse signals from noisy observation based on $\ell_1$- minimization. They are closely related to the well-known techniques such as Lasso and Dantzig Selector. However, these estimators come with efficiently verifiable guaranties of performance. By optimizing these bounds with respect to the method parameters we are able to construct the estimators which possess better statistical properties than the commonly used ones. We also show how these techniques allow to provide efficiently computable accuracy bounds for Lasso and Dantzig Selector. We link our performance estimations to the well known results of Compressive Sensing and justify our proposed approach with an oracle inequality which links the properties of the recovery algorithms and the best estimation performance when the signal support is known. We demonstrate how the estimates can be computed using the Non-Euclidean Basis Pursuit algorithm.
Fichier principal
Vignette du fichier
StatMay09plusNSF.pdf (552.17 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00510689 , version 1 (21-08-2010)
hal-00510689 , version 2 (28-10-2010)
hal-00510689 , version 3 (25-05-2011)

Identifiants

Citer

Anatoli B. Juditsky, Arkadii S. Nemirovski. Accuracy guarantees for L1-recovery. IEEE Transactions on Information Theory, 2011, 57 (12), pp.7818-7839. ⟨10.1109/TIT.2011.2162569⟩. ⟨hal-00510689v3⟩
210 Consultations
172 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More