Accuracy Guarantees for <formula formulatype="inline"> <tex Notation="TeX">$\ell_1$</tex></formula>-Recovery

DOI10.1109/TIT.2011.2162569zbMath1365.94077arXiv1008.3651OpenAlexW3099944011WikidataQ57392894 ScholiaQ57392894MaRDI QIDQ5272204

Arkadi Nemirovski, Anatoli B. Juditsky

Publication date: 12 July 2017

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

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

Mathematics Subject Classification ID

Convex programming (90C25) Estimation and detection in stochastic control theory (93E10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

On the prediction loss of the Lasso in the partially labeled setting, On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization, A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions, \(s\)-goodness for low-rank matrix recovery, Primal-dual mirror descent method for constraint stochastic optimization problems, Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning, A Rice method proof of the null-space property over the Grassmannian, On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures, On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery, Randomized pick-freeze for sparse Sobol indices estimation in high dimension, Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point, Quasi-likelihood and/or robust estimation in high dimensions, Algorithms of robust stochastic optimization based on mirror descent method, Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals, Sparse recovery from extreme eigenvalues deviation inequalities