A note on the sample complexity of the Er-SpUD algorithm by Spielman, Wang and Wright for exact recovery of sparsely used dictionaries

zbMath1391.94123arXiv1601.02049MaRDI QIDQ2834514

Radosław Adamczak

Publication date: 22 November 2016

Full work available at URL: https://arxiv.org/abs/1601.02049

zbMATH Keywords

\(\ell_1\) minimizationexact recoverysample complexityEr-SpUD algorithmsparse dictionaries

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Computational methods for sparse matrices (65F50) Learning and adaptive systems in artificial intelligence (68T05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Random matrices (algebraic aspects) (15B52)

Related Items (2)

Unnamed Item ⋮ Identifiability of Complete Dictionary Learning

This page was built for publication: A note on the sample complexity of the Er-SpUD algorithm by Spielman, Wang and Wright for exact recovery of sparsely used dictionaries