Metraipolis › archive › dc_f3c526260ec2

From Risk Scoring to Risk Allocation: A Density-Driven Framework for Diverse Monitoring in Multi-Agent Systems — arXiv:2609.26146

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.26146
License (as archived)
CC0-1.0
Archived
2026-10-08T13:43:41.520Z
SHA-256 of the archived text
d327b1829b86115083d0901f439f949ddceebf45eba0dc8ce17b837589b47472
Stable URL of this page
https://metraipolis.com/documento/dc_f3c526260ec2

How to cite

From Risk Scoring to Risk Allocation: A Density-Driven Framework for Diverse Monitoring in Multi-Agent Systems — arXiv:2609.26146 — arXiv (en), https://arxiv.org/abs/2609.26146 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f3c526260ec2 (Metraipolis archive dc_f3c526260ec2, sha256 d327b1829b86115083d0901f439f949ddceebf45eba0dc8ce17b837589b47472)
BibTeX
@misc{dcf3c526260ec2,
  title = {From Risk Scoring to Risk Allocation: A Density-Driven Framework for Diverse Monitoring in Multi-Agent Systems — arXiv:2609.26146},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.26146},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f3c526260ec2; sha256 d327b1829b86115083d0901f439f949ddceebf45eba0dc8ce17b837589b47472},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.26146. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Risk monitoring in multi-agent systems is commonly built on a per-state primitive that scores each state independently and selects the top K. Under crowding, where many agents share the same fragility, this approach picks redundant alerts whose risks are jointly correlated, a pattern we describe as ``herding in monitoring.'' We propose a paradigm shift from risk scoring to risk allocation, supported by two contributions. First, we identify the Crowding Paradox, namely that P(risk | x) $\propto$ p(x) rather than 1/p(x), so density rather than anomaly score is the operative risk signal; on financial data, density-based scoring reaches AUROC $\geq$ 0.94 at 5d/10d/20d crash horizons, while five anomaly baselines all fall below 0.80. Second, given a density-derived fragility score, we recast monitoring as combinatorial subset selection over interdependent states and map it to a QUBO objective with a $\lambda$-controlled risk--diversity tradeoff. The resulting Pareto frontier contains standard diverse-subset methods (MMR, k-DPP) as fixed operating points; the gain over greedy grows monotonically with scale, from +24% at n=15 to +66% at n=200; a learned $\lambda$ policy reaches 99.5% of an oracle grid-search objective; and the formulation transfers to traffic and multi-agent reinforcement learning. The same QUBO instances execute without modification on Rigetti superconducting QPUs (Ankaa-3 and Cepheus-1-108Q via Amazon Braket), which we report as a compatibility property of the formulation rather than a claim of quantum advantage at this scale.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-23 in cs.MA).
Categorie arXiv: Machine Learning (cs.LG) ; Multiagent Systems (cs.MA).
Pagina del lavoro: https://arxiv.org/abs/2609.26146 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T13:18:03.302Z dalla pagina https://arxiv.org/catchup/cs.MA/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).