Measuring learning complexity with criteria epitomizers

DOI10.4230/LIPICS.STACS.2011.320MaRDI QIDQ3113696zbMATH OpenFDO

Authors Timo Kötzing, John Case

Publication date 23 January 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_e7b9.html

zbMATH Keywords

algorithmic learning theoryepitomizing setslearning complexityrobustness in learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Computability-theoretic learning complexity
• On the intrinsic complexity of learning recursive functions
• On the intrinsic complexity of learning
• Intrinsic complexity of partial learning
• Intrinsic complexity of uniform learning

Cited in

(4)

• Computability-theoretic learning complexity
• Iterative learning from positive data and counters
• Towards an atlas of computational learning theory
• Theory and Applications of Models of Computation

This page was built for publication: Measuring learning complexity with criteria epitomizers

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