- Python Reinforcement Learning
- Sudharsan Ravichandiran Sean Saito Rajalingappaa Shanmugamani Yang Wenzhuo
- 375字
- 2021-06-24 15:17:30
The Markov chain and Markov process
Before going into MDP, let us understand the Markov chain and Markov process, which form the foundation of MDP.
The Markov property states that the future depends only on the present and not on the past. The Markov chain is a probabilistic model that solely depends on the current state to predict the next state and not the previous states, that is, the future is conditionally independent of the past. The Markov chain strictly follows the Markov property.
For example, if we know that the current state is cloudy, we can predict that next state could be rainy. We came to this conclusion that the next state could be rainy only by considering the current state (cloudy) and not the past states, which might be sunny, windy, and so on. However, the Markov property does not hold true for all processes. For example, throwing a dice (the next state) has no dependency on the previous number, whatever showed up on the dice (the current state).
Moving from one state to another is called transition and its probability is called a transition probability. We can formulate the transition probabilities in the form of a table, as shown next, and it is called a Markov table. It shows, given the current state, what the probability of moving to the next state is:

We can also represent the Markov chain in the form a state diagram that shows the transition probability:

The preceding state diagram shows the probability of moving from one state to another. Still don't understand the Markov chain? Okay, let us talk.
Me: "What are you doing?"
You: "I'm reading about the Markov chain."
Me: "What is your plan after reading?"
You: "I'm going to sleep."
Me: "Are you sure you're going to sleep?"
You: "Probably. I'll watch TV if I'm not sleepy."
Me: "Cool; this is also a Markov chain."
You: "Eh?"
We can formulate our conversation into a Markov chain and draw a state diagram as follows:

The Markov chain lies in the core concept that the future depends only on the present and not on the past. A stochastic process is called a Markov process if it follows the Markov property.
- 數據庫應用實戰
- 數據可視化:從小白到數據工程師的成長之路
- Hands-On Machine Learning with Microsoft Excel 2019
- SQL Server 2012數據庫技術與應用(微課版)
- 云計算環境下的信息資源集成與服務
- Hadoop與大數據挖掘(第2版)
- 數據庫開發實踐案例
- MySQL從入門到精通(第3版)
- 數據庫程序員面試筆試真題庫
- MATLAB Graphics and Data Visualization Cookbook
- Proxmox VE超融合集群實踐真傳
- gnuplot Cookbook
- SQL Server 2012數據庫管理教程
- 數據庫應用系統開發實例
- Mastering LOB Development for Silverlight 5:A Case Study in Action