Catalogue of Artificial Intelligence Techniques
Learning from Solution Paths
Keywords: learning, negative instance, positive instance
Author(s): Pat Langley
Starting with only the legal conditions on a set of Operators, a strategy learning system can employ weak methods to search a problem space. Once a solution path has been found, it can be used to assign credit and blame to instances of these operators. If a move leads from a state on the solution path to another state on the solution path, it is labelled as a positive instance of the responsible operator. However, if a move leads from a state on the solution path to a state not on the path, it is marked as a negative instance. These classifications can then be input to a condition-finding mechanism (such as the generalisation, discrimination or Version Space methods); which will determine the heuristically useful conditions under which each operator should be applied.
- Sleeman, D., Langley, P. and Mitchell, T.M., Learning from solution paths: an approach to the credit assignment problem
AI Magazine 3 (1982) no.2 , 48--52.