On the Convergence Rate of Kernel‐Based Sequential Greedy Regression

Xiaoyin Wang, Xiaoyan Wei and Zhibin Pan

Abstract and Applied Analysis, 2012, vol. 2012, issue 1

Abstract: 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 complexity measure of hypothesis space with covering numbers. A careful analysis shows the error has a satisfactory decay rate under mild conditions.

Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1155/2012/619138

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:jnlaaa:v:2012:y:2012:i:1:n:619138

Access Statistics for this article

More articles in Abstract and Applied Analysis from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().