Parameter-Free Spectral Kernel Learning

Details Parameter-Free Spectral Kernel Learning Parameter-Free Spectral Kernel Learning

2012-03-15

arxiv.org/abs/1203.3495v1

Computer Science

Learning

Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI2010)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Parameter-Free Spectral Kernel Learning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Parameter-Free Spectral Kernel Learning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parameter-Free Spectral Kernel Learning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-32239