When Can Fraud Operations Authorize Automation? A Decision-Support Framework for Fresh Audit Evidence and Review Workload
Not on the map. Why?
Abstract (arXiv)
Fraud operations must allocate events among automatic approval, analyst review, and automatic blocking even though the labels needed to evaluate these actions are selective and delayed. Predictive scores order cases, but they do not show whether the evidence is current and representative enough to delegate an action to the model. We develop freshness-constrained audit capacity (FCAC), a decision-support framework that treats automation as an authorization decision constrained by action risk, evidence freshness, and shared review capacity. It evaluates candidate action regions from mature randomized audits and a prespecified temporal allowance. Supported regions are automated; unsupported regions remain in review. The resulting decision record reports evidence age, audit demand, total review workload, value exposure, and compatible temporal change. We show that current action risk is unidentified without restricting unobserved label evolution. Under representative randomized audits, label-independent evidence windows, and a prespecified condition linking historical and current action risk, we derive simultaneous finite-sample control of unsafe authorization. Chronological evaluations with simulated audits on IEEE-CIS, ULB-Worldline, and Elliptic++ yield zero-drift automation rates of 84.4%, 67.4%, and 81.3%, with total review workloads of 24.1%, 46.0%, and 43.1%. The experiments reveal an audit-capacity trade-off: sparse auditing delays authorization, whereas intensive auditing eventually increases workload. A separately specified BAF stress test further indicates that fallback thresholds must reflect candidate-specific evidence rather than a common fraction of the risk limit. These findings identify audit freshness and analyst capacity as joint design considerations for fraud decision support.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 48 references that are in the map. First posted on arXiv 9 Aug 2026.
Builds on
14 of 48 references.
References · 14
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
- 2022Conformal Risk Controlcited by 290
- 2021Distribution-Free, Risk-Controlling Prediction Setscited by 278
- 2020Consistent Estimators for Learning to Defer to an Expertcited by 262
- 2018Time-uniform, nonparametric, nonasymptotic confidence sequencescited by 220
- 2019Anti-Money Laundering in Bitcoin: Experimenting with Graph Convolutional Networks for Financial Forensicscited by 158
- 2022Conformal Inference for Online Prediction with Arbitrary Distribution Shiftscited by 123
- 2022Turning the Tables: Biased, Imbalanced, Dynamic Tabular Datasets for ML Evaluationcited by 39
- 2024Conformal Validity Guarantees Exist for Any Data Distribution (and How to Find Them)cited by 26
- 2023Demystifying Fraudulent Transactions and Illicit Nodes in the Bitcoin Network for Financial Forensicscited by 17
- 2018Streaming Active Learning Strategies for Real-Life Credit Card Fraud Detection: Assessment and Visualizationcited by 14
- 2024Active, anytime-valid risk controlling prediction setscited by 14
Built on by
Not cited yet.