Learning by ErasingAuthors: Steffen Lange, Rolf Wiehagen and Thomas Zeugmann Source: RIFIS Technical Report RIFIS-TR-CS-122, RIFIS, Kyushu University 33, February 13, 1996. Abstract. Learning by erasing means the process of eliminating potential hypotheses from further consideration thereby converging to the least hypothesis never eliminated and this one must be a solution to the actual learning problem.
The present paper deals with learnability by erasing of indexed
families The capabilities of learning by erasing are investigated in dependence on the requirement of what sets of hypotheses have to be or may be, erased, and in dependence of the choice of the hypothesis space.
Class preserving learning by erasing
( For all these models of learning by erasing necessary and sufficient conditions for learnability are presented. A complete picture of all separations and coincidences of the learning by erasing models is derived. Learning by erasing is compared with standard models of language learning such as learning in the limit, finite learning and learning without overgeneralization. The exact location of these types within the hierarchy of the learning by erasing models is established.
|