A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries
From MaRDI portal
Publication:2979124
DOI10.1109/TIT.2016.2614684zbMath1359.62229arXiv1309.1952OpenAlexW2963494673MaRDI QIDQ2979124
Animashree Anandkumar, Praneeth Netrapalli, Alekh Agarwal
Publication date: 2 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.1952
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items
Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization ⋮ Unnamed Item ⋮ $(L_r,L_r,1)$-Decompositions, Sparse Component Analysis, and the Blind Separation of Sums of Exponentials ⋮ A general framework for Bayes structured linear models ⋮ Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018 ⋮ Learning semidefinite regularizers ⋮ Combinatorial rigidity of incidence systems and application to dictionary learning ⋮ Unnamed Item ⋮ A geometric analysis of phase retrieval ⋮ Low Complexity Regularization of Linear Inverse Problems ⋮ Multilinear Compressive Sensing and an Application to Convolutional Linear Networks ⋮ Identifiability of Complete Dictionary Learning
This page was built for publication: A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries
