polsys / ennemi

Easy Nearest Neighbor Estimation of Mutual Information
https://polsys.github.io/ennemi/
MIT License
35 stars 12 forks source link

Parallelize the entropy estimation #45

Closed polsys closed 4 years ago

polsys commented 4 years ago

The basic case is really fast and needs no parallelism, but large-dimensional and conditional cases could benefit from parallelization. Consider extending the parallelism heuristic with a "performance score" tailored for each of these cases. Related to #22.

polsys commented 4 years ago

Closing this by making the estimation fast enough even without parallelism :smile: As entropy is a secondary feature, the feature is unnecessary. It should be quite easy to implement later if necessary.