Lower bounds for sparse coding
From MaRDI portal
Publication:2805739
Recommendations
Cites work
- scientific article; zbMATH DE number 49190 (Why is no real title available?)
- $K$-Dimensional Coding Schemes in Hilbert Spaces
- A simple proof of the restricted isometry property for random matrices
- Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization
- Learning the parts of objects by non-negative matrix factorization
- On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
- Online learning for matrix factorization and sparse coding
- The restricted isometry property and its implications for compressed sensing
Cited in
(4)- scientific article; zbMATH DE number 2033169 (Why is no real title available?)
- scientific article; zbMATH DE number 1223038 (Why is no real title available?)
- Dimensionality-dependent generalization bounds for \(k\)-dimensional coding schemes
- 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)