betaFeedback

WorksComputer Science

When Does Interaction Help? Toward a Reynolds Number for Collective Intelligence

Abstract

Multi-agent systems combine distributed information through interaction, which can improve performance but also spread errors or suppress useful differences. Predicting when interaction helps is central to understanding and designing collective intelligence. We investigate whether a few dimensionless parameters can predict gains over explicitly defined non-communicating baselines across group sizes, network structures, and tasks, toward a Reynolds-number-like description of collective intelligence. Using distributed classification tasks, stochastic tracking networks, and neural cellular automata, we combine analytical and empirical evidence to examine information sufficiency, dynamical applicability, and finite-sample prediction. We construct inference systems with bounded random variables and matching specified joint moments up to total degree three, yet opposite interaction gains under a fixed readout. These moments alone cannot generally determine the gain sign. Tracking networks likewise exhibit gain reversals despite matched candidate parameters when task power occupies different spectral modes. Under concentrated task spectra and aligned observation noise, however, we derive a low-dimensional similarity relation with an explicit zero-delay error bound and test it across network sizes and topologies under frozen protocols. The relation does not directly apply to the neural cellular systems, where a separate moment-based predictor underperforms direct gain measurement at matched calibration sample budgets. These results establish conditions and limits for low-dimensional gain prediction, providing a restricted similarity law while leaving a general Reynolds-number-like description of collective intelligence open.

Introduction

Local interaction can combine complementary evidence, suppress noise, or spread errors. Understanding when it improves collective performance requires more than counting agents or measuring connectivity. A compact predictive description would allow comparisons across network sizes, topologies, and task timescales without evaluating every configuration from scratch.

The search for a “Reynolds number for collective intelligence” expresses this ambition: independently meaningful dimensionless quantities might organize collective-performance curves across systems. The analogy concerns dynamical similarity, not a reduction in state dimension. In fluid mechanics, Reynolds-number similarity requires corresponding dimensionless geometry, initial and boundary conditions, and governing assumptions; equal Reynolds numbers alone do not imply equivalent behavior across arbitrary flows [1]. Likewise, we seek classes of collective systems whose performance can be organized by a few dimensionless parameters under explicit structural and task conditions.

Dimensional consistency alone does not guarantee predictive value. A compact description must retain task-relevant information, its prediction rule must apply to the system under study, and its parameters must be estimated accurately enough to support useful prediction. These requirements motivate our three questions: information sufficiency, dynamical applicability, and finite-sample prediction. Success at one level does not ensure success at the next.

Prior work on Renormalized Cellular Intelligence (RCI) [8] studies preservation of task-relative capability under model reduction. Here we ask when compact descriptors can predict interaction gains across conditions. Probe 3 in that study already demonstrates distribution-dependent gains at identical response descriptors and derives a lower bound on descriptor-only prediction error. We strengthen this obstruction with bounded systems whose specified joint raw moments through degree three match exactly, yet whose fixed-readout gains have opposite signs. A separate comparison establishes a Bayes-optimal gain separation despite the same specified moments.

The model classes provide complementary evidence. The bounded inference construction isolates information lost by specified descriptors. Linear tracking networks permit exact analysis of task spectra, timescales, and conditional similarity. Frozen neural cellular automata test prediction at matched calibration budgets and the applicability of the tracking assumptions. These models do not constitute a validated coarse-graining chain. Figure 1 summarizes the three questions and the complementary roles of the model classes.

Figure 1. Framework for assessing interaction-gain prediction: information sufficiency, conditional validity, and estimation value. The model classes provide complementary evidence. Direct estimation serves as a comparator at matched calibration sample counts. Solid arrows indicate prediction and comparison paths; dashed arrows indicate checks.

Our contributions are:

  1. Explicit identifiability obstructions. We construct bounded systems with identical specified joint moments through degree three but opposite fixed-readout gains, separately establish a Bayes-gain separation, and exhibit tracking systems with matched candidate descriptors and opposite gains.

  1. Conditional gain similarity and its boundaries. For a restricted tracking class, we specialize standard spectral and approximation tools to derive a low-dimensional gain curve with an explicit bandwidth error bound. Tests under frozen protocols include controls that violate the spectral assumptions and distinguish task-response similarity from delay-dependent internal stability.

  1. Finite-budget and applicability tests. Frozen transfer tests and comparisons with paired direct gain measurement distinguish population sufficiency, cross-task prediction, and estimation efficiency. Failures on the native cellular systems delimit the applicability of the tracking law and the usefulness of a separate moment-based predictor.

Our objective is a task-conditioned predictive law with testable assumptions. A universal control number, evidence of a phase transition in intelligence, and an effective reduction connecting the three model classes remain beyond the present results. We introduce the models and predictors in § 3, organize their evaluation around three questions in § 4, and discuss the implications in § 5.

Related Work

Collective scalability. Hamann and Reina [3] connect microscopic interactions and coordination overheads to collective scalability. Their work establishes a precedent for compact performance laws grounded in local mechanisms. We focus on the signed gain of a specified interaction relative to a declared null and ask whether proposed descriptors can distinguish systems whose gains differ.

Spectral performance and estimation. Xiao et al. [9] analyze steady-state mean-square deviation in noisy consensus. Perraudin and Vandergheynst [5] use graph-stationary signal models for Wiener-type estimation, while Routenberg [6] develops shared spectral responses across network sizes and unseen graphs. Delay-dependent spectral performance is studied by Ghaedsharaf et al. [2]. Our conditional similarity result builds on this established spectral perspective. Its specific object is a signed task-gain curve, with matched-descriptor counterexamples, an explicit task-band approximation, and a separate check of all-mode stability.

Statistical sufficiency and information restrictions. The elliptical sign-correlation identity [7] supplies a restricted sufficient description and serves here as a positive reference. Finite moments do not generally determine arbitrary distributional functionals. Our bounded construction makes this obstruction concrete for a distributed task with fixed information permissions, a declared decoder, and a locally optimal null. It separates decoder-specific gain from the gain achievable by a distribution-aware optimal decoder.

Cellular computation and model reuse. Neural cellular automata demonstrate how shared learned local rules can produce collective computation [4]. We reuse the inference probes, frozen co-reachability coefficients, and five localization checkpoints from the RCI study [8], together with its task-relative interaction/null comparison. The localization architecture includes absolute coordinates and a fixed global mean readout. Reusing these checkpoints permits a controlled test of predictor performance and applicability on the existing models; it does not provide a new independent population of learned systems.

Methods

We specify the task comparison, the information available to each predictor, and the assumptions under which an analytical description is valid. The shared notation makes comparisons explicit without imposing common dynamics or a common task on the three model classes.

Problem formulation and agent interfaces

An agent receives local observations oito_i^t, maintains state zitz_i^t, exchanges messages mitm_{i}^{t}, and produces a local output ritr_i^t:

mit=Agg⁡j∈N(i)Mji(zjt;α),zit+1=Fi(zit,oit,mit;α),rit=Ri(zit),y^t=D(r1t,…,rnt).(1)\begin{aligned} m_i^t &= \operatorname{Agg}_{j\in N(i)} M_{ji}(z_j^t;\alpha),\\ z_i^{t+1} &= F_i(z_i^t,o_i^t,m_i^t;\alpha),\\ r_i^t &= R_i(z_i^t),\qquad\hat{y}^t = D(r_1^t,\ldots,r_n^t). \tag*{(1)} \end{aligned}

The explicit dependence of FiF_i on intervention α\alpha permits interventions that also change self-state mixing. A continuous-time model uses the corresponding stochastic differential equation. This notation does not impose a shared state space, decoder, or task across models.

For a specified task and quality score, define

G=E[QI−QN],(2)G = \mathbb{E}[Q_I-Q_N], \tag*{(2)}

where II is the interacting system and NN its declared null. Positive GG means improvement over that null, not necessarily task adequacy or superiority to an independently optimized system. Classification uses correctness, tracking uses negative node-averaged squared error, and cellular localization uses a normalized distance score. Their numerical gains are not pooled.

