𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

Algorithms for Reinforcement Learning

✍ Scribed by Csaba SzepesvÑri


Publisher
Springer
Year
2010
Tongue
English
Leaves
103
Series
Synthesis Lectures on Artificial Intelligence and Machine Learning
Edition
1
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


Reinforcement learning is a learning paradigm concerned with learning to control a system so as to maximize a numerical performance measure that expresses a long-term objective. What distinguishes reinforcement learning from supervised learning is that only partial feedback is given to the learner about the learner's predictions. Further, the predictions may have long term effects through influencing the future state of the controlled system. Thus, time plays a special role. The goal in reinforcement learning is to develop efficient learning algorithms, as well as to understand the algorithms' merits and limitations. Reinforcement learning is of great interest because of the large number of practical applications that it can be used to address, ranging from problems in artificial intelligence to operations research or control engineering. In this book, we focus on those algorithms of reinforcement learning that build on the powerful theory of dynamic programming. We give a fairly comprehensive catalog of learning problems, describe the core ideas, note a large number of state of the art algorithms, followed by the discussion of their theoretical properties and limitations. Table of Contents: Markov Decision Processes / Value Prediction Problems / Control / For Further Exploration

✦ Table of Contents


Cover
Copyright Page
Title Page
Contents
Preface
Acknowledgments
Markov Decision Processes
Preliminaries
Markov Decision Processes
Value functions
Dynamic programming algorithms for solving MDPs
Value Prediction Problems
Temporal difference learning in finite state spaces
Tabular TD(0)
Every-visit Monte-Carlo
TD(): Unifying Monte-Carlo and TD(0)
Algorithms for large state spaces
TD() with function approximation
Gradient temporal difference learning
Least-squares methods
The choice of the function space
Control
A catalog of learning problems
Closed-loop interactive learning
Online learning in bandits
Active learning in bandits
Active learning in Markov Decision Processes
Online learning in Markov Decision Processes
Direct methods
Q-learning in finite MDPs
Q-learning with function approximation
Actor-critic methods
Implementing a critic
Implementing an actor
For Further Exploration
Further reading
Applications
Software
The Theory of Discounted Markovian Decision Processes
Contractions and Banach's fixed-point theorem
Application to MDPs
Bibliography
Author’s Biography


πŸ“œ SIMILAR VOLUMES


Algorithms for Reinforcement Learning
✍ Csaba SzepesvΓ‘ri πŸ“‚ Library πŸ“… 2010 πŸ› Morgan & Claypool 🌐 English

Reinforcement learning is a learning paradigm concerned with learning to control a system so as to maximize a numerical performance measure that expresses a long-term objective.What distinguishes reinforcement learning from supervised learning is that only partial feedback is given to the learner

Reinforcement Learning Algorithms with P
✍ Andrea Lonza πŸ“‚ Library πŸ“… 2019 πŸ› Packt Publishing 🌐 English

Develop self-learning algorithms and agents using TensorFlow and other Python tools, frameworks, and libraries Key Features β€’ Learn, develop, and deploy advanced reinforcement learning algorithms to solve a variety of tasks β€’ Understand and develop model-free and model-based algorithms for buil

Reinforcement Learning Algorithms with P
✍ Andrea Lonza πŸ“‚ Library πŸ“… 2019 πŸ› Packt 🌐 English

With this book, you will understand the core concepts and techniques of reinforcement learning. You will take a hands-on approach with each RL algorithm and will develop your own self-learning algorithms and models. You will optimize the algorithms for better precision, use high-speed actions and lo