SimpleNPKL: Simple Non-Parametric Kernel Learning

Publisher:
Omnipress
Publication Type:
Conference Proceeding
Citation:
Proceedings of the 26 th International Conference on Machine Learning, 2009, pp. 1273 - 1280
Issue Date:
2009-01
Full metadata record
Files in This Item:
Filename Description Size
2013004292OK.pdf321.2 kB
Adobe PDF
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity of standard interior-point SDP solvers could be as high as O(n6:5). Such intensive computation cost prohibits NPK learning applicable to real applications, even for data sets of moderate size. In this paper, we propose an efficient approach to NPK learning from side information, referred to as SimpleNPKL, which can efficiently learn non-parametric kernels from large sets of pairwise constraints. In particular, we show that the proposed SimpleNPKL with linear loss has a closed-form solution that can be simply computed by the Lanczos algorithm. Moreover, we show that the SimpleNPKL with square hinge loss can be re-formulated as a saddle-point optimization task, which can be further solved by a fast iterative algorithm. In contrast to the previous approaches, our empirical results show that our new technique achieves the same accuracy, but is significantly more efficient and scalable.
Please use this identifier to cite or link to this item: