pith. machine review for the scientific record. sign in

arxiv: 1812.00076 · v1 · submitted 2018-11-30 · 💻 cs.SI · cs.AI· cs.LG

Recognition: unknown

Scalable Graph Learning for Anti-Money Laundering: A First Look

Authors on Pith no claims yet
classification 💻 cs.SI cs.AIcs.LG
keywords graphlaunderingpeopleresultsactivityanti-moneydatafinancial
0
0 comments X
read the original abstract

Organized crime inflicts human suffering on a genocidal scale: the Mexican drug cartels have murdered 150,000 people since 2006, upwards of 700,000 people per year are "exported" in a human trafficking industry enslaving an estimated 40 million people. These nefarious industries rely on sophisticated money laundering schemes to operate. Despite tremendous resources dedicated to anti-money laundering (AML) only a tiny fraction of illicit activity is prevented. The research community can help. In this brief paper, we map the structural and behavioral dynamics driving the technical challenge. We review AML methods, current and emergent. We provide a first look at scalable graph convolutional neural networks for forensic analysis of financial data, which is massive, dense, and dynamic. We report preliminary experimental results using a large synthetic graph (1M nodes, 9M edges) generated by a data simulator we created called AMLSim. We consider opportunities for high performance efficiency, in terms of computation and memory, and we share results from a simple graph compression experiment. Our results support our working hypothesis that graph deep learning for AML bears great promise in the fight against criminal financial activity.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Mechanism Design for Decentralized Risk Detection: Strict Propriety, Network Coalitions, and the Backfiring Mandat

    cs.GT 2026-04 unverdicted novelty 7.0

    TVA implements truthful Bayes-Nash reporting in large federations and shows competitive pressure amplifies moral hazard such that forced sharing without incentives can lower welfare below autarky.

  2. Mechanism Design for Decentralized Risk Detection: Strict Propriety, Network Coalitions, and the Backfiring Mandat

    cs.GT 2026-04 unverdicted novelty 7.0

    TVA mechanism implements truthful posterior reporting as Bayes-Nash equilibrium in decentralized risk detection, with network Shapley coalition analysis and welfare ordering showing backfiring mandates under certain c...

  3. Mechanism Design for Decentralized Risk Detection: Strict Propriety, Network Coalitions, and the Backfiring Mandat

    cs.GT 2026-04 unverdicted novelty 6.0

    A dynamic mechanism design framework with strictly proper scoring rules implements truthful reporting in decentralized risk detection among competing firms and identifies conditions for backfiring regulatory mandates.

  4. TransXion: A High-Fidelity Graph Benchmark for Realistic Anti-Money Laundering

    cs.LG 2026-04 unverdicted novelty 6.0

    TransXion supplies a 3-million-transaction graph benchmark with profile-aware normal activity and stochastic illicit subgraphs that produces lower detection scores than prior AML datasets.

  5. Explainable AML Triage with LLMs: Evidence Retrieval and Counterfactual Checks

    cs.AI 2026-03 unverdicted novelty 6.0

    Evidence-grounded LLM triage with structured contracts and counterfactual validation achieves PR-AUC 0.75 and high faithfulness scores on synthetic AML benchmarks.

  6. BlazingAML: High-Throughput Anti-Money Laundering (AML) via Multi-Stage Graph Mining

    cs.DC 2026-04 unverdicted novelty 5.0

    BlazingAML uses a multi-stage graph mining framework and compiler to express fuzzy AML patterns, matching SOTA F1 scores while delivering 210x CPU and 333x GPU speedups on IBM datasets.