Lower bounds for sparse coding

DOI10.1007/978-3-319-21852-6_24zbMATH Open1336.68219OpenAlexW2338267636MaRDI QIDQ2805739FDOQ2805739

Authors: Andreas Maurer, Massimiliano Pontil, Luca Baldassarre 

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

Recommendations

• Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces
• Lower bounds for sparse recovery
• Sensitivity of Sparse Codes to Image Distortions
• Approximation bounds for sparse principal component analysis
• Minimax bounds for sparse PCA with noisy high-dimensional data

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

• Title not available (Why is that?)
• A simple proof of the restricted isometry property for random matrices
• Learning the parts of objects by non-negative matrix factorization
• Online learning for matrix factorization and sparse coding
• The restricted isometry property and its implications for compressed sensing
• $K$-Dimensional Coding Schemes in Hilbert Spaces
• On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
• Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization

Cited In (4)

• Title not available (Why is that?)
• Dimensionality-dependent generalization bounds for \(k\)-dimensional coding schemes
• Title not available (Why is that?)
• Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces

This page was built for publication: Lower bounds for sparse coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805739)