Models, information access, and baselines

Distributed inference. The transfer experiments reuse the inference graph and role constructions identified in § 2; their task and observation rules are specified in Appendix § 7.§ 1. The exact construction studied here is a separate two-node decision problem: one node observes (U,W)(U,W) and another observes VV. It has a fixed terminal decoder and no intrinsic coordination timescale. It is a witness to an information restriction, not a miniature dynamical colony.

Linear tracking. On a symmetric connected graph with average-degree-normalized combinatorial Laplacian LL, the target xx has independent Ornstein–Uhlenbeck modes in the eigenbasis UU of LL:

dx=−ωx dt+2ω Udiag⁡(sk) dW,dyi=xi dt+2v/a dVi,dz=a(dy−z dt)−cLz dt,∑ksk=n.(3)\begin{aligned} dx &= -\omega x\,dt+\sqrt{2\omega}\,U\operatorname{diag}(\sqrt{s_k})\,dW,\\ dy_i &= x_i\,dt+\sqrt{2v/a}\,dV_i,\\ dz &= a(dy-z\,dt)-cLz\,dt,\qquad\sum_k s_k=n. \tag*{(3)} \end{aligned}

The target and observation-noise Brownian motions are independent. Each node estimates its own target component. The null uses the same observations and local response aa, with c=0c=0. Averaging node losses is an evaluation operation, not a global decoder. The graph-aligned target covariance, common response rate, and linear smoothing strategy are substantive assumptions. The null is not reoptimized for each task.

Neural cellular localization. The five reused checkpoints use a 32×3232\times32 open-boundary lattice, eight state channels, four-neighbor means, and 32 synchronous updates. The static local input contains a noisy masked signal, the mask, and absolute coordinates. With shared neural rule fθf_\theta,

hit=(1−λ)zit+λmean⁡j∈N(i)zjt,zit+1=(1−ηc)zit+ηcfθ(hit,oi),y^=n−1∑i(zi,1:22+1)/2.(4)\begin{aligned} h_i^t &= (1-\lambda)z_i^t+\lambda\operatorname{mean}_{j\in N(i)}z_j^t,\\ z_i^{t+1} &= (1-\eta_c)z_i^t+\eta_c f_\theta(h_i^t,o_i),\\ \hat{y} &= n^{-1}\sum_i(z_{i,1:2}^2+1)/2. \tag*{(4)} \end{aligned}

Here ηc=0.5\eta_c=0.5 is a state-update coefficient, not the tracking noise parameter. Targets and sensor noise remain fixed throughout an episode. The quality is Q=1−∥y^−y∥/2Q=1-\lVert\hat{y}-y\rVert/\sqrt{2}. The comparison switches λ=0.5\lambda=0.5 to zero while preserving weights, input, and global mean readout. It removes neighbor mixing while changing the self-state coefficient. Thus it measures this architectural intervention, not a pure information-only intervention or superiority over the best independent learner.

Prediction rules and information budgets

Let BB denote the number of target-condition calibration examples. For paired observations indexed by ℓ\ell, the direct reference is

G^direct=B−1∑ℓ=1B(QIℓ−QNℓ).(5)\widehat{G}_{\mathrm{direct}}=B^{-1}\sum_{\ell=1}^{B}(Q_{I\ell}-Q_{N\ell}). \tag*{(5)}

This estimator uses task labels and both system outputs. Matching BB equates target-condition sample counts; it does not equate extra offline training, access to generating parameters, or computation. Table 1 summarizes the comparison objects. Structural and task-reliability descriptors. For the factorized inference network, K=γTPTK=\gamma^{T}P^{T} is the finite-horizon propagation matrix, where PP is the propagation matrix, γ\gamma is the memory factor, and TT is the update horizon; the superscript TT denotes a power, not a transpose. The parameter σ\sigma is the readout-noise standard deviation. For binary role vector bb, set sa=K(1−b)s_a=K(1-b), sb=Kbs_b=Kb and va=K∘2(1−b)+σ21v_a=K^{\circ2}(1-b)+\sigma^2\mathbf{1}, vb=K∘2b+σ21v_b=K^{\circ2}b+\sigma^2\mathbf{1}, where K∘2K^{\circ2} is the elementwise square. Define uai=sai/vaiu_{ai}=s_{ai}/\sqrt{v_{ai}}, ubi=sbi/vbiu_{bi}=s_{bi}/\sqrt{v_{bi}}, and wi=min⁡(uai,ubi)w_i=\min(u_{ai},u_{bi}). Co-reachability uses

PredictorInputs and mappingInformation and fitting
Co-reachabilityStructural (CC, HcH_c, BcB_c) and a fixed polynomialGraph/propagation quantities; previously fitted coefficients, kept fixed
Task reliabilityChannel sign reliabilities; 12mean⁡i(rairbi)\frac{1}{2}\operatorname{mean}_i(r_{ai}r_{bi}) or a fitted polynomialCalibration component labels; fitted variant uses Gaussian training runs
Margin3Margin correlations, dispersion and bias; βTϕ\beta^{\mathsf{T}}\phiBoth labeled arms; separate ridge fit for each budget, frozen after Gaussian-sum training
Elliptical plug-inTwo Pearson correlations in the arcsin formulaBoth labeled arms; no fitted gain map
Tracking ratio / compactReference curve / collapsed nonzero-mode spectrumKnown generating parameters; reference task-class information or six scalars
Conditional similarityF(R,η,b)F(R,\eta,b) and task-band error boundKnown parameters and aligned-noise assumptions; no label fitting
Cellular Gaussian residualMean and covariance per residual arm; expected norm differenceTen estimated parameters from paired labeled outputs; no learned gain map
DirectPaired sample-average quality differenceSame target-condition examples where budgets match

Table 1. Prediction rules and information permissions. Different rows are evaluated on their respective tasks, not pooled into a single leaderboard.

C=mean⁡iwi1+wi,Hc=sd⁡iwi1+wi,C=\operatorname{mean}_i\frac{w_i}{1+w_i},\qquad H_c=\operatorname{sd}_i\frac{w_i}{1+w_i},
Bc=mean⁡i∣uai−ubi∣1+uai+ubi.B_c=\operatorname{mean}_i\frac{\lvert u_{ai}-u_{bi}\rvert}{1+u_{ai}+u_{bi}}.

The co-reachability predictor applies a frozen linear combination of (C,C2,C3,CHc,CBc,CHcBc)(C,C^2,C^3,CH_c,CB_c,CH_cB_c), clipped to [0,1/2][0,1/2]. The original frozen coefficients and their feature order are given in Appendix § 7.§ 2.

Task reliabilities are rai=mean⁡ℓ[sign⁡(oaiℓ)sign⁡(zaℓ)]r_{ai}=\operatorname{mean}_{\ell}[\operatorname{sign}(o_{ai\ell})\operatorname{sign}(z_{a\ell})], and analogously for channel bb. The analytic factorized reference uses 12mean⁡i(rairbi)\frac{1}{2}\operatorname{mean}_i(r_{ai}r_{bi}). The fitted task3 variant instead summarizes the mean and standard deviation of rairbir_{ai}r_{bi} and the mean absolute difference of channel reliability magnitudes, applies the same six-term feature pattern, and uses ridge penalty 0.010.01 with Gaussian training data. Its outputs in the factorized study are clipped to [−1/2,1/2][-1/2,1/2]. It receives component labels unavailable to structural descriptors.

Margin3. For task margin XX and nodewise interaction/null margins Ii,NiI_i,N_i, estimate correlations ρ^XIi,ρ^XNi\hat{\rho}_{XI_i},\hat{\rho}_{XN_i} from the same BB calibration examples and define

gi=[arcsin⁡ρ^XIi−arcsin⁡ρ^XNi]/π,g_i=\left[\arcsin\hat{\rho}_{XI_i}-\arcsin\hat{\rho}_{XN_i}\right]/\pi,
D=mean⁡igi,H=sd⁡igi,D=\operatorname{mean}_i g_i,\qquad H=\operatorname{sd}_i g_i,
J=mean⁡i(∣Iˉi∣sIi−∣Nˉi∣sNi).(6)J=\operatorname{mean}_i\left(\frac{\lvert\bar{I}_i\rvert}{s_{I_i}}-\frac{\lvert\bar{N}_i\rvert}{s_{N_i}}\right). \tag*{(6)}

