idkmesh

Conversation record — executable ACO continuation

Date: 2026-08-28

Trigger

After adding the biology-inspired ACO stigmergic task-routing proposal, the project owner asked to continue.

Initial decision

Do not connect ACO directly to live GitHub task assignment. First convert the biological analogy into deterministic, falsifiable experiments with simple baselines and CI.

Phase 1 — fixed ACO implementation

Added:

Phase 2 — first synthetic result

A 40-seed reference comparison produced a mixed result:

strategy        utility/cost   duplicate   coverage   concentration
random             0.3997        0.2266      8.000       0.1391
greedy             1.1322        0.8333      1.000       1.0000
capability         0.8690        0.4281      4.825       0.3833
fixed ACO          0.5584        0.1551      8.000       0.1944

ACO reduced duplication and concentration and preserved full task coverage, but it did not beat capability-only or greedy routing on immediate utility per cost.

Decision: preserve the mixed result rather than tuning it away.

Results:

Phase 3 — parameter/Pareto sensitivity

Added sim/run_aco_parameter_sweep.py and tests.

A sweep of 24 ACO parameter configurations over 12 seeds produced 11 non-dominated Pareto points. The best-efficiency tested ACO point reached approximately:

utility/cost       0.6071
duplicate rate     0.1833
coverage           8/8
concentration      0.2108

The result confirmed a stable tradeoff rather than one universally best setting: stronger exploitation improved efficiency while consuming diversity/congestion margin.

Results:

Phase 4 — Homeostatic Stigmergic Routing

The mixed ACO evidence motivated a synthesis rather than blind parameter optimization.

Homeostatic Stigmergic Routing (HSR) combines:

  1. capability matching for exploitation;
  2. evidence-backed stigmergic memory;
  3. density-dependent negative feedback that increases diversity/congestion pressure only when crowding exceeds healthy targets.

Core form:

Score(a,j,t) = CapabilityValue(a,j)
               * tau_j(t)^alpha
               * [Diversity(a,j,t) * Congestion(j,t)]^lambda(t)

with feedback:

lambda(t+1) = clip(
    lambda(t)
    + k_d * (DuplicateRate(t) - D_target)
    + k_s * (Concentration(t) - S_target)
    - r * (lambda(t) - lambda_min),
    lambda_min,
    lambda_max
)

Added:

A 40-seed comparison produced:

strategy             utility/cost   duplicate   coverage   concentration
fixed ACO               0.5584        0.1551      8.000       0.1944
capability              0.8690        0.4281      4.825       0.3833
homeostatic hybrid      0.6754        0.2796      7.850       0.2515

HSR is a promising intermediate Pareto operating point, not a universal winner. It moves toward capability efficiency while retaining much lower duplication/concentration and near-full coverage.

Results:

Phase 5 — historical replay interface

Synthetic evidence is not enough for live use. The next gate is read-only historical/shadow replay.

Added:

The legitimate next dataset must freeze real source timestamps and annotation rules before evaluation.

Evidence ladder

The research must advance only through explicit stages:

  1. unit/mechanics tests — implemented and passing;
  2. repeated synthetic simulation — active; mixed results preserved;
  3. historical repository replay — interface implemented; real frozen dataset still required;
  4. advisory shadow mode — not authorized yet;
  5. bounded live experiment — not authorized yet.

A favorable synthetic result is not permission for autonomous production routing.

Safety / anti-Goodhart constraints

Current research conclusion

The most useful biological insight from this iteration is broader than Ant Colony Optimization itself:

Exploit strongly while capacity is healthy; when density, duplication, correlation, or reviewer pressure rises, increase negative feedback and diversify effort; relax the inhibition again when the system returns to a healthy region.

This principle may later apply to task routing, Growth Seed generation, verifier allocation, compute scheduling, experiment portfolios, and repository self-evolution, but each application requires its own evidence and safety gates.