Learning from Solution Paths: An Approach to the Credit Assignment Problem

Derek Sleeman, Pat Langley, Tom M. Mitchell

Abstract


In this article we discuss a method for learning useful conditions on the application of operators during heuristic search. Since learning is not attempted until a complete solution path has been found for a problem, credit for correct moves and blame for incorrect moves is easily assigned. We review four learning systems that have incorporated similar techniques to learn in the domains of algebra, symbolic integration, and puzzle-solving. We conclude that the basic approach of learning from solution paths can be applied to any situation in which problems can be solved by sequential search. Finally, we examine some potential difficulties that may arise in more complex domains, and suggest some possible extensions for dealing with them.

Full Text:

PDF


DOI: http://dx.doi.org/10.1609/aimag.v3i2.372

Copyright © 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.