Teachability in computational learning

DOI10.1007/BF03037091zbMath0712.68084MaRDI QIDQ749233

Ayumi Shinohara, Satoru Miyano

Publication date: 1991

Published in: New Generation Computing (Search for Journal in Brave)

zbMATH Keywords

computational complexity; computational learning; PAC-learning; teaching

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68T05: Learning and adaptive systems in artificial intelligence

03D15: Complexity of computation (including implicit computational complexity)

Related Items

On the learnability of recursively enumerable languages from good examples, Decision lists and related Boolean functions, Teaching randomized learners with feedback, Measuring teachability using variants of the teaching dimension, DNF are teachable in the average case, A model of interactive teaching, Approximate testing and its relationship to learning, Queries revisited., On the limits of efficient teachability, On specifying Boolean functions by labelled examples, Teacher-directed learning in view-independent face recognition with mixture of experts using single-view eigenspaces, PAC Learning under Helpful Distributions, Recent Developments in Algorithmic Teaching

Cites Work

• Unnamed Item
• Equivalence of models for polynomial learnability
• Approximation algorithms for combinatorial problems
• Learnability and the Vapnik-Chervonenkis dimension
• A theory of the learnable
• Computational limitations on learning from examples