.png){kind=icon}
.png){kind=icon}
Return
An Online Multiple Kernel Parallelizable Learning Scheme
.png){kind=icon}
OA
AI
DOI：10.1109/LSP.2023.3343185.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The performance of reproducing kernel Hilbert space-based methods is known to be sensitive to the choice of the reproducing kernel. Choosing an adequate reproducing kernel can be challenging and computationally demanding, especially in data-rich tasks without prior information about the solution domain. In this paper, we propose a learning scheme that scalably combines several single kernel-based online methods to reduce the kernel-selection bias. The proposed learning scheme applies to any task formulated as a regularized empirical risk minimization convex problem. More specifically, our learning scheme is based on a multi-kernel learning formulation that can be applied to widen any single-kernel solution space, thus increasing the possibility of finding higher-performance solutions. In addition, it is parallelizable, allowing for the distribution of the computational load across different computing units. We show experimentally that the proposed learning scheme outperforms the combined single-kernel online methods separately in terms of the cumulative regularized least squares cost metric.
Keywords:
Dictionaries
Kernel
Costs
Task analysis
Upper bound
Complexity theory
Measurement
Online learning
reproducing kernel Hilbert space
multi-kernel learning
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W