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

DOI10.1007/978-3-642-16108-7_14MaRDI QIDQ4930694zbMATH OpenOpenAlexFDO

Authors Vladimir G. Pestov

Publication date 1 October 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-16108-7_14

Mathematics Subject Classification ID

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

Recommendations

• PAC learnability under non-atomic measures: a problem by Vidyasagar
• Learnability and the Vapnik-Chervonenkis dimension
• PAC learning, VC dimension, and the arithmetic hierarchy
• Characterizations of learnability for classes of \(\{0,\dots,n\}\)-valued functions
• Learnability with respect to fixed distributions

Cited in

(2)

• Characterizing PAC-learnability of semilinear sets
• PAC learnability under non-atomic measures: a problem by Vidyasagar

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4930694)