lazovicff

Results 4 comments of lazovicff

The traditional way is to query all of testing data at once and calculate the accuracy, and do this every so often, lets say every 100 iterations...

Since the difference between these trees is just their leaves, we could use the same tree for fixed deposits, rewards, and variable deposits and expose different functions for each leaf...

What index exactly, we are passing a vec of leaves?