Proceedings

Lazy ExplanationBased Learning: A Solution to the Intractable Theory Problem

Prasad Tadepalli

Download BibTeX Cite

Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Machine Learning. Pages 694-699.

Abstract

Explanation-Based Learning (EBL) depends on the ability of a system to explain to itself, based on the domain theory, that a given training example is a member of the target concept. However, in many complex domains it is often intractable to do this. In this paper I introduce a learning technique called Lazy Explanation-Based Learning as a solution to the problem of intractable explanation process in EBL. This technique is based on the idea that when the domain theory is intractable, it is possible to learn by generalizing incomplete explanations and incrementally refining the over-general knowledge thus learned when met with unexpected plan failures. I describe a program that incrementally learns planning knowledge in game domains through Lazy Explanation-Based Learning. I present both empirical and theoretical evidence for the viability of Lazy Explanation-Based Learning.

Prasad Tadepalli. 1989. Lazy ExplanationBased Learning: A Solution to the Intractable Theory Problem. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89. IJCAI, 694–699. https://ijcai.org/proceedings/1989/111
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards