Book chapter
Online Multiple Kernel Learning: Algorithms and Mistake Bounds
Algorithmic Learning Theory, pp.390-404
Lecture Notes in Computer Science, Springer Berlin Heidelberg
2010
DOI: 10.1007/978-3-642-16108-7_31
Abstract
Online learning and kernel learning are two active research topics in machine learning. Although each of them has been studied extensively, there is a limited effort in addressing the intersecting research. In this paper, we introduce a new research problem, termed Online Multiple Kernel Learning (OMKL), that aims to learn a kernel based prediction function from a pool of predefined kernels in an online learning fashion. OMKL is generally more challenging than typical online learning because both the kernel classifiers and their linear combination weights must be learned simultaneously. In this work, we consider two setups for OMKL, i.e. combining binary predictions or real-valued outputs from multiple kernel classifiers, and we propose both deterministic and stochastic approaches in the two setups for OMKL. The deterministic approach updates all kernel classifiers for every misclassified example, while the stochastic approach randomly chooses a classifier(s) for updating according to some sampling strategies. Mistake bounds are derived for all the proposed OMKL algorithms.
Details
- Title: Subtitle
- Online Multiple Kernel Learning: Algorithms and Mistake Bounds
- Creators
- Rong Jin - Michigan State UniversitySteven C. H Hoi - Nanyang Technological UniversityTianbao Yang - Michigan State University
- Resource Type
- Book chapter
- Publication Details
- Algorithmic Learning Theory, pp.390-404
- Publisher
- Springer Berlin Heidelberg; Berlin, Heidelberg
- Series
- Lecture Notes in Computer Science
- DOI
- 10.1007/978-3-642-16108-7_31
- eISSN
- 1611-3349
- ISSN
- 0302-9743
- Language
- English
- Date published
- 2010
- Academic Unit
- Computer Science
- Record Identifier
- 9984259498902771
Metrics
10 Record Views