Learning to Take Actions

  • Authors:
  • Roni Khardon

  • Affiliations:
  • Division of Informatics, University of Edinburgh, JCMB, King‘s Buildings, Edinburgh EH9 3JZ, Scotland. roni@dcs.ed.ac.uk

  • Venue:
  • Machine Learning
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

We formalize a model for supervised learning ofaction strategies in dynamic stochastic domains and show that PAC-learning results on Occam algorithms hold in this model as well. We then identify a class of rule-based action strategies for which polynomial time learning is possible. The representation of strategies is a generalization of decision lists;strategies include rules with existentially quantified conditions,simple recursive predicates, and small internal state,but are syntactically restricted.We also study the learnability of hierarchically composed strategies wherea subroutine already acquired can be used as a basic action in a higherlevel strategy. We prove some positive results in this setting,but also show that in some cases the hierarchical learning problem is computationally hard.