arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.08798eess.SPcs.LG
收藏

约化核字典学习

Reduced Kernel Dictionary Learning

University Politehnica of Bucharest(布加勒斯特理工大学)

Denis C. Ilie-Ablachim, Bogdan Dumitrescu

AI总结:

针对标准核字典学习(KDL)在大数据集下核矩阵过大的问题,提出基于输入信号稀疏表示生成核向量、梯度下降直接优化的约化KDL算法,在三个数据集上实现更优表示且耗时更短。

摘要:

本文提出了用于在核字典学习(Kernel Dictionary Learning,KDL)问题中训练规模缩减的非线性表示的新算法。标准KDL的缺点是当数据集较大时核矩阵规模过大。目前已有多种缩减核规模的方法,其中较为知名的是Nyström采样法。本文提出了一种更契合字典学习核心思想的方法,其中核向量通过输入信号的经训练稀疏表示得到。此外,我们在KDL过程中使用梯度下降步骤直接优化核向量。我们在三个数据集上开展实验,结果表明,尽管仅使用少量核向量,所提算法仍能生成更优的表示,且相比KDL缩短了执行时间。

英文摘要:

In this paper we present new algorithms for training reduced-size nonlinear representations in the Kernel Dictionary Learning (KDL) problem. Standard KDL has the drawback of a large size of the kernel matrix when the data set is large. There are several ways of reducing the kernel size, notably Nyström sampling. We propose here a method more in the spirit of dictionary learning, where the kernel vectors are obtained with a trained sparse representation of the input signals. Moreover, we optimize directly the kernel vectors in the KDL process, using gradient descent steps. We show with three data sets that our algorithms are able to provide better representations, despite using a small number of kernel vectors, and also decrease the execution time with respect to KDL.

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

↑