mlsanityData to 14 Oct 2026

SALT-GNN: Handling Dense Neighborhoods in Anti-Money Laundering Graphs via Statistics-Aware Attention

arXiv 2607.10131 ↗First posted 11 Jul 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Money laundering threatens financial stability and exposes institutions to penalties, motivating automated detection. Because laundering schemes often emerge through relational patterns, graph neural networks (GNNs) are increasingly used for anti-money laundering (AML). Yet AML GNNs are typically evaluated with aggregate metrics such as overall F1 score, which hide an operational issue: high-activity recipient accounts concentrate many incoming transactions, making suspicious signals harder to isolate and costlier to investigate. We introduce a recipient-degree stratified evaluation that reports standard AML metrics across recipient-context density. Across three datasets (HI-Small, HI-Medium, and AMLSim-32k-5%), it reveals consistent degradation in dense recipient contexts, which we trace to three GNN characteristics: two known limitations that AML amplifies, i.e., (1) multiset non-discriminability and (2) cardinality blindness, and (3) an attention-specific effect: in dense neighborhoods, normalized attention attenuates weak but pattern-relevant multi-hop signals. Guided by this diagnosis, we propose SALT-GNN, a lightweight statistics-aware architecture that fuses degree-aware statistical aggregation with attention at each message-passing layer, so distributional and cardinality information shapes the node states used by subsequent attention steps. Ablations support fusion placement as a key factor in dense-context performance. On HI-Small and HI-Medium, SALT-GNN uses up to 77% fewer parameters than task-specific graph-transformer baselines while improving dense-context F1 score by 3-6 points; on AMLSim-32k-5%, it improves highest-degree F1 score by 16-20 points. The gains hold for both Transformer- and GAT-style attention, indicating that the benefit comes from where statistical and attentional evidence is fused rather than from a specific attention operator.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 12 of its 36 references that are in the map. First posted on arXiv 11 Jul 2026.

Builds on

12 of 36 references.

References · 12

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Graph Attention Networkscited by 8,923
  3. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,694
  4. 2020Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classificationcited by 506
  5. 2023NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classificationcited by 210
  6. 2021Identity-aware Graph Neural Networkscited by 198
  7. 2023On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topologycited by 166
  8. 2019Approximation Ratios of Graph Neural Networks for Combinatorial Problemscited by 69
  9. 2019DEMO-Net: Degree-specific Graph Neural Networks for Node and Graph Classificationcited by 59
  10. 2022A Short Tutorial on The Weisfeiler-Lehman Test And Its Variantscited by 52
  11. 2023Provably Powerful Graph Neural Networks for Directed Multigraphscited by 27
  12. 2025TeMP-TraG: Edge-based Temporal Message Passing in Transaction Graphscited by 2

Built on by

Not cited yet.