You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hello, in the original PER paper I believe sum tree was used to speed up sampling, and I believe ERE also mentions using it in their PER implementation and PER + ERE implementation as well. It seems that your code uses simple np.random.choice to sample instead.
Have you tried implementing the tree data structure to see if that speeds up the code at all?
Thanks!
The text was updated successfully, but these errors were encountered:
yk287
changed the title
Use of binary trees
Use of sum trees
Jan 7, 2021
Hello, in the original PER paper I believe sum tree was used to speed up sampling, and I believe ERE also mentions using it in their PER implementation and PER + ERE implementation as well. It seems that your code uses simple np.random.choice to sample instead.
Have you tried implementing the tree data structure to see if that speeds up the code at all?
Thanks!
The text was updated successfully, but these errors were encountered: