On the Convergence Rate of Kernel-Based Sequential Greedy Regression
Joint Authors
Wang, Xiaoyin
Wei, Xiaoyan
Pan, Zhibin
Source
Issue
Vol. 2012, Issue 2012 (31 Dec. 2012), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2012-12-13
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Wang, Xiaoyin& Wei, Xiaoyan& Pan, Zhibin. 2012. On the Convergence Rate of Kernel-Based Sequential Greedy Regression. Abstract and Applied Analysis،Vol. 2012, no. 2012, pp.1-9.
https://search.emarefa.net/detail/BIM-485652
Modern Language Association (MLA)
Wang, Xiaoyin…[et al.]. On the Convergence Rate of Kernel-Based Sequential Greedy Regression. Abstract and Applied Analysis No. 2012 (2012), pp.1-9.
https://search.emarefa.net/detail/BIM-485652
American Medical Association (AMA)
Wang, Xiaoyin& Wei, Xiaoyan& Pan, Zhibin. On the Convergence Rate of Kernel-Based Sequential Greedy Regression. Abstract and Applied Analysis. 2012. Vol. 2012, no. 2012, pp.1-9.
https://search.emarefa.net/detail/BIM-485652
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-485652
