This PR implements a significant speed-up for the Mitchel's Best Candidate algorithm by not drawing new random samples after each node added. This requires that one always has many more candidates than nodes to be added. I twill also slightly reduce the "evenly spaced" result of the sample - but we're not really after that anyways?
Contributor checklist
[ ] :tada: This PR closes #377
[ ] :scroll: I have broken down my PR into the following tasks:
[ ] Task 1
[ ] Task 2
[ ] :robot: I have added tests, or extended existing tests, to cover any new features or bugs fixed in this PR.
[ ] :book: I have considered adding a new entry in CHANGELOG.md.
[ ] :books: I have considered updating the documentation.
wouterjdb
commented
3 years ago
This PR implements a significant speed-up for the Mitchel's Best Candidate algorithm by not drawing new random samples after each node added. This requires that one always has many more candidates than nodes to be added. I twill also slightly reduce the "evenly spaced" result of the sample - but we're not really after that anyways?
Contributor checklist
CHANGELOG.md.