On the convergence rate of kernel-based sequential greedy regression (Q1938256): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q58695704, #quickstatements; #temporary_batch_1703698927563 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q58695704 / rank | |||
Normal rank | |||
Revision as of 19:47, 27 December 2023
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
