On the convergence rate of kernel-based sequential greedy regression (Q1938256)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the convergence rate of kernel-based sequential greedy regression |
scientific article; zbMATH DE number 6134129
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the convergence rate of kernel-based sequential greedy regression |
scientific article; zbMATH DE number 6134129 |
Statements
On the convergence rate of kernel-based sequential greedy regression (English)
0 references
4 February 2013
0 references
Summary: A kernel-based greedy algorithm is presented to realize efficient sparse learning with data-dependent basis functions. Upper bound of generalization error is obtained based on the complexity measure of hypothesis space with covering numbers. A careful analysis shows the error has a satisfactory decay rate under mild conditions.
0 references
0 references
