TRADING MONOTONICITY DEMANDS VERSUS EFFICIENCY
Steffen Lange, Thomas Zeugmann · Bulletin of informatics and cybernetics · 1995
The present paper deals with the learnability of indexed families L of uniformly recursive languages from positive data. We consider the influence of three monotonicity demands and their dual counterparts to the efficiency of the learning process. The efficiency of learning is measured in dependence on the number of mind changes a learning algorithm is allowed to perform. The three notions of (dual) monotonicity reflect different formalizations of the requirement that the learner has to produce better and better (specializations) generalizations when fed more and more data on the target concept.