103 citations · 111 across the 2 of their papers we have counts for
2 papers
cs.LG2019★ 8 cited
Complete Dictionary Learning via -Norm Maximization over the Orthogonal Group
Yuexiang Zhai, Zitong Yang, Zhenyu Liao +2
This paper considers the fundamental problem of learning a complete (orthogonal) dictionary from samples of sparsely generated signals. Most existing methods solve the dictionary (…
cs.LG2012★ 103 cited
Exact Recovery of Sparsely-Used Dictionaries
Daniel A. Spielman, Huan Wang, John Wright
We consider the problem of learning sparsely used dictionaries with an arbitrary square dictionary and a random, sparse coefficient matrix. We prove that samples are…