Learn more about the Dynamic Programming, Greedy Algorithms course here including a course overview, cost information, related jobs and more.

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.