[Q] Scheduler constraints on score progress
- Dominant language
- Jupyter Notebook
- Stars
- 4.4k
- Forks
- 565
- Avg merge
- 5d 8m
- Merged PRs (30d)
- 17
Description
Do any of the flaml or ASHA schedulers make any assumptions about the score evolution curve across several iterations, e.g., regarding its monotoneity (or _monotonicity_, rather?)? I.e., does the score have to be ever increasing, or can it be decreasing as well for the early stopping algorithm to work properly?
I mean, one could adjust the design (or, rather the pre-/post-processing) of the scoring to respect this kind of constraint, e.g., by always accumulating to previous scores so that the score is always increasing from one iteration to the next (if the score for each iteration is positive), but I was curious whether or not this is required.
Contributor guide
No contributing guide indexed for this repository
Assessment
This issue has not been assessed yet.