Conference Proceeding Article
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.
On-line learning and relative loss bounds, Kernels
Computer Sciences | Databases and Information Systems
Data Management and Analytics
Algorithmic Learning Theory: 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010: Proceedings
City or Country
JIN, Rong; HOI, Steven C. H.; and YANG, Tianbao.
Online Multiple Kernel Learning: Algorithms and Mistake Bounds. (2010). Algorithmic Learning Theory: 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010: Proceedings. 6331, 390-404. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/2359