Sparse Recovery, Kashin Decomposition and Conic Programming
Abstract
We produce relaxation bounds on the diameter of arbitrary sections of the l1 ball in Rn. We use these results to test conditions for sparse recovery.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.