Learning Landmark-Based Ensembles with Random Fourier Features and Gradient Boosting
Abstract
We propose a Gradient Boosting algorithm for learning an ensemble of kernel functions adapted to the task at hand. Unlike state-of-the-art Multiple Kernel Learning techniques that make use of a pre-computed dictionary of kernel functions to select from, at each iteration we fit a kernel by approximating it as a weighted sum of Random Fourier Features (RFF) and by optimizing their barycenter. This allows us to obtain a more versatile method, easier to setup and likely to have better performance. Our study builds on a recent result showing one can learn a kernel from RFF by computing the minimum of a PAC-Bayesian bound on the kernel alignment generalization loss, which is obtained efficiently from a closed-form solution. We conduct an experimental analysis to highlight the advantages of our method w.r.t. both Boosting-based and kernel-learning state-of-the-art methods.
Cite
@article{arxiv.1906.06203,
title = {Learning Landmark-Based Ensembles with Random Fourier Features and Gradient Boosting},
author = {Léo Gautheron and Pascal Germain and Amaury Habrard and Emilie Morvant and Marc Sebban and Valentina Zantedeschi},
journal= {arXiv preprint arXiv:1906.06203},
year = {2019}
}