scientific article; zbMATH DE number 6982924

zbMath1467.68155arXiv1505.04363MaRDI QIDQ4558493

No author found.

Publication date: 22 November 2018

Full work available at URL: https://arxiv.org/abs/1505.04363

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

local minimumnon-convex optimizationdictionary learning\(\ell_1\)-minimizationsparse decomposition

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Point estimation (62F10) Nonconvex programming, global optimization (90C26) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Unnamed Item

Uses Software

• PDCO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Statistics for high-dimensional data. Methods, theory and applications.
• On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
• Independent component analysis, a new concept?
• On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
• Blind Source Separation by Sparse Decomposition in a Signal Dictionary
• Sparse Modeling for Image and Vision Processing
• When Can Dictionary Learning Uniquely Recover Sparse Data From Subsamples?
• Sparse and Spurious: Dictionary Learning With Noise and Outliers
• Sample Complexity of Dictionary Learning and Other Matrix Factorizations
• A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries
• Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture
• Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization
• On Sparse Representations in Arbitrary Redundant Bases
• Decoding by Linear Programming
• Sparse and Redundant Representations
• Dictionary Learning for L1-Exact Sparse Coding
• Atomic Decomposition by Basis Pursuit
• $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
• $K$-Dimensional Coding Schemes in Hilbert Spaces
• Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization
• Computing a nonnegative matrix factorization -- provably
• Model Selection and Estimation in Regression with Grouped Variables
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• Local Identification of Overcomplete Dictionaries

This page was built for publication: