Teaching randomized learners with feedback

DOI10.1016/J.IC.2010.11.005MaRDI QIDQ553294zbMATH OpenOpenAlexFDO

Authors Frank J. Balbach, Thomas Zeugmann

Publication date 27 July 2011

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2115/45035

zbMATH Keywords

algorithmic teachingcomputational complexityrandomized algorithms

Mathematics Subject Classification ID

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

Recommendations

• Teaching Randomized Learners
• Teaching Memoryless Randomized Learners Without Feedback
• Algorithmic Learning Theory
• Recent Developments in Algorithmic Teaching
• Teaching a smarter learner.

Cites work

• A model of interactive teaching
• A threshold of ln n for approximating set cover
• Algorithmic Learning Theory
• An Analysis of Stochastic Shortest Path Problems
• Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
• DNF Are Teachable in the Average Case
• Dynamic programming and optimal control. Vol. 2.
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1559563 (Why is no real title available?)
• Incremental concept learning for bounded data mining.
• Incremental learning from positive data
• Language identification in the limit
• Learning Binary Relations and Total Orders
• Learning from different teachers
• Learning Theory
• On specifying Boolean functions by labelled examples
• On the complexity of teaching
• On the learnability of recursively enumerable languages from good examples
• On the power of inductive inference from good examples
• Probably Approximate Learning of Sets and Functions
• Queries and concept learning
• Queries revisited.
• Teachability in computational learning
• Teaching a smarter learner.
• Teaching Memoryless Randomized Learners Without Feedback
• Witness sets for families of binary vectors

Cited in

(5)

• Massive online teaching to bounded learners
• Teaching Memoryless Randomized Learners Without Feedback
• Recent Developments in Algorithmic Teaching
• Teaching Randomized Learners
• Algorithmic Learning Theory

This page was built for publication: Teaching randomized learners with feedback

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