资源分类
》 资源 》论文》Exact Recovery of Sparsely-Used Dictionaries

Exact Recovery of Sparsely-Used Dictionaries

2019-11-11 | |  36 |   29 |   0

Abstract We consider the problem of learning sparsely used dictionaries with an arbitrary square dictionary and a random, sparse coefficient matrix. We prove that O(n log n) samples are sufficient to uniquely determine the coefficient matrix. Based on this proof, we design a polynomial-time algorithm, called Exact Recovery of Sparsely-Used Dictionaries (ERSpUD), and prove that it probably recovers the dictionary and coefficient matrix when the coefficient matrix is sufficiently sparse. Simulation results show that ER-SpUD reveals the true dictionary as well as the coefficients with probability higher than many state-of-the-art algorithms.

上一篇：CLiMF: Collaborative Less-Is-More Filtering Yue Shi Alexandros Karatzoglou Linas Baltrunas

下一篇：Socioscope: Spatio-Temporal Signal Recovery from Social Media (Extended Abstract)

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...