Skip to content

RSI: enforce hard cost and runtime bounds for adaptive search #6

Description

@w4ffl35

Implemented

PR #14 added opt-in adaptive-independent: it evaluates an independent initial cohort, can allocate one follow-up on mixed evidence, and records allocation and stop reasons. Tests cover trajectory, iteration, runtime-admission, and generation caps. #20 tracks a narrower controlled multi-generation demonstration.

Remaining scope

Enforce one hard total-cost admission ceiling across initial and follow-up trajectories. Apply a runtime bound to already admitted guest work without releasing a live lease before teardown. Keep the existing trajectory, iteration, and concurrency limits and test cost and runtime boundaries. Campaign restart safety is tracked in #19.

Acceptance criteria

  • A configured policy produces more than one independently evaluated trajectory when budget allows.
  • Selection records why additional compute was allocated or stopped.
  • The behavior is bounded by explicit cost, time, iteration, and concurrency limits.

Activity

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Metadata

Metadata

Assignees

No one assigned

    Labels

    enhancementNew feature or request

    Type

    No type

    Projects

    No projects

      Milestone

      No milestone

      Relationships

      None yet

      Development

      No branches or pull requests

      Issue actions