Here bars denote calibration-sample means, and sIi,sNis_{I_i},s_{N_i} are calibration-sample standard deviations computed with divisor BB. Then ϕ=(D,D2,D3,DH,DJ,DHT)\phi=(D,D^2,D^3,DH,DJ,DH^{T}) and G^margin3=clip⁡[−1,1](βTϕ)\hat{G}_{\mathrm{margin3}}=\operatorname{clip}_{[-1,1]}(\beta^{T}\phi). For each budget, β=(ΦTΦ+0.01I)−1ΦTgtrain\beta=(\Phi^{T}\Phi+0.01I)^{-1}\Phi^{T}g_{\mathrm{train}} is fitted only on Gaussian-sum training runs, then frozen. The rows of Φ\Phi are the training feature vectors ϕT\phi^{T}, and gtraing_{\mathrm{train}} contains the corresponding evaluation-sample gains. Here JJ renames the code’s bias descriptor to avoid confusing it with sample budget BB. Correlations are clipped to ±0.999999\pm0.999999; zero-variance correlations and standardized output means are assigned zero according to the fixed implementation. Task margins and arm-specific normalization are detailed in Appendix § 7.§ 1.

Cellular residual approximation. Let ea=y^a−ye_a=\hat{y}_a-y for arm a∈{I,N}a\in\{I,N\}. Estimate its two-dimensional mean μ^a\hat{\mu}_a and covariance Σ^a\hat{\Sigma}_a using divisor BB. This gives five parameters per arm. With

L(μ,Σ)=Eξ∼N(0,I2)∥μ+Σ1/2ξ∥,\mathcal{L}(\mu,\Sigma)=\mathbb{E}_{\xi\sim\mathcal{N}(0,I_2)}\lVert\mu+\Sigma^{1/2}\xi\rVert,

the prediction is

G^residual=clip⁡[−1,1](L(μ^N,Σ^N)−L(μ^I,Σ^I)2).\hat{G}_{\mathrm{residual}}=\operatorname{clip}_{[-1,1]}\left(\frac{\mathcal{L}(\hat{\mu}_N,\hat{\Sigma}_N)-\mathcal{L}(\hat{\mu}_I,\hat{\Sigma}_I)}{\sqrt{2}}\right).

The expectation uses fixed 40×4040\times40 Gauss–Hermite quadrature, with an 80×8080\times80 sensitivity calculation. Negative numerical covariance eigenvalues are truncated at zero. There is no learned gain mapping; the Gaussian approximation to the residual distribution is being tested.

Centered classification diagnostic. This separate diagnostic concerns the centered elliptical sign formula, not the Gaussian residual norm approximation. For uj=(cos⁡(jπ/4),sin⁡(jπ/4))u_j=(\cos(j\pi/4),\sin(j\pi/4)), j=0,1,2,3j=0,1,2,3, define task margin Xj=ujT(y−121)X_j=u_j^{\mathsf T}(y-\frac{1}{2}\mathbf{1}) and output margin Maj=ujT(y^a−121)M_{aj}=u_j^{\mathsf T}(\hat{y}_a-\frac{1}{2}\mathbf{1}) for arm a∈{I,N}a\in\{I,N\}. On 2048 evaluation episodes per condition, a two-sided exact binomial test checks P(Maj≥0)=1/2\mathbb{P}(M_{aj}\ge0)=1/2. Holm correction at familywise level 0.05 covers all 20×4×2=16020\times4\times2=160 tests. Sign balance is necessary for centered continuous elliptical margins; nonrejection does not establish their joint ellipticity. Rejection does not rule out a noncentered Gaussian residual model, whose mean is estimated rather than fixed at zero.

Identifiability of moment descriptions

Let U,SU,S be independent uniform signs, let WW independently take the values ±1/2\pm1/2 with equal probability, and define X=USX=US. The receiver observes (U,W)(U,W) and the sender observes V=SAV=SA, with AA independent. In world ++,

P(A=1/4)=4/5,P(A=−1)=1/5;\mathbb{P}(A=1/4)=4/5,\qquad\mathbb{P}(A=-1)=1/5;

world −- reverses the sign of AA. Communication produces margin I=UV=XAI=UV=XA, whereas the null uses N=UWN=UW. Both use the same multiplication rule and sign decision.

Proposition 1. For Z=(X,I,N,U,V,W)Z=(X,I,N,U,V,W), all joint raw moments of total degree at most three match between the two worlds. Their fixed-readout gains are +0.3+0.3 and −0.3-0.3. Any predictor restricted to those population moments and the common structural information has worst-case absolute error at least 0.3.

Proof. Both amplitude laws have EA=0\mathbb{E}A=0 and EA2=1/4\mathbb{E}A^2=1/4. In a monomial of degree at most three, the exponent of AA is the combined exponent of I,VI,V. Exponents zero, one, and two depend only on identical quantities. Exponent three requires three I/VI/V factors and hence an odd independent sign SS, giving expectation zero. The receiver’s local observations and the sender’s observation each leave XX uniform, so each local Bayes accuracy is 1/21/2. The interacting fixed decoder is correct exactly when A>0A>0, giving accuracies 4/54/5 and 1/51/5. A common prediction cannot be closer than half their gain separation to both.

All variables are bounded by one and relevant margins are separated from zero. The complete unlabeled observation law of (U,V,W)(U,V,W) also matches; the labeled joint laws do not.

The endpoints alone do not establish a difference in optimal collective capability: their amplitudes allow a distribution-aware decoder to recover the task perfectly. Mixing the two amplitude laws with weight θ\theta instead gives fixed gain 0.6θ−0.30.6\theta-0.3 and Bayes gain ∣θ−1/2∣\lvert\theta-1/2\rvert. The mixtures θ=1/2\theta=1/2 and 11 retain the same specified moments and unlabeled observations, but Bayes gains are zero and 1/21/2. The corresponding worst-case error lower bound is 1/41/4. These are distinct statements about fixed and optimal decoders.

The bound concerns the specified population information. It does not cover arbitrary sample statistics whose sampling distributions can contain higher-order information. The fixed-amplitude special case does not admit this obstruction: for sign-valued XX, II, accuracy is already (1+EXI)/2(1+\mathbb{E}XI)/2. This sufficient special case limits the scope of the obstruction.

Restricted distributional sufficiency

When the actual margins (X,I,N)(X,I,N) have a jointly centered elliptical distribution, with nonzero finite variances and no mass on decision boundaries, the established quadrant identity [7] gives

G=arcsin⁡ρXI−arcsin⁡ρXNπ.(7)G=\frac{\arcsin\rho_{XI}-\arcsin\rho_{XN}}{\pi}. \tag*{(7)}

Positive radial scaling preserves signs, explaining why the formula extends beyond Gaussian distributions. The assumption concerns the actual decision margins, not merely Gaussian inputs before nonlinear transformations. For nodewise scores, one averages nodewise expressions; generally two network-averaged correlations are insufficient. The evaluated Pearson plug-in substitutes sample correlations for the population correlations, clipping them to [−1,1][-1,1]. It does not fit an additional response curve. Population sufficiency therefore leaves a separate finite-sample estimation question.

Dimensionless tracking predictors

Order the Laplacian eigenvalues as 0=λ1<λ2≤⋯≤λn0=\lambda_1<\lambda_2\le\cdots\le\lambda_n. For the tracking model, using dimensionless time u=atu=at yields

Π=cλ2ω,R=ωa,η=ν,dk(2)=λk/λ2,\Pi=\frac{c\lambda_2}{\omega},\qquad R=\frac{\omega}{a},\qquad\eta=\nu,\qquad d_k^{(2)}=\lambda_k/\lambda_2,

