Greedy Algorithm: An iterative procedure that, at each step, selects the component offering the greatest immediate improvement in the approximation of an element.

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.

Banach Spaces And Greedy Algorithms Publication Trend The graph below shows the total number of publications each year in Banach Spaces And Greedy Algorithms.