TY - JOUR

T1 - Results on learnability and the Vapnik-Chervonenkis dimension

AU - Linial, Nathan

AU - Mansour, Yishay

AU - Rivest, Ronald L.

N1 - Funding Information:
* This paper was prepared with support from NSF Grant DCR-8607494, AR0 Grant DAAL-03-86-K-0171, and the Siemens Corporation.

PY - 1991/1

Y1 - 1991/1

N2 - We consider the problem of learning a concept from examples in the distribution-free model by Valiant. (An essentially equivalent model, if one ignores issues of computational difficulty, was studied by Vapnik and Chervonenkis.) We introduce the notion of dynamic sampling, wherein the number of examples examined may increase with the complexity of the target concept. This method is used to establish the learnability of various concept classes with an infinite Vapnik-Chervonenkis dimension. We also discuss an important variation on the problem of learning from examples, called approximating from examples. Here we do not assume that the target concept T is a member of the concept class C from which approximations are chosen. This problem takes on particular interest when the VC dimension of C is infinite. Finally, we discuss the problem of computing the VC dimension of a finite concept set defined on a finite domain and consider the structure of classes of a fixed small dimension.

AB - We consider the problem of learning a concept from examples in the distribution-free model by Valiant. (An essentially equivalent model, if one ignores issues of computational difficulty, was studied by Vapnik and Chervonenkis.) We introduce the notion of dynamic sampling, wherein the number of examples examined may increase with the complexity of the target concept. This method is used to establish the learnability of various concept classes with an infinite Vapnik-Chervonenkis dimension. We also discuss an important variation on the problem of learning from examples, called approximating from examples. Here we do not assume that the target concept T is a member of the concept class C from which approximations are chosen. This problem takes on particular interest when the VC dimension of C is infinite. Finally, we discuss the problem of computing the VC dimension of a finite concept set defined on a finite domain and consider the structure of classes of a fixed small dimension.

UR - http://www.scopus.com/inward/record.url?scp=0025742422&partnerID=8YFLogxK

U2 - 10.1016/0890-5401(91)90058-A

DO - 10.1016/0890-5401(91)90058-A

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0025742422

SN - 0890-5401

VL - 90

SP - 33

EP - 49

JO - Information and Computation

JF - Information and Computation

IS - 1

ER -