Graph-SND replaces the complete pairwise average in System Neural Diversity with a weighted average over graph edges, recovering the original metric exactly when the graph is complete and providing linear-cost sparse and sampling-based variants with theoretical bounds and empirical speedups.
Forty-first International Conference on Machine Learning (ICML) , year =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Graph-SND: Sparse Aggregation for Behavioral Diversity in Multi-Agent Reinforcement Learning
Graph-SND replaces the complete pairwise average in System Neural Diversity with a weighted average over graph edges, recovering the original metric exactly when the graph is complete and providing linear-cost sparse and sampling-based variants with theoretical bounds and empirical speedups.