with modal response Hk=1+ΠRdk(2)H_k=1+\Pi R d_k^{(2)}. Stationary second-moment equations give

Ek(H)=sk[1+1−2HH(H+R)]+ηH,E_k(H)=s_k\left[1+\frac{1-2H}{H(H+R)}\right]+\frac{\eta}{H},
G=1n∑k{Ek(1)−Ek(Hk)}.(8)G=\frac{1}{n}\sum_k\{E_k(1)-E_k(H_k)\}. \tag*{(8)}

The ratio Π\Pi cannot eliminate task spectrum sks_k, graph spectrum dk(2)d_k^{(2)}, response ratio RR, or noise strength. In particular, the communication relaxation time is not an end-to-end task completion time.

Reference and compact predictors. The ratio predictor evaluates the exact formula on an eight-node ring with R=1R=1 and η=0.2\eta=0.2, varying only Π\Pi. Common and white tasks use their own reference spectra; Fiedler and high-frequency tasks use the white-task reference. The predictor therefore receives task-class information in addition to Π\Pi.

The compact predictor receives (Π,R,η,n,s1,dˉ)(\Pi, R, \eta, n, s_1, \bar{d}), where dˉ=(n−1)−1∑k=2ndk(2)\bar{d} = (n-1)^{-1}\sum_{k=2}^{n}d_k^{(2)}. It retains the zero mode and replaces every nonzero mode by

s~k=(n−s1)/(n−1),H~k=1+ΠRdˉ(k>1).\tilde{s}_k = (n-s_1)/(n-1), \qquad\tilde{H}_k = 1+\Pi R\bar{d}\quad(k>1).

Substituting (s~k,H~k)(\tilde{s}_k,\tilde{H}_k) in the exact modal sum defines its prediction. The full-spectrum reference keeps all (sk,dk(2))(s_k,d_k^{(2)}); its dimension grows with nn. These mechanism-based predictors know generating parameters and are not equal-information-budget alternatives to sample-only direct calibration.

Conditional similarity and gain reversal

For the conditional similarity analysis, replace spatially white observation noise by noise aligned with the task spectrum. Let pk=sk/np_k=s_k/n, λ∗=∑pkλk>0\lambda_*=\sum p_k\lambda_k>0, δk=λk/λ∗\delta_k=\lambda_k/\lambda_*, and b=cλ∗/ab=c\lambda_*/a. All task modes share OU rate RR. In dimensionless time u=atu=at, each modal estimator obeys

dzk=[xk−(1+bδk)zk]du+2ηsk dVk.dz_k = [x_k-(1+b\delta_k)z_k]du+\sqrt{2\eta s_k}\,dV_k.

Thus the modal noise intensity is exactly 2ηsk2\eta s_k, with node-averaged intensity 2η2\eta because ∑ksk=n\sum_k s_k=n. The parameter η\eta is half this average intensity. The null sets b=0b=0 with the same input processes. This differs from the white-noise model above. Here δk=λk/λ∗\delta_k=\lambda_k/\lambda_* replaces dk(2)=λk/λ2d_k^{(2)}=\lambda_k/\lambda_2; the two normalizations are not interchangeable. With t=b/(1+b)t=b/(1+b) define

F(R,η,b)=ηt−11+R+1−t21+R−Rt.(9)F(R,\eta,b)=\eta t-\frac{1}{1+R}+\frac{1-t^2}{1+R-Rt}. \tag*{(9)}

If vd=∑pk(δk−1)2v_d=\sum p_k(\delta_k-1)^2, Taylor expansion of the exact modal sum cancels the first-order term and gives

∣G−F∣≤(3+2R+η)b2vd.(10)|G-F|\le(3+2R+\eta)b^2v_d. \tag*{(10)}

Appendix § 7.§ 4 derives this global bound and the tighter support-dependent bound used in the experiments. For two systems satisfying the stated assumptions and matching (R,η,b)(R,\eta,b), their gains differ by at most the sum of their respective error bounds. This establishes conditional similarity, not universal curve collapse.

The nonzero root of the predicted curve, when η(1+R)<1\eta(1+R)<1, is

b∗=R+η(1+R)21−η(1+R).b_*=\frac{R+\eta(1+R)^2}{1-\eta(1+R)}.

Otherwise there is no finite positive root. This is a reversal caused by excessive smoothing, not the onset of intelligence: predicted gain is already positive at small positive coupling.

Delay and internal stability

The delayed controller applies delay to the full relative-state term Lz(t−τ)Lz(t-\tau), including cached self-state. For θ=aτ\theta=a\tau and modal coupling q=bδk≥0q=b\delta_k\ge0, each mode has characteristic equation s+1+qe−sθ=0s+1+qe^{-s\theta}=0. If q>1q>1, its critical delay is

θc(q)=arccos⁡(−1/q)q2−1;\theta_c(q)=\frac{\arccos(-1/q)}{\sqrt{q^2-1}};

for q≤1q\le1 every finite delay is stable. Internal network stability depends on qmax⁡=bλmax⁡/λ∗q_{\max}=b\lambda_{\max}/\lambda_*.

Applicability checks for native systems

Direct use of the tracking similarity law requires all of the following: a mapping to the declared scalar linear controller and its time parameters; the same nodewise squared-error task; a nonzero task spectral mean λ∗\lambda_*; the specified task–noise spectral alignment; and the assumed temporal covariance structure. A failed structural requirement results in an undefined prediction (NA), not a fitted surrogate parameter. No gain threshold is used to decide applicability.

The checks use the environment definition, architecture, and calibration inputs before examining new evaluation gains. Spectral summaries of the input field are diagnostics only, not replacements for the localization label. A scalar parameter is not inferred from a nonlinear Jacobian merely to make the mapping possible. The test concerns this direct transfer of the law, not every possible future effective representation.

Experiments

The evaluation asks three questions: can the descriptors distinguish different gains, under what conditions does a compact law hold, and is the description applicable and useful at a finite calibration budget? Each question uses the model suited to it. Gains and RMSEs are compared within tasks, not pooled across their different loss functions.

Common evaluation protocol. Predictions are evaluated on held-out conditions under the archived study-specific freezes. “Frozen” refers to those local protocols, not a single preregistration of the entire research sequence. The sequence was adaptive; its chronology is disclosed in Appendix § 7.§ 6. Direct calibration estimates the paired mean of QI−QNQ_I-Q_N on target-condition samples. Where sample budgets match, descriptors and direct measurement receive the same calibration examples; extra offline training is disclosed. Known-parameter spectral predictions are not described as equal-information-cost competitors to sample-only direct measurement.

Historical analyses used positive-gain thresholds such as 0.02. We retain their records but center the present argument on continuous gain errors, exact separations, and assumption-dependent bounds. No universal numerical onset threshold is inferred.

Q1: Can the descriptors distinguish interaction gains?

This question separates empirical transfer failure from exact nonidentifiability. The transfer tests evaluate fixed prediction rules; the bounded and spectral constructions isolate pairs that share specified descriptor values.

Frozen transfer across distributions and tasks. The factorized transfer test uses 432 Gaussian training runs and evaluates 1440 runs across Gaussian, binary-latent, binary-observation, and channel-separated nonlinear families. Structural descriptors were insensitive to experimentally varied task alignment. Nevertheless, the frozen co-reachability predictor retained RMSE 0.00352 on the aligned Gaussian subset, compared with 0.10760 for binary latent variables and 0.09443 for binary observations. These results confirm the original predictor’s within-family accuracy while exposing its distributional limits.

Task-supervised channel reliabilities improved prediction. However, independent channels and a parity readout imply the elementary identity G=12mean⁡i(rairbi)G = \frac{1}{2}\operatorname{mean}_{i}(r_{ai}r_{bi}). Its success is explained by the factorized task, not arbitrary cross-task universality. The initial equal-budget direct comparison was added post hoc.

