Approximation Methods for Supervised Learning Academic Article uri icon


  • Let be an unknown Borel measure defined on the space Z := X Y with X and Y = [-M,M]. Given a set z of m samples zi =(xi,yi) drawn according to , the problem of estimating a regression function f using these samples is considered. The main focus is to understand what is the rate of approximation, measured either in expectation or probability, that can be obtained under a given prior f , i.e., under the assumption that f is in the set , and what are possible algorithms for obtaining optimal or semioptimal (up to logarithms) results. The optimal rate of decay in terms of m is established for many priors given either in terms of smoothness of f or its rate of approximation measured in one of several ways. This optimal rate is determined by two types of results. Upper bounds are established using various tools in approximation such as entropy, widths, and linear and nonlinear approximation. Lower bounds are proved using Kullback-Leibler information together with Fano inequalities and a certain type of entropy. A distinction is drawn between algorithms which employ knowledge of the prior in the construction of the estimator and those that do not. Algorithms of the second type which are universally optimal for a certain range of priors are given. 2005 SFoCM.

published proceedings

  • Foundations of Computational Mathematics

author list (cited authors)

  • DeVore, R., Kerkyacharian, G., Picard, D., & Temlyakov, V.

citation count

  • 53

complete list of authors

  • DeVore, Ronald||Kerkyacharian, Gerard||Picard, Dominique||Temlyakov, Vladimir

publication date

  • February 2006