A Go library that implements a Sparse Merkle Trie for a key-value map.
-
Updated
Aug 22, 2024 - Go
#
sum-tree
Here are 8 public repositories matching this topic...
Implementation code when learning deep reinforcement learning
deep-reinforcement-learning pytorch dqn sarsa a3c reinforce deep-q-network per actor-critic proximal-policy-optimization ppo a2c prioritized-experience-replay sum-tree
-
Updated
Aug 17, 2023 - Python
Provide a fast (cpp-version) of Prioritized Experience Replay in Reinforcement Learning
-
Updated
Apr 15, 2020 - C++
Dynamically stores additive values and get arbitrary sub-range sums in O(log(n)) time.
-
Updated
Jun 14, 2020 - Swift
Efficient discrete random distribution for C++. The implementation uses array-based sum tree to allow fast sampling and updates of weighted events.
-
Updated
Dec 28, 2020 - C++
Implementation of project 1 for Udacity's Deep Reinforcement Learning Nanodegree
deep-reinforcement-learning pytorch deep-q-learning prioritized-experience-replay unity-environment sum-tree banana-collector-environment
-
Updated
Jul 22, 2023 - Jupyter Notebook
Sum tree data structure for stochastic priority sampling
-
Updated
Jun 23, 2019 - Python
A PHP implementation of a fixed-size binary sum tree
-
Updated
May 23, 2020 - PHP
Improve this page
Add a description, image, and links to the sum-tree topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the sum-tree topic, visit your repo's landing page and select "manage topics."