arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1804.07101stat.MLcs.LG
收藏

词典学习--从局部到全局和自适应

Dictionary learning -- from local towards global and adaptive

University of Innsbruck(因斯布鲁克大学)

Marie Christine Pali, Karin Schnass

摘要:

本文研究了基于迭代保持和K-残差均值(ITKrM)算法的字典学习的收敛性。一方面,它证明了ITKrM是一个收缩下更宽松的条件比以前必要的。另一方面,它表明,似乎存在稳定的不动点,不对应于生成的字典,这可以被描述为非常连贯的。基于使用这些坏字典的残差的分析,提出用精心设计的替换候选者替换相干原子。在对合成数据的实验中,这优于随机或无替换,并且总是导致完整的字典恢复。最后,如何学习字典没有正确的字典大小和稀疏水平的知识的问题得到解决。将相干或未使用的原子的替换策略解耦为修剪和添加,并缓慢地小心地增加稀疏度,从而产生ITKrM的自适应版本。在几个实验中,这种自适应字典学习算法被证明可以从合成数据上的各种大小的随机初始化字典中恢复生成字典,并学习图像数据上有意义的字典。

英文摘要:

This paper studies the convergence behaviour of dictionary learning via the Iterative Thresholding and K-residual Means (ITKrM) algorithm. On one hand it is proved that ITKrM is a contraction under much more relaxed conditions than previously necessary. On the other hand it is shown that there seem to exist stable fixed points that do not correspond to the generating dictionary, which can be characterised as very coherent. Based on an analysis of the residuals using these bad dictionaries, replacing coherent atoms with carefully designed replacement candidates is proposed. In experiments on synthetic data this outperforms random or no replacement and always leads to full dictionary recovery. Finally the question how to learn dictionaries without knowledge of the correct dictionary size and sparsity level is addressed. Decoupling the replacement strategy of coherent or unused atoms into pruning and adding, and slowly carefully increasing the sparsity level, leads to an adaptive version of ITKrM. In several experiments this adaptive dictionary learning algorithm is shown to recover a generating dictionary from randomly initialised dictionaries of various sizes on synthetic data and to learn meaningful dictionaries on image data.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