On robust width property for Lasso and Dantzig selector
From MaRDI portal
Abstract: Recently, Cahill and Mixon completely characterized the sensing operators in many compressed sensing instances with a robust width property. The proposed property allows uniformly stable and robust reconstruction of certain solutions from an underdetermined linear system via convex optimization. However, their theory does not cover the Lasso and Dantzig selector models, both of which are popular alternatives in the statistics community. In this letter, we show that the robust width property can be perfectly applied to these two models as well. Our results solve an open problem left by Cahill and Mixon.
Recommendations
- Robust width: a characterization of uniformly stable and robust compressed sensing
- Stable and robust $\ell_p$-constrained compressive sensing recovery via robust width property
- Simultaneous analysis of Lasso and Dantzig selector
- DASSO: Connections Between the Dantzig Selector and Lasso
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
Cited in
(4)- Localized Gaussian width of \(M\)-convex hulls with applications to Lasso and convex aggregation
- Robust width: a characterization of uniformly stable and robust compressed sensing
- Stable and robust $\ell_p$-constrained compressive sensing recovery via robust width property
- Robust penalized Dantzig selector: error analysis, oracle inequalities, and algorithmic efficiency
This page was built for publication: On robust width property for Lasso and Dantzig selector
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1709661)
