scientific article; zbMATH DE number 7164741
From MaRDI portal
Publication:5214233
zbMath1434.68439arXiv1711.03638MaRDI QIDQ5214233
No author found.
Publication date: 7 February 2020
Full work available at URL: https://arxiv.org/abs/1711.03638
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Artificial neural networks and deep learning (68T07) Learning and adaptive systems in artificial intelligence (68T05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Cites Work
- Unnamed Item
- A note on the sample complexity of the Er-SpUD algorithm by Spielman, Wang and Wright for exact recovery of sparsely used dictionaries
- Sparse and Spurious: Dictionary Learning With Noise and Outliers
- Sample Complexity of Dictionary Learning and Other Matrix Factorizations
- Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization
- Decoding by Linear Programming
- On denoising and best signal representation
- Double Sparsity: Learning Sparse Dictionaries for Sparse Signal Approximation
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- An improved analysis of the ER-SpUD dictionary learning algorithm
- Trainlets: Dictionary Learning in High Dimensions
This page was built for publication:
