Secure and Explainable Fraud Detection in Finance via Hierarchical Multi-source Dataset Distillation
Not on the map. Why?
Abstract (arXiv)
We propose an explainable, privacy-preserving dataset distillation framework for collaborative financial fraud detection. A trained random forest is converted into transparent, axis-aligned rule regions (leaf hyperrectangles), and synthetic transactions are generated by uniformly sampling within each region. This produces a compact, auditable surrogate dataset that preserves local feature interactions without exposing sensitive original records. The rule regions also support explainability: aggregated rule statistics (for example, support and lift) describe global patterns, while assigning each case to its generating region gives concise human-readable rationales and calibrated uncertainty based on tree-vote disagreement. On the IEEE-CIS fraud dataset (590k transactions across three institution-like clusters), distilled datasets reduce data volume by 85% to 93% (often under 15% of the original) while maintaining competitive precision and micro-F1, with only a modest AUC drop. Sharing and augmenting with synthesized data across institutions improves cross-cluster precision, recall, and AUC. Real vs. synthesized structure remains highly similar (over 93% by nearest-neighbor cosine analysis). Membership-inference attacks perform at chance level (about 0.50) when distinguishing training from hold-out records, suggesting low memorization risk. Removing high-uncertainty synthetic points using disagreement scores further boosts AUC (up to 0.687) and improves calibration. Sensitivity tests show weak dependence on the distillation ratio (AUC about 0.641 to 0.645 from 6% to 60%). Overall, tree-region distillation enables trustworthy, deployable fraud analytics with interpretable global rules, per-case rationales with quantified uncertainty, and strong privacy properties suitable for multi-institution settings and regulatory audit.
Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 15 of its 35 references that are in the map. First posted on arXiv 26 Dec 2025.
Builds on
15 of 35 references.
References · 15
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,653
- 2018Federated Optimization in Heterogeneous Networkscited by 2,981
- 2017Improved Training of Wasserstein GANscited by 2,226
- 2020Dataset Condensation with Gradient Matchingcited by 512
- 2022Dataset Distillation by Matching Training Trajectoriescited by 438
- 2021Dataset Condensation with Distribution Matchingcited by 363
- 2021Evaluating Gradient Inversion Attacks and Defenses in Federated Learningcited by 196
- 2022Scaling Up Dataset Distillation to ImageNet-1K with Constant Memorycited by 180
- 2022Dataset Distillation using Neural Feature Regressioncited by 177
- 2022Efficient Dataset Distillation Using Random Feature Approximationcited by 111
- 2023Efficient Dataset Distillation via Minimax Diffusioncited by 82
- 2022Synthesizing Informative Training Samples with GANcited by 77
3 more
- 2024D4M: Dataset Distillation via Disentangled Diffusion Modelcited by 76
- 2020Federated Learning via Synthetic Datacited by 53
- 2024Generative Dataset Distillation: Balancing Global Structure and Local Detailscited by 18
Built on by
Not cited yet.