Three laws for when a society of LLM agents will stop disagreeing
AspireAI community · arXiv
Emerging control planes would compose LLM agents that exchange interpreted conclusions, so hallucinations can propagate even over error-free transport. Modelling such a society as a cellular sheaf, this paper establishes three laws that hold on arbitrary topologies. The composition law: network-wide divergence exceeds the sum of per-agent audit scores by exactly their hidden total correlation, which masks up to 23% of joint divergence and overstates the cognitive signal-to-noise ratio by 1.14 dB purely through topology. The scaling law: reconciliation decouples across metric counters, so the worst-connected dimension sets the pace, and consistency time grows as Omega(n^(2/d)) on polynomial-growth topologies of degree d - paths breach a one-second near-real-time budget at 13 agents, while expanders and radius-3 local audits stay bounded. The consistency-time law: timing error from omitted correlations is one-sided and capped by the worst-measured link. The laws are validated on simulated topologies and deployed LLM societies, giving worst-case latency ceilings for near-real-time operation.
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.