Teachability in computational learning
New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Machine learning: a theoretical approach
Machine learning: a theoretical approach
On exact specification by examples
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
A computational model of teaching
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
On the power of inductive inference from good examples
Theoretical Computer Science
Learning binary relations and total orders
SIAM Journal on Computing
Journal of Computer and System Sciences
On specifying Boolean functions by labelled examples
Discrete Applied Mathematics
Generalized teaching dimensions and the query complexity of learning
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Being taught can be faster than asking questions
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Witness sets for families of binary vectors
Journal of Combinatorial Theory Series A
Journal of Computer and System Sciences
A model of interactive teaching
Journal of Computer and System Sciences - special issue on complexity theory
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Teachers, learners and black boxes
COLT '97 Proceedings of the tenth annual conference on Computational learning theory
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
On the learnability of recursively enumerable languages from good examples
Theoretical Computer Science
Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Markov Decision Processes: Discrete Stochastic Dynamic Programming
Machine Learning
Machine Learning
Learning from Different Teachers
Machine Learning
Combinatorial Results on the Complexity of Teaching and Learning
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
On Teaching and Learning Intersection-Closed Concept Classes
EuroCOLT '99 Proceedings of the 4th European Conference on Computational Learning Theory
Inductive Inference from Good Examples
AII '89 Proceedings of the International Workshop on Analogical and Inductive Inference
Theoretical Computer Science - Special issue: Algorithmic learning theory
Measuring teachability using variants of the teaching dimension
Theoretical Computer Science
Teaching memoryless randomized learners without feedback
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
Teaching learners with restricted mind changes
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
DNF are teachable in the average case
COLT'06 Proceedings of the 19th annual conference on Learning Theory
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Teaching classes with high teaching dimension using few examples
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Models of Cooperative Teaching and Learning
The Journal of Machine Learning Research
Massive online teaching to bounded learners
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
The present paper surveys recent developments in algorithmic teaching. First, the traditional teaching dimension model is recalled. Starting from the observation that the teaching dimension model sometimes leads to counterintuitive results, recently developed approaches are presented. Here, main emphasis is put on the following aspects derived from human teaching/learning behavior: the order in which examples are presented should matter; teaching should become harder when the memory size of the learners decreases; teaching should become easier if the learners provide feedback; and it should be possible to teach infinite concepts and/or finite and infinite concept classes. Recent developments in the algorithmic teaching achieving (some) of these aspects are presented and compared.