Dictionary learning for the almost-linear sparsity regime
From MaRDI portal
Cites work
- A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables
- A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries
- Adaptive estimation of a quadratic functional by model selection.
- Atomic Decomposition by Basis Pursuit
- Complete dictionary learning via ^4-norm maximization over the orthogonal group
- 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
- Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen (mit einer Anwendung auf die Theorie der Hohlraumstrahlung).
- Decoding by Linear Programming
- Dictionary learning and tensor decomposition via the sum-of-squares method
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 794709 (Why is no real title available?)
- Learning sparsely used overcomplete dictionaries via alternating minimization
- Limit theorems for uniform distributions on spheres in high-dimensional euclidean spaces
- Polynomial-time tensor decompositions with sum-of-squares
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stable signal recovery from incomplete and inaccurate measurements
- The road to deterministic matrices with the restricted isometry property
- The Rotation of Eigenvectors by a Perturbation. III
This page was built for publication: Dictionary learning for the almost-linear sparsity regime
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022712)
