AMLworld-Compact: Importance-Weighted Downsampling for Cost-Effective LLM Evaluation and Error Diagnosis
Not on the map. Why?
Abstract (arXiv)
Evaluating large language models (LLMs) on AMLworld's smallest test splits is costly because each of over a million targets requires a separate graph prompt. Sampling reduces this cost, but small balanced subsets change unweighted precision and F1. We introduce AMLworld-Compact, an evaluation set that retains every illicit test transaction and samples benign transactions from supervised-score strata. Its HT-Coreset protocol reduces evaluation targets by 271x and 611x on HI-Small and LI-Small. Horvitz-Thompson weights give unbiased full-test confusion-count estimates for fixed predictions; recall is exact, while precision and F1 are ratio estimates. In a held-out study using Graph Feature Preprocessor (GFP) features, one boosted-tree family defines strata for evaluating the other over 500 draws per configuration. At the released sizes, F1 RMSE is 0.00-2.58 percentage points versus 4.44-7.41 for uniform sampling with HT weights; conservative intervals remain broad. Under the evaluated graph prompts, seven open-weight LLMs have weighted precision near the predict-all-illicit baseline. In an outcome-stratified audit of 1,000 HI-Small few-shot outputs from one run per model, lexical checks pass for 84.5% of correct and 56.2% of incorrect binary verdicts, so these markers do not establish correctness. We release the evaluation sets, construction code, and audit tools at https://huggingface.co/datasets/typhoon-ai/AMLworldCompactEval and https://github.com/nat-nischw/AMLworld-Compact.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 33 references that are in the map. First posted on arXiv 9 Oct 2026.
Builds on
13 of 33 references.
References · 13
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2018How Powerful are Graph Neural Networks?cited by 4,393
- 2023Let's Verify Step by Stepcited by 3,789
- 2024From Local to Global: A Graph RAG Approach to Query-Focused Summarizationcited by 1,453
- 2023Language Models Don't Always Say What They Think: Unfaithful Explanations in Chain-of-Thought Promptingcited by 1,122
- 2024tinyBenchmarks: evaluating LLMs with fewer examplescited by 310
- 2023Exploring the Potential of Large Language Models (LLMs) in Learning on Graphscited by 274
- 2023Realistic Synthetic Financial Transactions for Anti-Money Laundering Modelscited by 50
- 2025Measuring Chain of Thought Faithfulness by Unlearning Reasoning Stepscited by 47
- 2024A Framework for Efficient Model Evaluation through Stratification, Sampling, and Estimationcited by 14
- 2019Efficient Knowledge Graph Accuracy Evaluationcited by 12
- 2024Graph Feature Preprocessor: Real-time Subgraph-based Feature Extraction for Financial Crime Detectioncited by 4
Built on by
Not cited yet.