Dictionary Identification—Sparse Matrix-Factorization via \ell₁-Minimization
From MaRDI portal
Dictionary Identification—Sparse Matrix-Factorization via $\ell 1$-Minimization
Cited in
(19)- Simple alternating minimization provably solves complete dictionary learning
- Convergence radius and sample complexity of ITKM algorithms for dictionary learning
- Compressed dictionary learning
- Multilinear compressive sensing and an application to convolutional linear networks
- Lower bounds for sparse coding
- Low complexity regularization of linear inverse problems
- Average best \(m\)-term approximation
- Multi-parameter approaches in image processing
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
- Efficient blind compressed sensing using sparsifying transforms with convergence guarantees and application to magnetic resonance imaging
- Unique sharp local minimum in \(\ell_1\)-minimization complete dictionary learning
- Convergence regions of alternating minimization algorithms for dictionary learning
- A hierarchical approach for sparse source blind signal separation problem
- An efficient algorithm for overcomplete sparsifying transform learning with signal denoising
- Learning sparsely used overcomplete dictionaries via alternating minimization
- Local identifiability of \(\ell_1\)-minimization dictionary learning: a sufficient and almost necessary condition
- Compressive sensing and neural networks from a statistical learning perspective
- Fast overcomplete dictionary construction with probabilistic guarantees
- NETT: solving inverse problems with deep neural networks
This page was built for publication: Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281419)
