-
Notifications
You must be signed in to change notification settings - Fork 13
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
[Feature Request] Run to time limit for Neal and Greedy #27
Comments
Pau has implemented a smart runtime estimator that self-adjusts its convergence rate if necessary. It works pretty well, I believe, might want to ask him about it when he gets back. (Or maybe he has put it in github I dunno) |
If you wish to evaluate a criteria only after each complete anneal this feature already exists through the interrupt function:
For greater flexibility the code could be rewritten so that interrupt function takes sample information (in order to do things like time to energy/diversity criteria). Another possibility would be to evaluate the interrupt function before the anneal completes, but I think there wouldn't be many use cases for that. |
Would be useful to have a
time_limit
argument for Neal and Greedy.Both Neal (for a fixed
num_sweeps
) and Greedy can implement a run-to-time-limit feature by adding timing calls per read, i.e., variable number of reads depending on time constraint. Example from RandomSampler.The text was updated successfully, but these errors were encountered: