.png){kind=icon}
Return
Learning from different teachers
.png){kind=icon}
OA
AI
DOI：10.1023/A:1022854802097.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We introduce a new model of a learner learning an unknown concept from examples with a teacher's help. In such models, outright coding refers to a situation in which the teacher sends the learner a representation of the concept, either directly or encoded via the examples. Previous models have used adversarial learners or adversarial teachers to try to prevent outright coding. Our model is an attempt to reflect more directly some of the reasons that outright coding is not a common mode of human learning. We model the learner as a Turing machine with oracle access to another programming system, called its function box. The programming system in its function box is initially unknown to the learner. The target concept is a partial recursive function and the goal of the learner is to find in its function box a function that is equal to or extends the target concept. We exhibit a class of learner/teacher pairs in which the learner can learn any partial recursive function, provided that the learner's function box is not too much slower than the teacher's. This result is shown not to hold if the learner's function box can contain an arbitrary acceptable programming system.
Keywords:
concept learning
teacher
programming system
hint
complexity bound
oracle Turing machine
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.9
Papers:
2.7K
Citations:
3.4W
Organization
No organization information available
Cited Papers
No cited papers available