Unique sharp local minimum in _1-minimization complete dictionary learning

Authors

Publication date 5 October 2020

Full work available at URL https://arxiv.org/abs/1902.08380, https://jmlr.csail.mit.edu/papers/v21/19-169.html

nonconvex optimization dictionary learning $\ell_1$-minimization local and global identifiability sharp local minimum

Linear regression; mixed models (62J05) Learning and adaptive systems in artificial intelligence (68T05) Estimation in multivariate analysis (62H12) Nonconvex programming, global optimization (90C26)

Recommendations

Local identifiability of $\ell_1$-minimization dictionary learning: a sufficient and almost necessary condition
Learning sparsely used overcomplete dictionaries via alternating minimization
Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
The sample complexity of dictionary learning

Cites work

scientific article; zbMATH DE number 5982713 (Why is no real title available?)
scientific article; zbMATH DE number 1332320 (Why is no real title available?)
$rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries
Atomic decomposition by basis pursuit
Bilinear Generalized Approximate Message Passing—Part I: Derivation
Bilinear Generalized Approximate Message Passing—Part II: Applications
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
Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization
Dictionary Learning Algorithms for Sparse Representation
Dictionary learning and tensor decomposition via the sum-of-squares method
Enhancing sparsity by reweighted $\ell _{1}$ minimization
Flat Minima
Independent component analysis, a new concept?
Learning sparsely used overcomplete dictionaries via alternating minimization
Local identifiability of $\ell_1$-minimization dictionary learning: a sufficient and almost necessary condition
Local identification of overcomplete dictionaries
On Sparse Representations in Arbitrary Redundant Bases
On the identifiability of overcomplete dictionaries via the minimisation principle underlying K-SVD
On the linear combination of Laplace random variables
On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
Online learning for matrix factorization and sparse coding
Sparse and Spurious: Dictionary Learning With Noise and Outliers
Subgradient method for nonconvex nonsmooth optimization

Cited in

(4)

Learning sparsely used overcomplete dictionaries via alternating minimization
Local identifiability of $\ell_1$-minimization dictionary learning: a sufficient and almost necessary condition
Sensitivity computation of the ℓ ₁ minimization problem and its application to dictionary design of ill-posed problems
Weakly convex optimization over Stiefel manifold using Riemannian subgradient-type methods

This page was built for publication: Unique sharp local minimum in $\ell_1$-minimization complete dictionary learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969112)