The nonseparable-task test trains the margin3 predictor defined in § 3.3 on linear-sum tasks and evaluates previously unseen radial and mixed tasks. At 512 calibration samples, RMSE of four-repeat condition means was 0.06238, versus 0.00600 for direct measurement. For independent Gaussian inputs alone the corresponding errors were 0.02575 and 0.00638, so the failure did not depend entirely on heavy tails. Single-run aggregate errors were 0.06558 and 0.01316: the condition-mean errors therefore do not represent single-run deployment precision. The descriptor additionally consumed offline training data. These experiments reject this predictor’s transfer claim, not all low-dimensional representations.

Exact collision and numerical verification. Rational arithmetic checks all 84 monomials including the constant. Across six mixture weights and 32 simulation repeats, the maximum absolute deviation of the mean gain from its exact value is approximately 0.00100.

Figure 2 contrasts fixed-readout and optimal gains. The sampled curves check implementation; the lower bounds follow from the exact construction in Methods.

Figure 2. Bounded moment-matching construction. Fixed-readout gain and distribution-aware optimal gain are different quantities. Matching population moments obstructs prediction even when fitting capacity is unrestricted. Numerical sampling checks the construction rather than proving the lower bound. The curves are analytical: Gfixed=0.6θ−0.3G_{\mathrm{fixed}} = 0.6\theta- 0.3 and GBayes=∣θ−1/2∣G_{\mathrm{Bayes}} = \lvert\theta- 1/2\rvert.

Matched spectral descriptors. The tracking test evaluates 585 conditions with four seeds, across sizes 8, 16, and 32, ring/path/star/complete graphs, task speeds, and coupling levels. Ten reference conditions defined a frozen ratio curve; 575 were held out. Held-out RMSE was 0.149213 for the ratio curve, 0.118731 for a six-scalar approximation, and 0.019663 for the 256-sample direct reference. The full-spectrum formula has zero error against its own analytic target, which is not independent validation; comparison against independent covariance sampling gives RMSE 0.002354.

A sharper obstruction holds on a 16-node ring. Two tasks match (Π,R,η,n,s1,d)(\Pi,R,\eta,n,s_1,d) and every node’s temporal target marginal, but place task power in low versus high spatial modes. Exact gains are +0.180123 and −0.225757, imposing worst-case error at least 0.202940 for those descriptors. An additional no-sharing null retaining local degree-induced decay gives gains +0.288556 and −0.117324. Thus the sign separation is not explained solely by the change in local decay. It remains specific to a fixed smoothing strategy; optimal communication could ignore unhelpful messages.

Q2: Under what conditions does a compact law hold?

The positive reference classes test whether structural assumptions can restore prediction, while controls identify the information those assumptions supply. Numerical agreement within a constructed class is not evidence of unconditional universality.

Elliptical reference design. We use ρXI∈{−0.6,0,0.6}\rho_X I \in\{-0.6,0,0.6\} and ρXN∈{−0.3,0,0.3}\rho_{XN} \in\{-0.3,0,0.3\}, with eight repeats per pair and family. Starting with independent standard Gaussian coordinates g0,g1,g2g_0,g_1,g_2, margins are X=g0X=g_0, I=ρXIg0+1−ρX2g1I=\rho_X I g_0+\sqrt{1-\rho_X^2}g_1, and analogously NN using g2g_2. The bounded family first scales gg by 3/∥g∥\sqrt{3}/\lVert g\rVert; the common-radial t3t_3 family scales it by an independent 1/χ321/\sqrt{\chi^2_3}. These preserve the sign relation. Each of the 216 runs across the three families uses 512 calibration observations and 32768 separate evaluation observations; a 64-example prefix provides a prespecified sensitivity check at a smaller budget. The exact arcsin gain is the reference for estimation RMSE. Finite-budget results are reported under Q3.

Matched tracking systems. The conditional-law test uses second-neighbor circulant rings, comb graphs, and three-clique modular graphs with bridge weight 0.15, at sizes 18, 36, and 72. Two task-band locations per graph size select the three nearest positive modes around the 0.25 and 0.65 quantile indices, with equal power, giving 18 systems. We fix R∈{0.3,2}R \in\{0.3,2\}, η∈{0.1,0.5}\eta\in\{0.1,0.5\} and b∈{0.05,0.1,0.2,0.4,0.8,1.6,3.2,6.4}b \in\{0.05,0.1,0.2,0.4,0.8,1.6,3.2,6.4\}. Each task spectrum remains fixed along its coupling curve.

The narrow-band condition aligns modal noise with task power. A broad-spectrum control places power at zero and maximum eigenvalues while preserving λ∗\lambda_* and total power; a white-noise control preserves the task and total noise power but removes spectral alignment. Matching (R,η,b)(R,\eta,b) therefore isolates the assumptions omitted by those controls. No empirical precision threshold defines curve collapse: we report prediction error, within-group spans, and the analytical error bound.

Curve-collapse results. Figure 3 shows the matched gain curves. Across 18 constructed systems from three graph families and sizes 18/36/72, the 576 narrow-band aligned zero-delay conditions yield RMSE 0.0002791 and maximum error 0.002132. Seven systems have degenerate equal-eigenvalue task bands; on the remaining 11 systems RMSE is 0.0003570. Task rank remains three as size changes.

Across the 32 zero-delay narrow-band groups matching (R,η,b)(R,\eta,b), each containing 18 systems, the median gain span is 0.000419496 and the maximum is 0.002131674. The archived bound checks report no violations in either the 576 narrow-band or the 576 broad-spectrum aligned zero-delay conditions, allowing for recorded numerical error. These checks use the support-dependent bound B0B_0 in Eq. (12), rather than only the global bound displayed in the main text. Its median is 0.0000221453 in the narrow-band class and 0.351508 in the broad-spectrum control: validity alone does not ensure a sharp prediction. The exact records are studies/round10/results/collapse_spans.csv and studies/round10/results/metrics.csv; Appendix § 7.§ 4 gives the support-dependent derivation used by these records. Broad-spectrum and spatially white-noise controls yield RMSE 0.073970 and 0.029597, respectively, and retain sign disagreements. The broad-spectrum control weakens the narrow-band approximation but remains within the aligned-noise bandwidth bound; the white-noise control violates the alignment assumption, so that bound does not apply unchanged.

Delay stress test. The delay grid is θ∈{0,0.02,0.1,0.3,0.8}\theta\in\{0, 0.02, 0.1, 0.3, 0.8\}, applied to all three spectral mechanisms, for 8640 numerical records. Stability is checked before stationary gain is computed. Zero-delay gains are checked against modal Lyapunov equations; stable delayed gains use the archived frequency-domain calculation. Systems beyond the exact stability boundary remain marked unstable. The frozen grid contains 32 groups sharing (R,η,b,θ)(R,\eta,b,\theta) with both stable and unstable members. Task-response similarity therefore cannot replace an all-mode stability check. The auxiliary delay-corrected predictor and its empirical scope are defined in Appendix § 7.§ 5; they are not used as a proved finite-bandwidth similarity result. Unstable cases receive no fictitious stationary gain.

Q3: Is the description applicable and useful at a finite calibration budget?

This question tests estimation efficiency and applicability separately. A known population formula may be statistically inefficient to estimate, and a valid formula for one controller need not define a prediction for another.

Population sufficiency versus estimation efficiency. With 512 calibration observations, the experiment gives the following single-run RMSEs against exact gain:

DistributionPearson formulaDirect
Gaussian.01819.03204
Bounded elliptical.01466.03204
Common-radial t3t_3.05903.03204

Table 1 (PDF p. 8).

Thus a known sufficient population description can help in some distributions and lose in another. The t3t_3 result concerns this estimator, not all robust estimators. The three family experiments share sampled directions, so they are not three independent replications. The classification transfer study also included squared heavy-tailed margins lacking finite second moments; those are explicitly outside the second-moment assumptions.

Figure 3. Conditional similarity across matched tracking systems. Panels fix RR; colors distinguish η\eta. For each (R,η)(R,\eta) pair, solid curves show gains for 18 constructed systems, and black dashed curves show the frozen analytical prediction. The horizontal axis is b=cλ∗/ab=c\lambda_*/a. Systems satisfy narrow task-band and noise-alignment assumptions; agreement supports similarity within this class. The broad-spectrum and white-noise controls reported in the text delimit its applicability.

