Learning by Automatic Option Discovery from Conditionally Terminating Sequences

  • Authors:
  • Sertan Girgin;Faruk Polat;Reda Alhajj

  • Affiliations:
  • Middle East Technical University, Ankara, Turkey/ and University of Calgary, Calgary, Alberta, Canada, girgins@cpsc.ucalgary.ca;Middle East Technical University, Ankara, Turkey, polat@ceng.metu.edu.tr;University of Calgary, Calgary, Alberta, Canada/ and Global University, Beirut, Lebanon, alhajj@cpsc.ucalgary.ca

  • Venue:
  • Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes a novel approach to discover options in the form of conditionally terminating sequences, and shows how they can be integrated into reinforcement learning framework to improve the learning performance. The method utilizes stored histories of possible optimal policies and constructs a specialized tree structure online in order to identify action sequences which are used frequently together with states that are visited during the execution of such sequences. The tree is then used to implicitly run corresponding options. Effectiveness of the method is demonstrated empirically.