On the convergence rate of kernel-based sequential greedy regression (Q1938256): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2012/619138 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2061751626 / rank | |||
Normal rank |
Revision as of 23:09, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the convergence rate of kernel-based sequential greedy regression |
scientific article |
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