一种用于字典学习的分批单调算法
A Batchwise Monotone Algorithm for Dictionary Learning
摘要:
我们提出了一个批量单调算法的字典学习。与最先进的字典学习算法不同,它在逐个样本的基础上施加稀疏性约束,我们将样本视为一批,并在整体上施加稀疏性约束。分批优化的好处是可以更好地在样本中分配非零值,从而更好地近似整体。为了实现这一点,我们提出了在系数矩阵的支持下,在行和列中切换非零的过程,以减少重构误差。我们证明在建议的支持切换过程中的目标的算法,即,重建误差单调减小并收敛。此外,我们引入了一个块正交匹配追踪算法,也对样本批次提供一个温暖的开始。在自然图像块和UCI数据集上的实验表明,与现有算法相比,该算法在相同的稀疏度水平下产生了更好的近似。
英文摘要:
We propose a batchwise monotone algorithm for dictionary learning. Unlike the state-of-the-art dictionary learning algorithms which impose sparsity constraints on a sample-by-sample basis, we instead treat the samples as a batch, and impose the sparsity constraint on the whole. The benefit of batchwise optimization is that the non-zeros can be better allocated across the samples, leading to a better approximation of the whole. To accomplish this, we propose procedures to switch non-zeros in both rows and columns in the support of the coefficient matrix to reduce the reconstruction error. We prove in the proposed support switching procedure the objective of the algorithm, i.e., the reconstruction error, decreases monotonically and converges. Furthermore, we introduce a block orthogonal matching pursuit algorithm that also operates on sample batches to provide a warm start. Experiments on both natural image patches and UCI data sets show that the proposed algorithm produces a better approximation with the same sparsity levels compared to the state-of-the-art algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。