On the Convergence Rate of Kernel-Based Sequential Greedy Regression

Xiaoyin Wang, Xiaoyan Wei and Zhibin Pan

Abstract and Applied Analysis, 2012, vol. 2012, 1-9

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)
http://downloads.hindawi.com/journals/AAA/2012/619138.pdf (application/pdf)
http://downloads.hindawi.com/journals/AAA/2012/619138.xml (text/xml)

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:hin:jnlaaa:619138

DOI: 10.1155/2012/619138

Access Statistics for this article

More articles in Abstract and Applied Analysis from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().