-
Notifications
You must be signed in to change notification settings - Fork 50
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.
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
Deterministic algorithm benchmark #567
Deterministic algorithm benchmark #567
Conversation
The main problem for having |
Correct, current algorithm interfaces is asking for an instance through the factory first, or it is just a string. Although, algorithm level |
Good point! I did not think if this at all. So maybe defining if an algorithm is deterministic in the object itself is slightly more complicated. Perhaps your solution is the simplest one. There is one issue however with supporting str and dict. We should support the dict in the form of |
@bouthilx we now support all the algorithms input format.
|
Alright! There is only few minor things left and then it is ready for merge. Thanks! |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
LGTM, thanks! :)
Why:
Some algorithm like
gridsearch
isdeterministic
when the space is defined, so it make no sense to same task multiple time for the average purpose.Fix:
For the input algorithms of benchmark,
get_or_create_benchmark(..., algorithms=[...], ...)
Instead of keeping it exactly the same as experiment input
algorithms=["random", {"gridsearch": {"n_values": 50}}]
We change it as below so when some algorithm is
deterministic
, putTrue
here.