Robustness to Unknown Error in Sparse Regularization

DOI10.1109/TIT.2017.2788445zbMath1401.94027arXiv1705.10299OpenAlexW2963548849MaRDI QIDQ4682942

Ben Adcock, Simone Brugiapaglia

Publication date: 19 September 2018

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

Full work available at URL: https://arxiv.org/abs/1705.10299

Mathematics Subject Classification ID

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

Related Items (11)

On the geometry of polytopes generated by heavy-tailed random vectors ⋮ On the robustness of noise-blind low-rank recovery from rank-one measurements ⋮ Robust recovery of a kind of weighted l1-minimization without noise level ⋮ Correcting for unknown errors in sparse high-dimensional function approximation ⋮ Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing ⋮ NESTANets: stable, accurate and efficient neural networks for analysis-sparse inverse problems ⋮ Uniform recovery in infinite-dimensional compressed sensing and applications to structured binary sampling ⋮ Least Sparsity of $p$-Norm Based Optimization Problems with $p>1$ ⋮ A mixed ℓ₁ regularization approach for sparse simultaneous approximation of parameterized PDEs ⋮ Compressive Hermite interpolation: sparse, high-dimensional approximation from gradient-augmented measurements ⋮ On the robustness of minimum norm interpolators and regularized empirical risk minimizers

This page was built for publication: Robustness to Unknown Error in Sparse Regularization