The sample complexity of dictionary learning
From MaRDI portal
Recommendations
- Dictionary Learning Algorithms for Sparse Representation
- Local identifiability of \(\ell_1\)-minimization dictionary learning: a sufficient and almost necessary condition
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Compressed dictionary learning
- An efficient algorithm for learning dictionary under coherence constraint
Cited in
(24)- Convergence radius and sample complexity of ITKM algorithms for dictionary learning
- Learning semidefinite regularizers
- Risk bound of transfer learning using parametric feature mapping and its application to sparse coding
- Dimensionality-dependent generalization bounds for \(k\)-dimensional coding schemes
- Alternating proximal regularized dictionary learning
- Dictionary Learning Algorithms for Sparse Representation
- Smooth sparse coding via marginal regression for learning sparse representations
- On the Purity and Entropy of Mixed Gaussian States
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
- Learning finite-dimensional coding schemes with nonlinear reconstruction maps
- Optimal regularization for a data source
- Adaptive geometric multiscale approximations for intrinsically low-dimensional data
- Generalization Error in Deep Learning
- Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces
- Unique sharp local minimum in \(\ell_1\)-minimization complete dictionary learning
- Simultaneous off-the-grid learning of mixtures issued from a continuous dictionary
- Learning sparsely used overcomplete dictionaries via alternating minimization
- Local identifiability of \(\ell_1\)-minimization dictionary learning: a sufficient and almost necessary condition
- Learning big (image) data via coresets for dictionaries
- Learning: Wavelet-dictionaries and continuous dictionaries.
- Identifiability of complete dictionary learning
- Compressive sensing and neural networks from a statistical learning perspective
- Trainlets: Dictionary Learning in High Dimensions
- On classification of signals represented with data-dependent overcomplete dictionaries
This page was built for publication: The sample complexity of dictionary learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396727)
