Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletter Hub
Free Learning
Arrow right icon
timer SALE ENDS IN
0 Days
:
00 Hours
:
00 Minutes
:
00 Seconds
Arrow up icon
GO TO TOP
Python Deep Learning

You're reading from   Python Deep Learning Exploring deep learning techniques and neural network architectures with PyTorch, Keras, and TensorFlow

Arrow left icon
Product type Paperback
Published in Jan 2019
Publisher Packt
ISBN-13 9781789348460
Length 386 pages
Edition 2nd Edition
Languages
Tools
Arrow right icon
Authors (5):
Arrow left icon
 Vasilev Vasilev
Author Profile Icon Vasilev
Vasilev
Daniel Slater Daniel Slater
Author Profile Icon Daniel Slater
Daniel Slater
 Spacagna Spacagna
Author Profile Icon Spacagna
Spacagna
 Roelants Roelants
Author Profile Icon Roelants
Roelants
 Zocca Zocca
Author Profile Icon Zocca
Zocca
+1 more Show less
Arrow right icon
View More author details
Toc

Table of Contents (16) Chapters Close

Title Page
About Packt
Contributors
Preface
1. Machine Learning - an Introduction FREE CHAPTER 2. Neural Networks 3. Deep Learning Fundamentals 4. Computer Vision with Convolutional Networks 5. Advanced Computer Vision 6. Generating Images with GANs and VAEs 7. Recurrent Neural Networks and Language Models 8. Reinforcement Learning Theory 9. Deep Reinforcement Learning for Games 10. Deep Learning in Autonomous Vehicles 1. Other Books You May Enjoy Index

RL as a Markov decision process


Markov decision process (MDP) is a mathematical framework for modeling decisions. We can use it to describe the RL problem. We'll assume that we work with a full knowledge of the environment. An MDP provides a formal definition of the properties we defined in the previous section (and adds some new ones):

  •  
      is the finite set of all possible environment states, and st is the state at time t. 
  •   is the set of all possible actions, and at is the action at time t
  •   is the dynamics of the environment (also known as transition probabilities matrix). It defines the conditional probability of transitioning to a new state,s', given the existing state,s, and anaction,a (for all states and actions):

We have transition probabilities between the states, because MDP is stochastic (it includes randomness). These probabilities represent the model of the environment – that is, how it will likely change given its current state and an action,a. If the process were deterministic...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $15.99/month. Cancel anytime
Visually different images