Error bounds for \(l^p\)-norm multiple kernel learning with least square loss (Q448851): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
Summary: The problem of learning the kernel function with linear combinations of multiple kernels has attracted considerable attention recently in machine learning. Specially, by imposing an \(l^p\)-norm penalty on the kernel combination coefficient, multiple kernel learning (MKL) was proved useful and effective for theoretical analysis and practical applications. In this paper, we present a theoretical analysis on the approximation error and learning ability of the \(l^p\)-norm MKL. Our analysis shows explicit learning rates for \(l^p\)-norm MKL and demonstrates some notable advantages compared with traditional kernel-based learning algorithms where the kernel is fixed. | |||
| Property / review text: Summary: The problem of learning the kernel function with linear combinations of multiple kernels has attracted considerable attention recently in machine learning. Specially, by imposing an \(l^p\)-norm penalty on the kernel combination coefficient, multiple kernel learning (MKL) was proved useful and effective for theoretical analysis and practical applications. In this paper, we present a theoretical analysis on the approximation error and learning ability of the \(l^p\)-norm MKL. Our analysis shows explicit learning rates for \(l^p\)-norm MKL and demonstrates some notable advantages compared with traditional kernel-based learning algorithms where the kernel is fixed. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 68T05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 62H30 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6078833 / rank | |||
Normal rank | |||
Revision as of 10:46, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Error bounds for \(l^p\)-norm multiple kernel learning with least square loss |
scientific article |
Statements
Error bounds for \(l^p\)-norm multiple kernel learning with least square loss (English)
0 references
7 September 2012
0 references
Summary: The problem of learning the kernel function with linear combinations of multiple kernels has attracted considerable attention recently in machine learning. Specially, by imposing an \(l^p\)-norm penalty on the kernel combination coefficient, multiple kernel learning (MKL) was proved useful and effective for theoretical analysis and practical applications. In this paper, we present a theoretical analysis on the approximation error and learning ability of the \(l^p\)-norm MKL. Our analysis shows explicit learning rates for \(l^p\)-norm MKL and demonstrates some notable advantages compared with traditional kernel-based learning algorithms where the kernel is fixed.
0 references
