arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1203.3495cs.LGstat.ML
收藏

无参数谱核学习

Parameter-Free Spectral Kernel Learning

Qi Mao, Ivor W. Tsang

摘要:

由于未标记数据的普遍存在,使用未标记数据进行学习在机器学习中引起了越来越多的关注。本文提出了一种新的半监督核学习方法,该方法可以无缝地结合未标记数据的流形结构和正则化最小二乘(RLS)来学习新的核。有趣的是,新的核矩阵可以通过使用图拉普拉斯矩阵的谱分解来解析地获得。因此,该算法不需要任何数值优化求解器。此外,通过最大化标记数据上的核目标对齐,我们还可以使用封闭形式的解决方案自动学习模型参数。对于给定的图拉普拉斯矩阵,我们提出的方法不需要调整任何模型参数,包括RLS中的权衡参数和未标记数据的平衡参数。在10个基准数据集上的大量实验表明,我们提出的两阶段无参数谱核学习算法在换能环境下可以获得与微调流形正则化方法相当的性能,在监督环境下优于多核学习。

英文摘要:

Due to the growing ubiquity of unlabeled data, learning with unlabeled data is attracting increasing attention in machine learning. In this paper, we propose a novel semi-supervised kernel learning method which can seamlessly combine manifold structure of unlabeled data and Regularized Least-Squares (RLS) to learn a new kernel. Interestingly, the new kernel matrix can be obtained analytically with the use of spectral decomposition of graph Laplacian matrix. Hence, the proposed algorithm does not require any numerical optimization solvers. Moreover, by maximizing kernel target alignment on labeled data, we can also learn model parameters automatically with a closed-form solution. For a given graph Laplacian matrix, our proposed method does not need to tune any model parameter including the tradeoff parameter in RLS and the balance parameter for unlabeled data. Extensive experiments on ten benchmark datasets show that our proposed two-stage parameter-free spectral kernel learning algorithm can obtain comparable performance with fine-tuned manifold regularization methods in transductive setting, and outperform multiple kernel learning in supervised setting.

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

↑