PAC learnability of a concept class under non-atomic measures: a problem by Vidyasagar
Abstract
In response to a 1997 problem of M. Vidyasagar, we state a necessary and sufficient condition for distribution-free PAC learnability of a concept class C under the family of all non-atomic (diffuse) measures on the domain . Clearly, finiteness of the classical Vapnik-Chervonenkis dimension of C is a sufficient, but no longer necessary, condition. Besides, learnability of C under non-atomic measures does not imply the uniform Glivenko-Cantelli property with regard to non-atomic measures. Our learnability criterion is stated in terms of a combinatorial parameter ( C\,mod\,ω1) which we call the VC dimension of C modulo countable sets. The new parameter is obtained by ``thickening up'' single points in the definition of VC dimension to uncountable ``clusters''. Equivalently, ( Cω1)≤ d if and only if every countable subclass of C has VC dimension ≤ d outside a countable subset of . The new parameter can be also expressed as the classical VC dimension of C calculated on a suitable subset of a compactification of . We do not make any measurability assumptions on C, assuming instead the validity of Martin's Axiom (MA).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.