PAC learnability under non-atomic measures: a problem by Vidyasagar
Abstract: In response to a 1997 problem of M. Vidyasagar, we state a criterion for PAC learnability of a concept class under the family of all non-atomic (diffuse) measures on the domain . The uniform Glivenko--Cantelli property with respect to non-atomic measures is no longer a necessary condition, and consistent learnability cannot in general be expected. Our criterion is stated in terms of a combinatorial parameter $\VC({\mathscr C}\,{\mathrm{mod}}\,\omega_1)$ which we call the VC dimension of modulo countable sets. The new parameter is obtained by "thickening up" single points in the definition of VC dimension to uncountable "clusters". Equivalently, $\VC(\mathscr C\modd\omega_1)\leq d$ if and only if every countable subclass of has VC dimension outside a countable subset of . The new parameter can be also expressed as the classical VC dimension of calculated on a suitable subset of a compactification of . We do not make any measurability assumptions on , assuming instead the validity of Martin's Axiom (MA). Similar results are obtained for function learning in terms of fat-shattering dimension modulo countable sets, but, just like in the classical distribution-free case, the finiteness of this parameter is sufficient but not necessary for PAC learnability under non-atomic measures.
Paper Prompts
Sign up for free to create and run prompts on this paper.