Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the programs to be generated. As a way of overcoming ...
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Many learning tasks in adversarial domains tend to be highly dependent on the opponent. Predefined strategies optimized for play against a specific opponent are not likely to succ...
Achim Rettinger, Martin Zinkevich, Michael H. Bowl...
The available concept-learners only partially fulfill the needs imposed by the learning apprentice generation of learners. We present a novel approach to interactive concept-learni...
Constructive induction divides the problem of learning an inductive hypothesis into two intertwined searches: one—for the “best” representation space, and two—for the “be...