Compressed dictionary learning
DOI10.1007/s00041-020-09738-6zbMath1433.68378arXiv1805.00692OpenAlexW3012286638MaRDI QIDQ2310825
Karin Schnass, Flavio Teixeira
Publication date: 6 April 2020
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.00692
fast algorithmsdimensionality reductionmatrix factorizationcompressed sensingdictionary learningsparse codingJohnson-Lindenstrauss lemmaFFT based low-distortion embeddings
Analysis of algorithms and problem complexity (68Q25) Factorization of matrices (15A23) Random matrices (probabilistic aspects) (60B20) Learning and adaptive systems in artificial intelligence (68T05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)
Cites Work
- Unnamed Item
- Unnamed Item
- On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
- A tail inequality for quadratic forms of subgaussian random vectors
- Sparse representations of polyphonic music
- Fast dimension reduction using Rademacher series on dual BCH codes
- Convergence radius and sample complexity of ITKM algorithms for dictionary learning
- Suprema of Chaos Processes and the Restricted Isometry Property
- Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method
- Sparse and Spurious: Dictionary Learning With Noise and Outliers
- 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
- New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
- Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization
- Extensions of Lipschitz mappings into a Hilbert space
- Decoding by Linear Programming
- Dictionary Learning Algorithms for Sparse Representation
- Recursive Least Squares Dictionary Learning Algorithm
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Stochastic Subsampling for Factorizing Huge Matrices
- The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
- Blind Compressed Sensing
- The Restricted Isometry Property of Subsampled Fourier Matrices
- Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization
- Learning the parts of objects by non-negative matrix factorization
- Local Identification of Overcomplete Dictionaries
This page was built for publication: Compressed dictionary learning
