scientific article; zbMATH DE number 7255094
From MaRDI portal
Publication:4969112
zbMath1498.68270arXiv1902.08380MaRDI QIDQ4969112
No author found.
Publication date: 5 October 2020
Full work available at URL: https://arxiv.org/abs/1902.08380
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
nonconvex optimizationdictionary learning\(\ell_1\)-minimizationlocal and global identifiabilitysharp local minimum
Estimation in multivariate analysis (62H12) Linear regression; mixed models (62J05) Nonconvex programming, global optimization (90C26) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subgradient method for nonconvex nonsmooth optimization
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- 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
- Atomic Decomposition by Basis Pursuit
- ON THE LINEAR COMBINATION OF LAPLACE RANDOM VARIABLES
- Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method
- Sparse and Spurious: Dictionary Learning With Noise and Outliers
- A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries
- 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
- Flat Minima
- Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization
- On Sparse Representations in Arbitrary Redundant Bases
- Dictionary Learning Algorithms for Sparse Representation
- Bilinear Generalized Approximate Message Passing—Part I: Derivation
- Bilinear Generalized Approximate Message Passing—Part II: Applications
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Dictionary Identification—Sparse Matrix-Factorization via $\ell_1$-Minimization
- Local Identification of Overcomplete Dictionaries
This page was built for publication:
