Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

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

Jump to bottom

Use of sum trees #5

Open
yk287 opened this issue Jan 7, 2021 · 0 comments
Open

Use of sum trees #5

yk287 opened this issue Jan 7, 2021 · 0 comments

Comments

@yk287
Copy link

yk287 commented Jan 7, 2021 •
edited

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!
@yk287 yk287 changed the title Use of binary trees Use of sum trees Jan 7, 2021
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@yk287