We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Hi, thank you for your implementation, it helped me to wrote my own.
I have a question tho, about the action you used to compute gradients, in ddpg.py line 71.
Why don't you use action_batch to compute gradient ? I didn't manage to get any agent working so I can't test the difference.
The text was updated successfully, but these errors were encountered:
Because the formula for the DDPQ Algorithm 1 in the original paper says you compute gradients for
∇ a Q(s,a|θQ)|s=st, a=μ(st)
i.e. you want the actions generated by the current actor network for these gradients...I believe this is why it is a deterministic policy gradient.
Sorry, something went wrong.
Yes, I finally figured it out on my own but thanks for the confirmation :)
No branches or pull requests
Hi, thank you for your implementation, it helped me to wrote my own.
I have a question tho, about the action you used to compute gradients, in ddpg.py line 71.
Why don't you use action_batch to compute gradient ? I didn't manage to get any agent working so I can't test the difference.
The text was updated successfully, but these errors were encountered: