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

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.

主站蜘蛛池模板: 泰和县| 土默特右旗| 交口县| 临泉县| 绩溪县| 巧家县| 军事| 南溪县| 乌兰浩特市| 吉隆县| 鸡西市| 田东县| 遂昌县| 丰都县| 梅河口市| 乌拉特中旗| 凉山| 武胜县| 昌平区| 将乐县| 安岳县| 芦溪县| 黔江区| 甘泉县| 伊宁县| 当涂县| 应城市| 凤翔县| 资阳市| 象州县| 濮阳市| 岳西县| 兴和县| 高尔夫| 石景山区| 通榆县| 云阳县| 保康县| 汝州市| 平遥县| 衡水市|