Convergence radius and sample complexity of ITKM algorithms for dictionary learning (Q1748252)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Convergence radius and sample complexity of ITKM algorithms for dictionary learning |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence radius and sample complexity of ITKM algorithms for dictionary learning |
scientific article |
Statements
Convergence radius and sample complexity of ITKM algorithms for dictionary learning (English)
0 references
9 May 2018
0 references
dictionary learning
0 references
sparse coding
0 references
sparse component analysis
0 references
sample complexity
0 references
convergence radius
0 references
alternating optimisation
0 references
thresholding
0 references
K-means
0 references
0 references
0 references
0 references
0.782736599445343
0 references
0.7811800837516785
0 references
0.748141348361969
0 references
0.7340373396873474
0 references
0.7124238610267639
0 references
