A note on the sample complexity of the Er-SpUD algorithm by Spielman, Wang and Wright for exact recovery of sparsely used dictionaries (Q2834514)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the sample complexity of the Er-SpUD algorithm by Spielman, Wang and Wright for exact recovery of sparsely used dictionaries |
scientific article; zbMATH DE number 6655093
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the sample complexity of the Er-SpUD algorithm by Spielman, Wang and Wright for exact recovery of sparsely used dictionaries |
scientific article; zbMATH DE number 6655093 |
Statements
22 November 2016
0 references
sparse dictionaries
0 references
Er-SpUD algorithm
0 references
\(\ell_1\) minimization
0 references
exact recovery
0 references
sample complexity
0 references
math.PR
0 references
cs.LG
0 references
math.ST
0 references
stat.TH
0 references
A note on the sample complexity of the Er-SpUD algorithm by Spielman, Wang and Wright for exact recovery of sparsely used dictionaries (English)
0 references
