Active learning of recursive functions by ultrametric algorithms

DOI10.1007/978-3-319-04298-5_22MaRDI QIDQ2938104zbMATH OpenOpenAlexFDO

Authors Rūsiņš Freivalds, Thomas Zeugmann

Publication date 13 January 2015

Published in SOFSEM 2014: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04298-5_22

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational learning theory (68Q32)

Recommendations

• Ultrametric vs. quantum query algorithms
• Active learning using arbitrary binary valued queries
• Bayesian active learning using arbitrary binary valued queries
• On the intrinsic complexity of learning recursive functions
• Learning Boolean functions with queries

Cited in

(2)

• Learning in ultrametric committee machines
• Ultrametric vs. quantum query algorithms

This page was built for publication: Active learning of recursive functions by ultrametric algorithms

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