Mathematical and Algorithmic Understanding of Reinforcement Learning

  • Sewak M
N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this chapter, we will discuss the Bellman EquationBellman Equationand the Markov Decision ProcessMarkov Decision ProcessMDP(MDPMDP), which are the basis for almost all the approaches that we will be discussing further. We will thereafter discuss some of the non-model-based approaches for Reinforcement Learning like Dynamic Programming. It is imperative to understand these concepts before going forward to discussing some advanced topics ahead. Finally, we will cover the algorithms like value iterationValue IterationDynamic Programmingand policy iterationPolicy IterationDynamic Programmingfor solving the MDP.

Cite

CITATION STYLE

APA

Sewak, M. (2019). Mathematical and Algorithmic Understanding of Reinforcement Learning. In Deep Reinforcement Learning (pp. 19–27). Springer Singapore. https://doi.org/10.1007/978-981-13-8285-7_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free