Implementing The Asynchronous Successive Halving Algorithm (including experiment example)#160
Draft
AnushaChattoHeidelberg wants to merge 3 commits intoTUM-DAML:masterfrom
Draft
Implementing The Asynchronous Successive Halving Algorithm (including experiment example)#160AnushaChattoHeidelberg wants to merge 3 commits intoTUM-DAML:masterfrom
AnushaChattoHeidelberg wants to merge 3 commits intoTUM-DAML:masterfrom
Conversation
Here some more general info about the hyperparameter optimizer:
Example scriptTo get a feeling for how the algorithm works one can run the included experiment in
Results of another experiment done during development To sum up the current state, this is how the architecture currently operates: Things to do / open questions:
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.


What does this implement/fix?
Adds the ability to use The Asynchronous Successive Halving Algorithm
Using Random/ Grid search as initializers, one can run the ASHA algorithm for hyper parameter optimization
Additional information
from seml.utils import ashaexample experiment placed in folder asha_example