Reinforcement Learning Algorithms for MDPs

• Author(s) / Creator(s)

  • Szepesvari, Csaba

• Technical report TR09-13. This article presents a survey of reinforcement learning algorithms for Markov Decision Processes (MDP). In the first half of the article, the problem of value estimation is considered. Here we start by describing the idea of bootstrapping and temporal difference learning. Next, we compare incremental and batch algorithmic variants and discuss the impact of the choice of the function approximation method on the success of learning. In the second half, we describe methods that target the problem of learning to control an MDP. Here online and active learning are discussed first, followed by a description of direct and actor-critic methods. | TRID-ID TR09-13

• Date created

  2009

• Subjects / Keywords

  • Stochastic approximation
  • Two-timescale stochastic approximation
  • Natural gradient
  • Overfitting
  • Bias-variance tradeoff
  • L:east-sqares methods
  • Online learning
  • Stimulation optimization
  • Reinforcement learning
  • Simulations
  • Markov decision processes
  • Artificial Intelligence
  • Function approximation
  • Temporal difference learning
  • Q-learning
  • Planning
  • Machine Learning
  • PAC-learning
  • Active learning
  • Policy gradient
  • Stochastic gradient methods
  • Monte-Carlo methods
  • Actor-critic methods

• Type of Item

  Report

• DOI

  https://doi.org/10.7939/R3SF2MK09

• License

  Attribution 3.0 International