Sparse Recovery, Kashin Decomposition and Conic Programming

Alexandre d'Aspremont

REVIEW

Sparse Recovery, Kashin Decomposition and Conic Programming

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1101.3027 v1 pith:4POQZFEJ submitted 2011-01-15 math.OC

Alexandre d'Aspremont This is my paper

classification math.OC

keywords recoverysparsearbitraryballboundsconditionsconicdecomposition

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We produce relaxation bounds on the diameter of arbitrary sections of the l1 ball in R^n. We use these results to test conditions for sparse recovery.

Discussion (0). Sign in to comment.

Pith tools