Lower Bounds for Sparse Coding

DOI10.1007/978-3-319-21852-6_24zbMath1336.68219OpenAlexW2338267636MaRDI QIDQ2805739

Luca Baldassarre, Andreas Maurer, Massimiliano Pontil

Publication date: 13 May 2016

Published in: Measures of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21852-6_24

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites Work

• Unnamed Item
• Unnamed Item
• The restricted isometry property and its implications for compressed sensing
• A simple proof of the restricted isometry property for random matrices
• On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
• $K$-Dimensional Coding Schemes in Hilbert Spaces
• Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization
• Learning the parts of objects by non-negative matrix factorization

This page was built for publication: Lower Bounds for Sparse Coding