Abstract
The concept and the estimates of statistic complex- ity are given in this paper.We show that for a function class with a polynomial rate of the VC dimension,one can find a set of linear empirical functionals of polynomial size in the dimension that are sufficient for constructing a learning algorithm which can approximate any function in the class.At the same time,a random procedure to select these functionals is given.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call