Mechanism failed 2026

Resource-Driven Collective Attention Phase

Usefulness7/10
Difficulty5/10
Novelty7/10

Source paper: Emergent aggregation from collective foraging arXiv:2608.28046 · analyzed Sep 2, 2026

AI-generated research hypothesis, automatically tested. Not peer-reviewed.

Idea description

Train decentralized agents using only individual rewards for discovering replenishable targets, while their observations contain conspecifics but not target locations. Give the policy a tunable visual or attention radius and test whether aggregation and improved search emerge above the predicted crossover, without adding alignment, proximity, or group rewards. This creates a controllable collective phase that can reduce redundant exploration and improve multi-agent resource discovery.

Formulas

$$T_c(\lambda) \simeq \frac{b^2}{2D}\ln\!\left[\frac{\tau}{\lambda e^{-\ell/\lambda}}\right]$$
$$\lambda^* = \frac{\ell}{W\!\left(\frac{\ell e^K}{\tau}\right)}, \qquad K=\frac{\pi}{4r}\left(1-B\frac{r}{\tau}\right), \quad B\approx0.64$$
$$\mathcal{A}=\frac{1}{N}\sum_{i=1}^{N}\frac{1}{|\mathcal{N}_i|}\sum_{j\in\mathcal{N}_i}\mathbf{1}\{\|x_i-x_j\|<r_a\}$$
$$\Delta T(\lambda)=T_{\mathrm{ind}}(\lambda)-T_{\mathrm{collective}}(\lambda),\qquad \Delta T(\lambda^*)=0$$

Mathematical statement

Let ell be the reactive length associated with observing another agent and successfully exploiting the target it found, tau be the target depletion or replenishment time, b be the characteristic search-domain length, D be the diffusive coefficient, and lambda be the agents' detection radius. The collective strategy has mean first-passage time T_c approximately equal to (b^2/(2D)) log[tau/(lambda exp(-ell/lambda))], which grows logarithmically with tau. The crossover is predicted by equating collective and single-agent search times, yielding lambda* = ell/W(ell exp(K)/tau), where W is the Lambert W function, K = (pi/(4r))(1-Br/tau), r is the target or encounter length scale, and B is approximately 0.64. The transfer hypothesis is that the aggregation order parameter and collective-search advantage exhibit a crossover near lambda* as the policy's conspecific attention radius is varied.

Implementation notes

1. Integration point: build a decentralized multi-agent RL environment with N agents moving in a two-dimensional periodic domain containing replenishable targets. Each agent receives only its own target-capture reward; target positions are masked, while local conspecific positions, velocities, and recent actions are visible. Implement a radius-limited attention encoder, with radius lambda as the experimental control. 2. Pseudocode: for each agent i, form N_i = {j: ||x_j-x_i|| <= lambda}; encode the self state and neighbor tokens; sample a_i from pi_theta(.|o_i); add reward 1 only when agent i captures a target. Compute lambda* from the Lambert-W equation using measured tau, r, ell, and B=0.64, then train identical policies at lambda/lambda* in {0.25, 0.5, 0.75, 1, 1.5, 2, 4}. 3. Computed from the paper are the logarithmic collective MFPT, the Lambert-W crossover, and the prediction that collective search becomes favorable above lambda*. Estimated empirically are ell from the displacement between an observing agent and a target it subsequently captures, tau from replenishment intervals, and T_ind and T_collective from episode first-passage times. 4. First cheap experiment: compare the proposed model against the same architecture with randomized neighbor features and against a model with an explicit proximity reward. Use 8-32 agents and small grids before scaling. Measure capture rate, duplicate-search rate, aggregation A, and spatial correlation length. 5. Pre-register the signature: A must show a reproducible kink or steep crossover near lambda*, while mean capture time must become weakly dependent on tau in the collective regime. Fit log T against log tau below and above the transition; above it, the collective model predicts logarithmic rather than power-law growth. Reject the transfer if the aggregation midpoint differs from lambda* by more than 20% across seeds, if removing conspecific observations leaves the same transition, or if the individual-only policy never outperforms the collective policy below the predicted boundary.

Verification

Mechanism failed

Stage 1 · Toy mechanism gate: Failed ✗

Stage 2 · Mechanism transferred to benchmark: Not tested

Stage 2 · Practical benchmark result: Not run

Stage 1 — Mechanism check agent confidence 8/10

Built a decentralized hidden-target multi-agent toy simulator with radius-limited conspecific attention, individual capture rewards, replenishing targets, an independent baseline, and Lambert-W prediction checks. The analytic collective MFPT showed the claimed logarithmic dependence on tau to machine precision, and lambda* satisfied its defining equation, but the simulation showed no reproducible aggregation kink or capture advantage near lambda*: capture rate peaked weakly at 0.75–1.0 lambda* and matched the independent baseline overall.

Agent confidence
8/10
Baseline
capture rate 16.67 per 1000 steps, aggregation A 0.1208, duplicate fraction 0.00542
Idea
Across 0.25, 0.5, 0.75, 1, 1.5, 2, 4 lambda*: capture rates 15.00, 16.67, 18.33, 18.33, 16.67, 16.67, 16.67; aggregation A 0.1304, 0.1454, 0.1542, 0.1163, 0.1042, 0.1435, 0.1165

Limitations: This is a small 8-agent, 300-step toy simulation with two seeds, not trained RL; it uses transient motion cues as a simplified proxy for learned attention and does not estimate empirical ell, tau, or MFPT. The short horizon and sparse captures make the radius metrics noisy, so larger trained-policy experiments are needed to test transfer beyond this MVP.

How to run: python3 experiment.py

Verdict computed by deterministic test code from paired-seed statistics — not by the language model.

Artifacts

⬇ Download all as ZIP 3 files · code, reports and structured results