Department of Computer Science
 
Chair V

 
University of Bonn -> Department of Computer Science -> Chair V
CS-Reports 1985-1989 Copyright 1985-1989 University of Bonn, Department of Computer Science, Abt. V
8537

VC Dimension and Learnability of Sparse Polynomials and Rational Functions
Marek Karpinski, Thorsten Werther
[Download PostScript] [Download PDF]

We prove upper and lower bounds on the VC dimension of sparse univariate polynomials over reals, and apply these results to prove uniform learnability of sparse polynomials and rational functions. As another application we solve an open problem of Vapnik ([Vapnik 82]) on uniform approximation of the general regression functions, a central problem of computational statistics (cf. [Vapnik 82]), p. 256).

Last Change: 11/05/14 at 09:10:08
 Deutsch
University of Bonn -> Department of Computer Science -> Chair V