Back to Search
Start Over
PAC Learnability of a Concept Class under Non-atomic Measures: A Problem by Vidyasagar
- Source :
- Lecture Notes in Computer Science ISBN: 9783642161070, ALT
- Publication Year :
- 2010
- Publisher :
- Springer Berlin Heidelberg, 2010.
-
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 VC(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, VC(C mod ω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).
Details
- ISBN :
- 978-3-642-16107-0
- ISBNs :
- 9783642161070
- Database :
- OpenAIRE
- Journal :
- Lecture Notes in Computer Science ISBN: 9783642161070, ALT
- Accession number :
- edsair.doi...........74047935bf21724e9fcb46602f6d5ffa
- Full Text :
- https://doi.org/10.1007/978-3-642-16108-7_14