When Does Interaction Help? Toward a Reynolds Number for Collective Intelligence
Organizations: Pfizer Inc. · Fudan University
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.
Figures & tables
| Predictor | Inputs and mapping | Information and fitting |
|---|---|---|
| Co-reachability | Structural and a fixed polynomial | Graph/propagation quantities; previously fitted coefficients, kept fixed |
| Task reliability | Channel sign reliabilities; or a fitted polynomial | Calibration component labels; fitted variant uses Gaussian training runs |
| Margin3 | Margin correlations, dispersion and bias; | Both labeled arms; separate ridge fit for each budget, frozen after Gaussian-sum training |
| Elliptical plug-in | Two Pearson correlations in the arcsin formula | Both labeled arms; no fitted gain map |
| Tracking ratio / compact | Reference curve / collapsed nonzero-mode spectrum | Known generating parameters; reference task-class information or six scalars |
| Conditional similarity | and task-band error bound | Known parameters and aligned-noise assumptions; no label fitting |
Appendix figures & tables1 asset
Supplementary material from the paper’s appendix.
Appendix
| Study directory | Principal evidence | Scope of verification |
|---|---|---|
| pilot | Frozen factorized inference transfer | RESEARCH_MEMO_ZH.md ; results/ ; original coefficient provenance |
| round2 | Nonseparable-task prediction vs. direct calibration | results/metrics.csv ; distinguish run and condition summaries |
| round3 | Bounded moment collision and Bayes distinction | PROOF_ZH.md ; results/summary.json ; rational moment checks |
| round4 | Elliptical sufficiency and estimation cost | THEORY_ZH.md ; results/metrics.csv |
| round5 | Native cellular prediction | results/metrics.csv ; predictions.npz ; fixed weights and native readout |
| round6 | Dimensionless tracking and spectral collision | DERIVATION_ZH.md ; results/prediction_metrics.csv |
Multi-Agent Systems
Multi-Agent Systems studies how autonomous agents coordinate, compete, communicate, and learn in shared or interdependent tasks.
See all 723 papers