.png){kind=icon}
返回
Approximation and learning by greedy algorithms
.png){kind=icon}
OA
AI
DOI：10.1214/009053607000000631.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider the problem of approximating a given element f from a Hilbert space H by means of greedy algorithms and the application of such procedures to the regression problem in statistical learning theory. We improve on the existing theory of convergence rates for both the orthogonal greedy algorithm and the relaxed greedy algorithm, as well as for the forward stepwise projection algorithm. For all these algorithms, we prove convergence results for a variety of function classes and not simply those that are related to the convex hull of the dictionary. We then show how these bounds for convergence rates lead to a new theory for the performance of greedy algorithms in learning. In particular, we build upon the results in [IEEE Trans. Inform. Theory 42 (1996) 2118-2132] to construct learning algorithms based on greedy approximations which are universally consistent and provide provable convergence rates for large classes of functions. The use of greedy algorithms in the context of learning is very appealing since it greatly reduces the computational burden when compared with standard model selection using general dictionaries.
Keyword:
nonparametric regression
statistical learning
convergence rates for greedy algorithms
interpolation spaces
neural networks
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
2.8K
被引数:
2.9W
机构
引用论文
分享收藏分享收藏Real-Time Analysis of a Modified State Observer for Sensorless Induction Motor Drive Used in Electric Vehicle Applications.png)
EnergiesOAAI
EnergiesIF0
OAAI分享收藏
查看更多内容