官术网_书友最值得收藏!

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.

主站蜘蛛池模板: 马鞍山市| 米泉市| 东方市| 永靖县| 烟台市| 贵定县| 崇明县| 辰溪县| 昆山市| 南木林县| 虞城县| 蓝田县| 山西省| 新乡市| 翼城县| 平潭县| 句容市| 罗田县| 竹山县| 蒙阴县| 广宁县| 边坝县| 监利县| 利辛县| 浦城县| 随州市| 绥滨县| 德惠市| 综艺| 乌兰察布市| 莲花县| 裕民县| 丰都县| 浠水县| 曲阳县| 类乌齐县| 沅陵县| 百色市| 日照市| 井陉县| 清新县|