Abstract

arXiv:2605.05020v1 Announce Type: new Abstract: System Neural Diversity (SND) measures behavioral heterogeneity in multi-agent reinforcement learning by averaging pairwise distances over all \(\binom\{n\}\{2\}\) agent pairs, making each call quadratic in team size. We introduce Graph-SND, which replaces this complete-graph average with a weighted average over the edges of an arbitrary graph \(G\). Three regimes follow: \(G=K_n\) recovers SND exactly; a fixed sparse \(G\) defines a localized diversity measure at \(O(|E|)\) cost; and random edge samples yield an unbiased Horvitz-Thompson estimator and a normalized sample mean with \(O(1/\sqrt\{m\})\) concentration in the sampled edge count \(m\). For fixed sparse graphs we prove forwarding-index distortion bounds for expanders and a spectral refinement under low-rank distance structure; for random \(d\)-regular graphs we prove an unconditional probabilistic \(\widetilde\{\mathcal\{O\}\}(D_\{\max\}/\sqrt\{n\})\) bound. On VMAS we verify

Authors

(none)

Tags

  • Multi-Agent

Stats

  • citations0
  • S2 citationsβ€”
  • github stars0
  • HF likes0
  • heat score0.00
  • arxiv keyray2026graph

Related papers