Collaborating Authors

Evolutionary Systems

Interactions between learning and evolution


In Langton, C., Taylor, C., Farmer, J. D., and Ramussen, S. (Eds.), Artificial Life II, pp. 487–509. Addison-Wesley

Explanation-Based Generalization: A Unifying View


"The problem of formulating general concepts from specific training examples has long been a major focus of machine learning research. While most previous research has focused on empirical methods for generalizing from a large number of training examples using no domain-specific knowledge, in the past few years new methods have been developed for applying domain-specific knowledge to formulate valid generalizations from single training examples. The characteristic common to these methods is that their ability to generalize from a single example follows from their ability to explain why the training example is a member of the concept being learned. This paper proposes a general, domain-independent mechanism, called EBG, that unifies previous approaches to explanation-based generalization. The EBG method is illustrated in the context of several example problems, and used to contrast several existing systems for explanation-based generalization. The perspective on explanation-based generalization afforded by this general method is also used to identify open research problems in this area." Machine Learning, 1 (1), 47–80.

Generalization as Search


"The purpose of this paper is to compare various approaches to generalization in terms of a single framework. Toward this end, generalization is cast as a search problem, and alternative methods for generalization are characterized in terms of the search strategies that they employ. This characterization uncovers similarities among approaches, and leads to a comparison of relative capabilities and computational complexities of alternative approaches. The characterization allows a precise comparison of systems that utilize different representations for learned generalizations."Artificial Intelligence, 18 (2), 203-26.

Bias in Generalization


In Proceedings of IJCA/-8 I, AAAI 1981, Computers and Thought Award Lecture

An effective heuristic algorithm for the travelling-salesman problem


We describe an artificial ant colony capable of solving the travelling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. Computer simulations demonstrate that the artificial ant colony is capable of generating good solutions to both symmetric and asymmetric instances of the TSP. The method is an example, like simulated annealing, neural networks and evolutionary computation, of the successful use of a natural metaphor to design an optimization algorithm.