Convergence regions of alternating minimization algorithms for dictionary learning
From MaRDI portal
Cites work
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A characterization on singular value inequalities of matrices
- A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries
- Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
- Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method
- Compressed sensing
- Convergence radius and sample complexity of ITKM algorithms for dictionary learning
- Dictionary Identification—Sparse Matrix-Factorization via \ell₁-Minimization
- Dictionary learning -- from local towards global and adaptive
- Dictionary Learning Algorithms for Sparse Representation
- Dictionary learning and tensor decomposition via the sum-of-squares method
- Inequalities for sums and direct sums of Hilbert space operators
- Learning sparsely used overcomplete dictionaries via alternating minimization
- Least angle regression. (With discussion)
- Local identification of overcomplete dictionaries
- On some extensions of Bernstein's inequality for self-adjoint operators
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
- Online learning for matrix factorization and sparse coding
- Recursive Least Squares Dictionary Learning Algorithm
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sparse and Spurious: Dictionary Learning With Noise and Outliers
- Sparse Approximate Solutions to Linear Systems
- Submatrices with nonuniformly selected random supports and insights into sparse approximation
- User-friendly tail bounds for sums of random matrices
This page was built for publication: Convergence regions of alternating minimization algorithms for dictionary learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6846080)
