- Hands-On Q-Learning with Python
- Nazia Habib
- 274字
- 2021-06-24 15:13:12
Epsilon – exploration versus exploitation
Your agent's exploration rate epsilon also ranges from zero to one. As the agent explores its environment, it learns that some actions are better to take than others, but what about states and actions that it hasn't seen yet? We don't want it to get stuck on a local maximum, taking the same currently highest-valued actions over and over when there might be better actions it hasn't tried to take yet.
When you set your epsilon value, there will be a probability equal to epsilon that your agent will take a random (exploratory) action, and a probability equal to 1-epsilon that it will take the current highest Q-valued action for its current state. As we step through a full Q-table update example in the SARSA and the cliff-walking problem section, we'll see how the value that we choose for epsilon affects the rate at which the Q-table converges and the agent discovers the optimal solution.
As the agent gets more and more familiar with its environment, we want it to start sticking to the high-valued actions it's already discovered and do less exploration of the states it hasn't seen. We achieve this by having epsilon decay over time as the agent learns more about its environment and the Q-table converges on its final optimal values.
There are many different ways to decay epsilon, either by using a constant decay factor or basing the decay factor on some other internal variable. Ideally, we want the epsilon decay function to be directly based on the Q-values that we've already discovered. We'll discuss what this means in the next section.
- 繪制進程圖:可視化D++語言(第1冊)
- Microsoft Power BI Quick Start Guide
- 程序設計語言與編譯
- Visual Basic從初學到精通
- PostgreSQL Administration Essentials
- 基于多目標決策的數據挖掘方法評估與應用
- RPA(機器人流程自動化)快速入門:基于Blue Prism
- 運動控制器與交流伺服系統的調試和應用
- Deep Reinforcement Learning Hands-On
- C++程序設計基礎(上)
- 手機游戲策劃設計
- Mastering Exploratory Analysis with pandas
- 重估:人工智能與賦能社會
- Web璀璨:Silverlight應用技術完全指南
- 步步驚“芯”