Alignment based kernel learning with a continuous set of base kernels
From MaRDI portal
Abstract: The success of kernel-based learning methods depend on the choice of kernel. Recently, kernel learning methods have been proposed that use data to select the most appropriate kernel, usually by combining a set of base kernels. We introduce a new algorithm for kernel learning that combines a {em continuous set of base kernels}, without the common step of discretizing the space of base kernels. We demonstrate that our new method achieves state-of-the-art performance across a variety of real-world datasets. Furthermore, we explicitly demonstrate the importance of combining the right dictionary of kernels, which is problematic for methods based on a finite set of base kernels chosen a priori. Our method is not the first approach to work with continuously parameterized kernels. However, we show that our method requires substantially less computation than previous such approaches, and so is more amenable to multiple dimensional parameterizations of base kernels, which we demonstrate.
Recommendations
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 6253899 (Why is no real title available?)
- Large scale multiple kernel learning
- Learning Theory
- Learning the kernel matrix with semidefinite programming
- SimpleMKL
- Statistics for high-dimensional data. Methods, theory and applications.
- The elements of statistical learning. Data mining, inference, and prediction
Cited in
(2)
This page was built for publication: Alignment based kernel learning with a continuous set of base kernels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q399887)