Native cellular prediction. Figure 4 summarizes the native prediction comparison. The cellular comparison uses five fixed models and four sensor-density/noise conditions, totaling 20 conditions. Each condition has 1024 calibration episodes split into two 512-example blocks and 2048 independent evaluation episodes. A fixed Gaussian residual approximation uses ten mean/covariance parameters for the two-dimensional interaction and null residuals; it is not a direct application of the zero-threshold elliptical sign formula.

Figure 4. Native localization prediction at matched calibration budgets. The Gaussian moment approximation does not outperform direct measurement at matched target-condition calibration budgets. The null retains the same frozen weights and global mean readout.

At budget 512, its RMSE is 0.014434, versus 0.009498 for the paired direct estimate, a 51.97% increase. At budget 64 the errors are 0.022581 and 0.020149. The model-cluster bootstrap interval for the 512-budget RMSE difference is [0.000374, 0.010938], conditional on only five previously examined checkpoints. Evaluation gain is itself a finite-sample reference, with mean standard error 0.003258. Thus these are not errors against known population truth or reliable confirmation over a new population of trained models.

All 20 estimated gains in this experiment are positive, ranging from 0.100859 to 0.376212. This supports usefulness of the declared coupling intervention in these systems, not a capability-onset boundary or superiority over an optimized independent architecture. The separate centered-classification diagnostic defined in § 3.3 rejects sign balance in 132 of 160 tests after Holm correction. This

Applicability to the unchanged cellular system. The applicability test applies § 3.9 to the same five checkpoints and four environments: sensor density 0.05/0.2 crossed with noise standard deviation 0.1/0.3. Each condition has 128 calibration and 128 independent evaluation episodes; no parameter mapping is refitted. The architecture and generator already violate the required controller, loss, and temporal correspondences. All 20 conditions are rejected, so no tracking-law prediction is issued and transfer RMSE is undefined. Static sensor noise reused through internal iterations is not a temporally white observation process, global localization loss is not nodewise tracking loss, and coordinate-dependent nonlinear responses do not share uniform scalar modal dynamics. Input-field spectral diagnostics are not substituted for the actual localization task.

Task relevance within the native system. As a supporting diagnostic of task relevance, we divide the lattice into four 16 × 16 regions and use 64 evaluation episodes per condition. Three regions receive episode observations shifted by independently chosen nonzero cyclic offsets; the fourth keeps its original evidence. This preserves each region’s empirical input distribution while changing its relation to the target. The paired coherent control uses the same masks and reconstructed sensor-noise residuals as the scrambled inputs, but restores the clean field for the correct target. The native task, weights, and communication/null comparison remain fixed. Mean gain is 0.209373 in the paired coherent control and 0.118317 after scrambling; all 20 differences are positive, but all scrambled-condition gains remain positive too. The manipulation changes task-observation relationships and inference difficulty together. Reused episodes and shared checkpoints preclude treating these as 20 independent confirmations of statistical significance. This is evidence that task consistency matters under this intervention, not identification of a unique synergy mechanism or an intrinsic integration timescale.

Discussion

What the evidence establishes

The results separate three questions often conflated in the search for a collective control parameter. A descriptor can fail because distinct systems share its value, because an assumed distributional or dynamical class does not apply, or because estimating it is less effective than measuring gain directly. Conversely, a population identity or a conditional collapse can be valid without yielding a practically useful predictor at the evaluated calibration budgets.

The three model classes address different parts of this separation. The bounded construction supplies exact information restrictions, the tracker supplies an analyzable mechanism, and the cellular system supplies a nonlinear applicability test. Their juxtaposition does not establish a common microscopic mechanism. Their relevance to embodied biological collectives remains a question for models with appropriate sensing, action, and environmental feedback.

The evidence is strongest for specified policies and comparison interfaces. Negative gain under a fixed policy does not mean that additional information lowers Bayes-optimal performance. Likewise, architectural coupling interventions can change computations as well as information access. These qualifications determine the scientific meaning of the measured contrast.

Effective agents as a future direction

A future route is to seek a state or spatial coarse-graining CC such that the projected complex dynamics and effective dynamics approximately agree under corresponding inputs and interventions. For stochastic transition kernels, the target relation is

C#Pα(k)(x,⋅)≈P‾α(C(x),⋅).C_{\#}P_{\alpha}^{(k)}(x,\cdot) \approx\overline{P}_{\alpha}(C(x),\cdot).

The same map should work for interaction and its null, with explicit observation permissions, readout, time correspondence, and acquisition cost. If hidden microstates materially affect the next coarse state, memory may be required. A local linearization alone neither reduces dimension nor proves this relation.

For the paired interaction/null comparison [8], if arm-wise expected quality errors are bounded by ϵI,ϵN\epsilon_I,\epsilon_N, then ∣G−G‾∣≤ϵI+ϵN|G-\overline{G}| \leq\epsilon_I+\epsilon_N. This triangle-inequality consequence is not a new certificate. Establishing its premises from a useful coarse model is the unsolved problem. Classification additionally requires control near decision boundaries; multi-step approximation requires error-propagation control. Wrong certified signs, unpreserved nulls, omitted unstable modes, and excessive parameter-acquisition cost are explicit failure outcomes.

The scientific ambition is that different micro-level implementations may share effective task-relevant dynamics and hence a small set of dimensionless parameters. Neither that effective equivalence nor a reduction among the three present models has been demonstrated. This direction should be tested on the existing systems without altering them to enforce the desired theoretical assumptions.

Limitations and reproducibility

The research sequence is adaptive, while individual studies have archived freezes. Known generating parameters underpin the strongest spectral results. The conditional-collapse systems were constructed around their hypotheses; they are not a blind test on naturally occurring populations. Neural results reuse five trained checkpoints and a narrow localization task. There is no universal threshold, finite-size phase-transition evidence, or demonstrated low-cost acquisition of sufficient spectral parameters.

Code, configuration freezes, raw outputs, and study-specific reproduction records are organized in the prepared archive RCI_Paper2_reproducibility.zip; Appendix § 7 maps results to its relative paths. As of this working-manuscript revision, the archive is held locally and no public repository or deposit URL has been established.

The LaTeX source package includes the manuscript, bibliography, and existing figures, but not the full experimental archive. Public availability of the latter is therefore pending; the existence of local records should not be read as a claim that readers can already download them. Existing records report same-author fresh-process replays; these are not independent external replications. Protocol exceptions, including a cellular wall-time overrun and post-hoc comparisons, are documented in the chronology appendix. The package preserves existing outputs and identifies analyses that were post hoc; its integrity checks do not substitute for a fresh scientific replay.

Conclusion

Low-dimensional prediction of collective task gain is possible in explicit restricted classes, but neither dimensionality nor population sufficiency ensures transfer or finite-budget usefulness. Bounded descriptor collisions, task-spectrum gain reversals, and failed cellular applicability checks identify distinct obstacles. Conditional curve collapse provides a positive mechanism result without eliminating those obstacles. A collective-intelligence Reynolds number remains a scientific objective: it will require independently meaningful parameters, preserved comparison interfaces, and evidence that effective descriptions survive changes of task, scale, and implementation.

Evidence map and reproducibility

The prepared reproducibility archive identified in § 5 retains study directories under studies/. Its original README uses the earlier working title, Predicting Interaction Gains in Collective Systems: Conditions and Limits of Low-Dimensional Descriptions; it contains the same selected historical studies. This archive is separate from the manuscript source ZIP, and its public deposition is pending. Directory labels record the historical sequence, not separate claims of independent confirmation. Table 2 maps the selected results to their archive locations. Each directory contains its protocol, code, outputs, and interpretation notes. The package-level verify_package.py verifies file hashes and selected table values without generating experimental observations. After extracting that archive, python3 verify_package.py performs this saved-artifact check. Study-specific replay commands can generate new observations and are a different operation; they have not been executed for this manuscript revision. Historical replay records are supplied as evidence of previous same-author re-execution, not independent replication in this release.

