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

DOI10.1016/J.TCS.2012.10.015zbMath1290.68065arXiv1105.5669OpenAlexW2054806088MaRDI QIDQ1939260

Vladimir G. Pestov

Publication date: 4 March 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1105.5669

zbMATH Keywords

Martin's axiomlearning rulenon-atomic measuresPAC learnabilityfat-shattering dimension modulo countable setsuniform Glivenko-Cantelli classesVC dimension modulo countable sets

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Computational learning theory (68Q32) Bayesian inference (62F15) Learning and adaptive systems in artificial intelligence (68T05) Continuum hypothesis and Martin's axiom (03E50)

This page was built for publication: PAC learnability under non-atomic measures: a problem by Vidyasagar