Ensembles of kernel predictors

Corinna Cortes, Mehryar Mohri, Afshin Rostamizadeh

Research output: Contribution to conferencePaper

Abstract

This paper examines the problem of learning with a finite and possibly large set of p base kernels. It presents a theoretical and empirical analysis of an approach addressing this problem based on ensembles of kernel predictors. This includes novel theoretical guarantees based on the Rademacher complexity of the corresponding hypothesis sets, the introduction and analysis of a learning algorithm based on these hypothesis sets, and a series of experiments using ensembles of kernel predictors with several data sets. Both convex combinations of kernel-based hypotheses and more general Lq-regularized nonnegative combinations are analyzed. These theoretical, algorithmic, and empirical results are compared with those achieved by using learning kernel techniques, which can be viewed as another approach for solving the same problem.

Original languageEnglish (US)
Pages145-152
Number of pages8
StatePublished - 2011
Event27th Conference on Uncertainty in Artificial Intelligence, UAI 2011 - Barcelona, Spain
Duration: Jul 14 2011Jul 17 2011

Other

Other27th Conference on Uncertainty in Artificial Intelligence, UAI 2011
CountrySpain
CityBarcelona
Period7/14/117/17/11

ASJC Scopus subject areas

  • Artificial Intelligence
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Ensembles of kernel predictors'. Together they form a unique fingerprint.

Cite this