Abstract
We study the Vapnik-Chervonenkis dimension of concept classes that are defined by computer programs using analytic algebraic functionals (Nash operators) as primitives. Such bounds are of interest in learning theory because of the fundamental role the Vapnik-Chervonenkis dimension plays in characterizing the sample complexity required to learn concept classes. We strengthen previous results by Goldberg and Jerrum giving upper bounds on the VC dimension of concept classes in which the membership test for whether an input belongs to a concept in the class can be performed either by an algebraic computation tree or by an algebraic circuit containing analytic algebraic gates. These new bounds are polynomial both in the height of the tree and in the depth of the circuit. This means in particular that VC dimension of computer programs using Nash operators is polynomial not only in the sequential complexity but also in the parallel complexity what ensures polynomial VC dimension for classes of concepts whose membership test can be defined by well-parallelizable sequential exponential time algorithms using analytic algebraic operators.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.