Study directoryPrincipal evidenceScope of verification
pilotFrozen factorized inference transferRESEARCH_MEMO_ZH.md; results/; original coefficient provenance
round2Nonseparable-task prediction vs. direct calibrationresults/metrics.csv; distinguish run and condition summaries
round3Bounded moment collision and Bayes distinctionPROOF_ZH.md; results/summary.json; rational moment checks
round4Elliptical sufficiency and estimation costTHEORY_ZH.md; results/metrics.csv
round5Native cellular predictionresults/metrics.csv; predictions.npz; fixed weights and native readout
round6Dimensionless tracking and spectral collisionDERIVATION_ZH.md; results/prediction_metrics.csv
round10Conditional similarity and delay boundaryTHEORY_ZH.md; results/metrics.csv; changed noise model
round11Applicability rejection on native systemsFrozen gates, raw diagnostics, and RESEARCH_MEMO_ZH.md
round14Task-consistency interventionFrozen intervention and RESEARCH_MEMO_ZH.md; shared-model limitations

Table 2. Evidence locations relative to studies/. Original study files and negative conditions are retained.

Design details for the transfer studies

Factorized transfer model. Let WW be the row-normalized neighbor matrix, P=(1−α)I+αWP=(1-\alpha)I+\alpha W, K=γTPγTK=\gamma^{T}P\gamma^{T}, and K0=γTIK_0=\gamma^{T}I. The role vector bb assigns each node to one of two channels. Latents (z1,z2)(z_1,z_2) are independent standard Gaussians in the Gaussian and nonlinear families, and independent uniform signs in the two binary-latent families. The second observed latent is z~2=z2\tilde{z}_2=z_2, −z2-z_2, or an independent draw from the same marginal, representing aligned, reversed, or unrelated evidence. Except in the binary-observation family, node inputs are Ai=(1−bi)(z1+ϵi)A_i=(1-b_i)(z_1+\epsilon_i) and Bi=bi(z~2+ϵi)B_i=b_i(\tilde{z}_2+\epsilon_i), with independent standard Gaussian sensor noises across nodes and episodes. In the binary-observation family, replace the parenthesized terms by 2z1fi\sqrt{2}z_1f_i and 2z~2fi\sqrt{2}\tilde{z}_2f_i, where fi=−1f_i=-1 with probability (1−1/2)/2(1-1/\sqrt{2})/2 and +1+1 otherwise. The two-channel readout noise has independent Gaussian coordinates with standard deviation σ\sigma.

Linear-family outputs are (KA,KB)(KA,KB) plus readout noise; the null substitutes K0K_0. Both arms share sensor and readout draws. The nonlinear family instead iterates vt+1=tanh⁡(γPvt)v^{t+1}=\tanh(\gamma Pv^t) separately on each channel, with P=IP=I in the null, adding readout noise only at the end. The terminal decision is the sign of the product of the two output channels; the target is sign⁡(z1z2)\operatorname{sign}(z_1z_2). This factorized study uses the conventional sign function, including sign⁡(0)=0\operatorname{sign}(0)=0, and does not divide outputs by channel response mass.

Nonseparable transfer model. This study uses independent standard Gaussian latents, correlated Gaussian latents with standard normal marginals and correlation 0.70.7, or independent t3/3t_3/\sqrt{3} latents. Aligned, reversed, and unrelated second-channel observations are generated as above, with an independent same-family marginal for unrelated evidence. Sensor and readout noises remain Gaussian. Let a1=1−ba_1=1-b, a2=ba_2=b, z~1=z1\tilde{z}_1=z_1, and define for arm matrix Ka∈{K,K0}K_a\in\{K,K_0\}

Oij(a)=[Ka(aj⊙(z~j+ϵ))]i+ξij[Kaaj]i,j=1,2.O_{ij}^{(a)}=\frac{[K_a(a_j\odot(\tilde{z}_j+\epsilon))]_i+\xi_{ij}}{[K_aa_j]_i},\qquad j=1,2.

The implementation assigns Oij(a)=0O_{ij}^{(a)}=0 when the denominator is at most 10−1210^{-12}. Here ϵi∼N(0,1)\epsilon_i\sim\mathcal{N}(0,1) and ξij∼N(0,σ2)\xi_{ij}\sim\mathcal{N}(0,\sigma^2) are independent sensor and readout noises. The paired arms share ϵ\epsilon and ξ\xi, but use their own known response masses. This normalization uses model information, not task labels or pooled observations.

The four task margins are mparity(z)=z1z2m_{\mathrm{parity}}(z)=z_1z_2, msum(z)=(z1+z2)/2m_{\mathrm{sum}}(z)=(z_1+z_2)/\sqrt{2}, mradial(z)=z12+z22−2log⁡2m_{\mathrm{radial}}(z)=z_1^2+z_2^2-2\log2, and mmixed(z)=z1+z2+0.8z1z2m_{\mathrm{mixed}}(z)=z_1+z_2+0.8z_1z_2. The task label is 1[m(z)≥0]\mathbf{1}[m(z)\ge0] and each node uses 1[m(Oij(a))≥0]\mathbf{1}[m(O_{ij}^{(a)})\ge0]; zero margins are classified positive. Episode quality averages node correctness. Parity is the factorized control, sum is the training task, and radial/mixed are the primary unseen tasks. These decision conventions apply to this study, not retroactively to the factorized sign-based study.

The factorized study used 512 independent calibration tasks and 1024 evaluation tasks per test run. Its 1440 test runs combine five held-out condition categories, eight configurations per category, three alignments, three seeds, and four families. Reported condition-level metrics average three seeds. Task-supervised descriptors observe component labels; structural descriptors do not. The corresponding information difference must accompany any performance comparison.

The nonseparable study trained on 192 Gaussian linear-sum runs and tested 864 base runs, each evaluated on four tasks at two calibration budgets, yielding 6912 task-budget records. These records share observations within each base run and are not independent replications. Each run uses 512 calibration examples (64-example prefixes form the smaller-budget analysis) and 4096 independent evaluation examples. Interaction and null share a parameterized decoding rule but use their respective known channel-response normalizations. This is not a shared set of numerical decoder coefficients; the normalizations use graph/model information, not pooled observations. Bootstrap intervals condition on the finite design and do not certify generalization to arbitrary tasks.

Frozen co-reachability coefficients

The original co-reachability predictor uses the ordered feature vector

ψ=(C,C2,C3,CHc,CBc,CHcBc)T\psi=(C,C^2,C^3,CH_c,CB_c,CH_cB_c)^\mathsf{T}

and G^coreach=clip⁡[0,1/2](βcoreachTψ)\widehat{G}_{\mathrm{coreach}}=\operatorname{clip}_{[0,1/2]}(\boldsymbol{\beta}_{\mathrm{coreach}}^{\mathsf{T}}\psi), with no intercept. The frozen coefficient vector is

βcoreach=(0.0207717029428352570.45525676200700110.11121442609127323−0.089831727179177170.280407982281926650.7174118023920321).\boldsymbol{\beta}_{\mathrm{coreach}} = \begin{pmatrix} 0.020771702942835257\\ 0.4552567620070011\\ 0.11121442609127323\\ -0.08983172717917717\\ 0.28040798228192665\\ 0.7174118023920321 \end{pmatrix}.

These values are copied from the original coreach_three entry in pilot/vendor/probe2_frozen.json, relative to the archive’s studies/ directory. The original ridge penalty was 10−610^{-6}. No coefficients were refitted for the present comparisons. This predictor is distinct from the task-reliability and Margin3 fits, which use ridge penalty 0.01.

Exact Bayes calculation for the mixture

