Repository navigation
Anytime search: deadlines for the coupled, memory-lift, targeted and universal searches - #51
Merged
Merged
Conversation
Co-authored-by: Cursor <cursoragent@cursor.com>
Autoplectic
pushed a commit
that referenced
this pull request
Nov 13, 2026
separating_optima has no deadline and dominated the 120 s wall-clock check on the Ubuntu CI runners (about 158 s under coverage), failing main since #51. Co-authored-by: Cursor <cursoragent@cursor.com>
2 tasks done
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.
Summary
Follow-up to #49. With
time_budgetset, the last unbudgeted search loops could still overrun by minutes. That is enough to hit the survey's hard timeout under parallel load. Each now takes adeadline(atime.monotonic()value) and returns a valid result when it stops:coupled_search: no new start after the deadline; the ε-machine seed always runs.memory_lift_search: no new start after the deadline (at least one runs).targeted_line_split_seeds: no new start or hop, and only the best decomposition is polished, once the deadline passes.universal_generative_optimizer: no larger state count once a generator is verified, and itscoupled_searchcalls get the same deadline.The pipeline gives them 50%, 20%, 80% and 60% of the remaining budget.
Trace on a 4-state survey case that used to hit the 1500 s hard timeout: with
time_budget=300it now returns at 331 s with bracket [1.406, 1.777] (budget_exhausted=True). The remaining overrun was a single coupled-search size that started just before the deadline; these deadlines stop that loop.Test plan
Made with Cursor