Metraipolis › archive › dc_94da3762db6e

Graph Anomaly Detection as Finite-Horizon Control: Training-Free Scoring via Empirical Bayes — arXiv:2609.38424

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.38424
License (as archived)
CC0-1.0
Archived
2026-10-07T13:45:17.324Z
SHA-256 of the archived text
feee68a8d21b416629601e6361279ef89c06c9d6c0d5171da2e099b147a4df7e
Stable URL of this page
https://metraipolis.com/documento/dc_94da3762db6e

How to cite

Graph Anomaly Detection as Finite-Horizon Control: Training-Free Scoring via Empirical Bayes — arXiv:2609.38424 — arXiv (en), https://arxiv.org/abs/2609.38424 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_94da3762db6e (Metraipolis archive dc_94da3762db6e, sha256 feee68a8d21b416629601e6361279ef89c06c9d6c0d5171da2e099b147a4df7e)
BibTeX
@misc{dc94da3762db6e,
  title = {Graph Anomaly Detection as Finite-Horizon Control: Training-Free Scoring via Empirical Bayes — arXiv:2609.38424},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.38424},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_94da3762db6e; sha256 feee68a8d21b416629601e6361279ef89c06c9d6c0d5171da2e099b147a4df7e},
  year = {2026}
}

Archived text

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

Node-level graph anomaly detection (GAD) identifies nodes whose attributes and interactions deviate from dominant graph regularities. Existing GAD models encode normality and anomaly scoring indirectly through architectures, message passing, reconstruction or contrastive objectives, and tuned score families. This entangles graph trust (how strongly graph structure should define normality), graph-spectral weighting, and anomaly-score choice, yielding scores that are costly, opaque, and unstable across graph regimes. We propose EB-GAD (Empirical-Bayes GAD), a training-free framework that models normality as graph-aware generalized Ornstein-Uhlenbeck (GOU) relaxation toward a graph-filtered template. Empirical Bayes fits the graph precision from the residual-field likelihood; the GOU then turns scoring into a closed-form finite-horizon control energy, the minimum effort to steer a feature-neutral node to its observed endpoint along graph-spectral relaxation. Sweeping relaxation horizon and endpoint tolerance yields a bank of scores that share one fitted prior: equilibrium Mahalanobis scoring is one limit, while finite-horizon control-energy and scale-normalized ratio scores reveal anomalies that static equilibrium scoring can mask. A label-free selector chooses the score family from feature homophily, edge density, and feature dimension, then ranks candidates by fitted-null deviation and rank stability. On 11 benchmarks and without labels at any step, EB-GAD has the best or tied-best AUROC on 9: the four financial fraud networks (up to 3.7M nodes), the YelpChi and Amazon review graphs, Weibo, Reddit and Facebook, with margins of up to 21.7 points. It is second on BlogCatalog and ACM.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-10-01 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.38424 — 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-07T13:18:10.207Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).