A PAC Learning Algorithm for LTL and Omega-Regular Objectives in MDPs

Linear temporal logic (LTL) and omega-regular objectives---a superset of LTL---have seen recent use as a way to express non-Markovian objectives in reinforcement learning. We introduce a model-based probably approximately correct (PAC) learning algorithm for omega-regular objectives in Markov decision processes (MDPs). As part of the development of our algorithm, we introduce the epsilon-recurrence time: a measure of the speed at which a policy converges to the satisfaction of the omega-regular objective in the limit. We prove that our algorithm only requires a polynomial number of samples in the relevant parameters, and perform experiments which confirm our theory.

Authors

• Mateo Perez University of Colorado Boulder
• Fabio Somenzi University of Colorado Boulder
• Ashutosh Trivedi University of Colorado Boulder

Keywords

• General