At each observable amplitude, let the two component amplitude laws be mixed with weight θ\theta. Conditional on an observation, the task sign has posterior probabilities θ\theta and 1−θ1-\theta, possibly with their labels reversed. The optimal joint accuracy is therefore max⁡(θ,1−θ)\max(\theta,1-\theta), while each local accuracy stays 1/21/2. This gives GBayes=∣θ−1/2∣G_{\mathrm{Bayes}}=|\theta-1/2|. The unlabeled observation distribution is identical across mixture weights because the independent sign SS symmetrizes AA. Consequently, labeled nonlinear information, rather than the unlabeled marginals, distinguishes the worlds. Negative fixed-decoder gain cannot occur for an unconstrained optimal decoder that can ignore messages.

Bandwidth bound

Write h(q)=ηq/(1+q)+fR(q/(1+q))h(q)=\eta q/(1+q)+f_R(q/(1+q)), where

fR(t)=−11+R+1−t21+R−Rt.f_R(t)=-\frac{1}{1+R}+\frac{1-t^2}{1+R-Rt}.

For R≥0R\ge0 and t=q/(1+q)∈[0,1)t=q/(1+q)\in[0,1), ∣fR′(t)∣≤2|f'_R(t)|\le2 and fR′′(t)=−2(1+2R)/(1+R−Rt)3f''_R(t)=-2(1+2R)/(1+R-Rt)^3. The chain rule with t′=1/(1+q)2t'=1/(1+q)^2 and t′′=−2/(1+q)3t''=-2/(1+q)^3 yields ∣h′′(q)∣≤2(3+2R+η)|h''(q)|\le2(3+2R+\eta). Since ∑kpk(δk−1)=0\sum_k p_k(\delta_k-1)=0, Taylor’s remainder gives

∣∑kpkh(bδk)−h(b)∣≤(3+2R+η)b2∑kpk(δk−1)2.\left|\sum_k p_k h(b\delta_k)-h(b)\right|\le(3+2R+\eta)b^2\sum_k p_k(\delta_k-1)^2.

This establishes the stated zero-delay bound. It assumes the aligned-noise model and does not apply unchanged to the spatially white-noise controls. The method is a standard Taylor argument, specialized here to the signed task-gain response.

Support-dependent bound used in the experiments. Let dℓ=min⁡k:pk>0δkd_\ell=\min_{k:p_k>0}\delta_k and du=max⁡k:pk>0δkd_u=\max_{k:p_k>0}\delta_k, and define qℓ=bdℓq_\ell=bd_\ell, qu=bduq_u=bd_u, and tu=qu/(1+qu)t_u=q_u/(1+q_u). Since ∑kpkδk=1\sum_k p_k\delta_k=1, the expansion point q=bq=b lies in this support interval. On that interval, the same derivative calculation gives

12∣h′′(q)∣≤Cs,\frac{1}{2}|h''(q)|\le C_s,
Cs=1+2R(1+R−Rtu)3(1+qℓ)4+η+2(1+qℓ)3.(11)C_s=\frac{1+2R}{(1+R-Rt_u)^3(1+q_\ell)^4} +\frac{\eta+2}{(1+q_\ell)^3}. \tag*{(11)}

Combining this estimate with C0=3+2R+ηC_0=3+2R+\eta yields the bound used in the archived zero-delay checks:

∣G−F∣≤B0,B0=min⁡{C0,Cs}b2vd.(12)|G-F|\le B_0,\qquad B_0=\min\{C_0,C_s\}b^2v_d. \tag*{(12)}

Indeed, ∣fR′′(t)∣|f_R^{\prime\prime}(t)| is largest at tut_u, while t′t^{\prime} and ∣t′′∣|t^{\prime\prime}| are largest at qℓq_\ell; using ∣fR′(t)∣≤2|f_R^{\prime}(t)| \le2 bounds the remaining chain-rule term. Taylor expansion then cancels the weighted first-order term as above. The support endpoints include only modes with positive task power. This support-dependent result still assumes aligned noise and zero delay; it is not a bound for the spatially white-noise controls or the delayed predictor.

Auxiliary delayed-response predictor

For a stable mode define Hθ(iν;q)=[1+iν+qe−iνθ]−1H_\theta(i\nu;q) = [1+i\nu+qe^{-i\nu\theta}]^{-1}, Kθ(q)=[1+R+qe−Rθ]−1K_\theta(q) = [1+R+qe^{-R\theta}]^{-1}, and

Jθ(q)=2Rπ∫0∞∣Hθ(iν;q)∣2R2+ν2 dν.J_\theta(q)=\frac{2R}{\pi}\int_0^\infty\frac{|H_\theta(i\nu;q)|^2}{R^2+\nu^2}\,d\nu.

Let Nθ(q)N_\theta(q) be its stationary noise variance under diffusion coefficient 2\sqrt{2} (noise intensity 2). The auxiliary response is

hθ(q)=2Kθ(q)−Jθ(q)−11+R+η[1−Nθ(q)].h_\theta(q)=2K_\theta(q)-J_\theta(q)-\frac{1}{1+R}+\eta[1-N_\theta(q)].

For q>1q>1, Nθ(q)=[1+qsin⁡(νqθ)/νq]/[1+qcos⁡(νqθ)]N_\theta(q)=[1+q\sin(\nu_q\theta)/\nu_q]/[1+q\cos(\nu_q\theta)], where νq=q2−1\nu_q=\sqrt{q^2-1}; the expression has the hyperbolic continuation for q<1q<1 and limit (1+θ)/2(1+\theta)/2 for q=1q=1. The predictor is Fθ=hθ(b)F_\theta=h_\theta(b) and the aligned-spectrum reference is ∑kpkhθ(bδk)\sum_k p_kh_\theta(b\delta_k). The integral uses the archived error-controlled frequency quadrature. Predictions are evaluated only when the required modes are stable. Small errors observed on stable subsets are empirical evidence; the zero-delay bandwidth bound is not a proved uniform finite-bandwidth bound for FθF_\theta.

Chronology and retained exceptions

The initial direct-calibration comparison was post hoc. The restricted common-target similarity observation in the first tracking study was also post hoc; the later narrow-band study froze its relation before its new numerical grid. The native cellular models had already been examined in earlier studies, even when new evaluation episodes were generated. The 32-step native prediction experiment is not the original 16-step pilot scan. Its original run exceeded its intended wall-time limit; recorded completion and historical replays do not erase that protocol exception. No fitting was performed to turn the failed native applicability checks into numerical predictions.

References

  1. [1]Hector D. Ceniceros. Notes on complex fluids: Kinetic theory. Lecture notes, University of California, Santa Barbara, 2011. Draft dated January 4, 2011, Section 1.3.
  2. [2]Yaser Ghaedsharaf, Milad Siami, Christoforos Somarakis, and Nader Motee. Performance improvement in noisy linear consensus networks with time-delay. IEEE Transactions on Automatic Control, 64(6), 2019.arxiv.org/abs/1810.08287
  3. [3]Heiko Hamann and Andreagiovanni Reina. Scalability in computing and robotics. arXiv:2006.04969v2, 2021.DOI
  4. [4]Alexander Mordvintsev, Ettore Randazzo, Eyvind Niklasson, and Michael Levin. Growing neural cellular automata. Distill, 2020.DOI
  5. [5]Nathanael Perraudin and Pierre Vandergheynst. Stationary signal processing on graphs. arXiv:1601.02522v5, 2017.DOI
  6. [6]Tirza Routtenberg. Graph signal estimation with unknown topology. arXiv:2610.34070, 2026.arxiv.org/abs/2610.34070
  7. [7]Friedrich Schmid and Rafael Schmidt. Nonparametric inference on multivariate versions of blomqvist’s beta and related measures of tail dependence. Metrika, 66(3):323–354, 2007.DOI
  8. [8]Xuening Wu, Yanlan Kang, Qianya Xu, Shan Yu, Haode Yang, and Shenqin Yin. Renormalized cellular intelligence: When does model reduction preserve collective capability? arXiv:2611.01441, 2026.arxiv.org/abs/2611.01441
  9. [9]Lin Xiao, Stephen Boyd, and Seung-Jean Kim. Distributed average consensus with least-mean-square deviation. Journal of Parallel and Distributed Computing, 67(1):33–46, 2007.DOI

Paper details

vlnc:W_utr4d2yk
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents