Bounding the cost of learned rules

Citation
J. Kim et Ps. Rosenbloom, Bounding the cost of learned rules, ARTIF INTEL, 120(1), 2000, pp. 43-80
Citations number
49
Categorie Soggetti
AI Robotics and Automatic Control
Journal title
ARTIFICIAL INTELLIGENCE
ISSN journal
00043702 → ACNP
Volume
120
Issue
1
Year of publication
2000
Pages
43 - 80
Database
ISI
SICI code
0004-3702(200006)120:1<43:BTCOLR>2.0.ZU;2-0
Abstract
In this article we approach one key aspect of the utility problem in explan ation-based learning (EBL)-the expensive-role problem-as an avoidable defec t in the learning procedure, In particular, we examine the relationship bet ween the cost of solving a problem without learning versus the cost of usin g a learned rule to provide the same solution, and refer to a learned rule as expensive if its use is more costly than the original problem solving fr om which it was learned. The key idea we explore is that expensiveness is i nadvertently and unnecessarily introduced into learned rules by the learnin g algorithms themselves. This becomes a particularly powerful idea when com bined with an analysis tool which identifies these hidden sources of expens iveness, and modifications of the learning algorithms which eliminate them. The result is learning algorithms for which the cost of learned rules is b ounded by the cost of the problem solving that they replace. (C) 2000 Elsev ier Science B.V. All rights reserved.