Online Multiple Kernel Regression
Kernel-based regression represents an important family of learning techniques for solving challenging regression tasks with non-linear patterns. Despite being studied extensively, most of the existing work suffers from two major drawbacks: (i) they are often designed for solving regression tasks in...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2014
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/2319 https://ink.library.smu.edu.sg/context/sis_research/article/3319/viewcontent/KDD14_OMKR_CR.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-3319 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-33192018-12-03T01:18:37Z Online Multiple Kernel Regression SAHOO, Doyen HOI, Steven C. H. LI, Bin Kernel-based regression represents an important family of learning techniques for solving challenging regression tasks with non-linear patterns. Despite being studied extensively, most of the existing work suffers from two major drawbacks: (i) they are often designed for solving regression tasks in a batch learning setting, making them not only computationally inefficient and but also poorly scalable in real-world applications where data arrives sequentially; and (ii) they usually assume a fixed kernel function is given prior to the learning task, which could result in poor performance if the chosen kernel is inappropriate. To overcome these drawbacks, this paper presents a novel scheme of Online Multiple Kernel Regression (OMKR), which sequentially learns the kernel-based regressor in an online and scalable fashion, and dynamically explore a pool of multiple diverse kernels to avoid suffering from a single fixed poor kernel so as to remedy the drawback of manual/heuristic kernel selection. The OMKR problem is more challenging than regular kernel-based regression tasks since we have to on-the-fly determine both the optimal kernel-based regressor for each individual kernel and the best combination of the multiple kernel regressors. In this paper, we propose a family of OMKR algorithms for regression and discuss their application to time series prediction tasks. We also analyze the theoretical bounds of the proposed OMKR method and conduct extensive experiments to evaluate its empirical performance on both real-world regression and times series prediction tasks. 2014-08-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/2319 info:doi/10.1145/2623330.2623712 https://ink.library.smu.edu.sg/context/sis_research/article/3319/viewcontent/KDD14_OMKR_CR.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University kernel regression multiple kernel learning online learning time series prediction Databases and Information Systems Numerical Analysis and Scientific Computing |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
kernel regression multiple kernel learning online learning time series prediction Databases and Information Systems Numerical Analysis and Scientific Computing |
spellingShingle |
kernel regression multiple kernel learning online learning time series prediction Databases and Information Systems Numerical Analysis and Scientific Computing SAHOO, Doyen HOI, Steven C. H. LI, Bin Online Multiple Kernel Regression |
description |
Kernel-based regression represents an important family of learning techniques for solving challenging regression tasks with non-linear patterns. Despite being studied extensively, most of the existing work suffers from two major drawbacks: (i) they are often designed for solving regression tasks in a batch learning setting, making them not only computationally inefficient and but also poorly scalable in real-world applications where data arrives sequentially; and (ii) they usually assume a fixed kernel function is given prior to the learning task, which could result in poor performance if the chosen kernel is inappropriate. To overcome these drawbacks, this paper presents a novel scheme of Online Multiple Kernel Regression (OMKR), which sequentially learns the kernel-based regressor in an online and scalable fashion, and dynamically explore a pool of multiple diverse kernels to avoid suffering from a single fixed poor kernel so as to remedy the drawback of manual/heuristic kernel selection. The OMKR problem is more challenging than regular kernel-based regression tasks since we have to on-the-fly determine both the optimal kernel-based regressor for each individual kernel and the best combination of the multiple kernel regressors. In this paper, we propose a family of OMKR algorithms for regression and discuss their application to time series prediction tasks. We also analyze the theoretical bounds of the proposed OMKR method and conduct extensive experiments to evaluate its empirical performance on both real-world regression and times series prediction tasks. |
format |
text |
author |
SAHOO, Doyen HOI, Steven C. H. LI, Bin |
author_facet |
SAHOO, Doyen HOI, Steven C. H. LI, Bin |
author_sort |
SAHOO, Doyen |
title |
Online Multiple Kernel Regression |
title_short |
Online Multiple Kernel Regression |
title_full |
Online Multiple Kernel Regression |
title_fullStr |
Online Multiple Kernel Regression |
title_full_unstemmed |
Online Multiple Kernel Regression |
title_sort |
online multiple kernel regression |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2014 |
url |
https://ink.library.smu.edu.sg/sis_research/2319 https://ink.library.smu.edu.sg/context/sis_research/article/3319/viewcontent/KDD14_OMKR_CR.pdf |
_version_ |
1770572097106477056 |