Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization

DOI10.1109/TIT.2013.2240435zbMath1364.94145OpenAlexW2089493818MaRDI QIDQ2989298

No author found.

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2013.2240435

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (12)

Learning from binary labels with instance-dependent noise ⋮ Sharp recovery bounds for convex demixing, with applications ⋮ Robust censored regression with \(\ell_1\)-norm regularization ⋮ Compressed sensing and matrix completion with constant proportion of corruptions ⋮ Correcting for unknown errors in sparse high-dimensional function approximation ⋮ Stable Recovery of Sparsely Corrupted Signals Through Justice Pursuit De-Noising ⋮ Compressed Sensing with Sparse Corruptions: Fault-Tolerant Sparse Collocation Approximations ⋮ Corruption-tolerant bandit learning ⋮ Stable separation and super-resolution of mixture models ⋮ Stable restoration and separation of approximately sparse signals ⋮ Robust group lasso: model and recoverability ⋮ Unnamed Item

This page was built for publication: Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization