Papers
Topics
Authors
Recent
Search
2000 character limit reached

PAC learnability under non-atomic measures: a problem by Vidyasagar

Published 27 May 2011 in stat.ML | (1105.5669v3)

Abstract: In response to a 1997 problem of M. Vidyasagar, we state a criterion for PAC learnability of a concept class C\mathscr C under the family of all non-atomic (diffuse) measures on the domain Ω\Omega. 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 C\mathscr C 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 C\mathscr C has VC dimension ≤d\leq d outside a countable subset of Ω\Omega. The new parameter can be also expressed as the classical VC dimension of C\mathscr C calculated on a suitable subset of a compactification of Ω\Omega. We do not make any measurability assumptions on C\mathscr C, 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.

Authors (1)
Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.