Teaching randomized learners with feedback
From MaRDI portal
Publication:553294
DOI10.1016/j.ic.2010.11.005zbMath1217.68116OpenAlexW2050988311MaRDI QIDQ553294
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
Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Teachability in computational learning
- Teaching a smarter learner.
- Analogical and inductive inference. International workshop AII '89, Reinhardsbrunn Castle, GDR, October 1-6, 1989. Proceedings
- On the power of inductive inference from good examples
- A model of interactive teaching
- Learning from different teachers
- Queries revisited.
- Incremental learning from positive data
- Incremental concept learning for bounded data mining.
- On the complexity of teaching
- On specifying Boolean functions by labelled examples
- Witness sets for families of binary vectors
- Queries and concept learning
- Learning Binary Relations and Total Orders
- A threshold of ln n for approximating set cover
- Probably Approximate Learning of Sets and Functions
- Teaching Memoryless Randomized Learners Without Feedback
- An Analysis of Stochastic Shortest Path Problems
- DNF Are Teachable in the Average Case
- Algorithmic Learning Theory
- Learning Theory
- Language identification in the limit
- On the learnability of recursively enumerable languages from good examples
