Planning in Markov Decision Processes with Gap-Dependent Sample Complexity - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2020

Planning in Markov Decision Processes with Gap-Dependent Sample Complexity

Résumé

We propose MDP-GapE, a new trajectory-based Monte-Carlo Tree Search algorithm for planning in a Markov Decision Process in which transitions have a finite support. We prove an upper bound on the number of calls to the generative models needed for MDP-GapE to identify a near-optimal action with high probability. This problem-dependent sample complexity result is expressed in terms of the sub-optimality gaps of the state-action pairs that are visited during exploration. Our experiments reveal that MDP-GapE is also effective in practice, in contrast with other algorithms with sample complexity guarantees in the fixed-confidence setting, that are mostly theoretical.
Fichier principal
Vignette du fichier
planning_hal.pdf (685.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02863486 , version 1 (10-06-2020)
hal-02863486 , version 2 (25-10-2020)

Identifiants

  • HAL Id : hal-02863486 , version 1

Citer

Anders Jonsson, Emilie Kaufmann, Pierre Ménard, Omar D Domingues, Edouard Leurent, et al.. Planning in Markov Decision Processes with Gap-Dependent Sample Complexity. 2020. ⟨hal-02863486v1⟩
188 Consultations
153 Téléchargements

Partager

Gmail Facebook X LinkedIn More