On robust width property for Lasso and Dantzig selector
Hui Zhang

TL;DR
This paper extends the robust width property, previously used in compressed sensing, to include the popular Lasso and Dantzig selector models, thereby broadening its applicability.
Contribution
It demonstrates that the robust width property applies to Lasso and Dantzig selector models, solving an open problem in the field.
Findings
Robust width property applies to Lasso and Dantzig selector models
Provides stable and robust reconstruction guarantees for these models
Closes an open problem in compressed sensing theory
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSparse and Compressive Sensing Techniques · Distributed Sensor Networks and Detection Algorithms · Statistical Methods and Inference
