mirror of
https://github.com/gryf/coach.git
synced 2025-12-17 19:20:19 +01:00
coach v0.8.0
This commit is contained in:
19
docs/docs/algorithms/value_optimization/dueling_dqn.md
Normal file
19
docs/docs/algorithms/value_optimization/dueling_dqn.md
Normal file
@@ -0,0 +1,19 @@
|
||||
> Action space: Discrete
|
||||
|
||||
[Paper](https://arxiv.org/abs/1511.06581)
|
||||
|
||||
## Network Structure
|
||||
|
||||
<p style="text-align: center;">
|
||||
|
||||
<img src="..\..\design_imgs\dueling_dqn.png">
|
||||
|
||||
</p>
|
||||
|
||||
## General Description
|
||||
Dueling DQN presents a change in the network structure comparing to DQN.
|
||||
|
||||
Dueling DQN uses a speciallized _Dueling Q Head_ in order to seperate $ Q $ to an $ A $ (advantage) stream and a $ V $ stream. Adding this type of structure to the network head allows the network to better differentiate actions from one another, and significantly improves the learning.
|
||||
|
||||
In many states, the values of the diiferent actions are very similar, and it is less important which action to take.
|
||||
This is especially important in environments where there are many actions to choose from. In DQN, on each training iteration, for each of the states in the batch, we update the $Q$ values only for the specific actions taken in those states. This results in slower learning as we do not learn the $Q$ values for actions that were not taken yet. On dueling architecture, on the other hand, learning is faster - as we start learning the state-value even if only a single action has been taken at this state.
|
||||
Reference in New Issue
Block a user