Pages that link to "Item:Q2198175"
From MaRDI portal
The following pages link to Fast overcomplete dictionary construction with probabilistic guarantees (Q2198175):
Displaying 4 items.
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD (Q741264) (← links)
- Toward fast transform learning (Q1799980) (← links)
- Alternating direction method of multipliers for solving dictionary learning models (Q2343040) (← links)
- A Distribution-Sensitive Dictionary with Low Space Overhead (Q3183445) (← links)