Adaptive Cloud-Native Fraud Detection via Uncertainty-Aware Dynamic Model Routing
DOI:
https://doi.org/10.54097/qnmde398Keywords:
Fraud detection, Cloud-native systems, Dynamic model routing, Uncertainty estimation, Concept drift, Payment intelligence, Latency-aware machine learningAbstract
Real-time payment fraud detection in cloud-native platforms is constrained by two forces that are usually optimized separately: the statistical difficulty of highly imbalanced and drifting transaction streams, and the operational latency budget of synchronous microservice inference. Prior cloud-native payment intelligence work has shown that lightweight models can offer attractive latency and footprint properties, while tree ensembles can improve ranking quality at substantially higher inference cost. This paper extends that line of work by proposing UDMR, an uncertainty-aware dynamic model routing framework that invokes a fast-linear scorer for every transaction and routes only high-risk, uncertain, or drift-exposed transactions to a heavier expert model. The router combines fast-model risk, decision-margin uncertainty, and a training-window drift distance into a fixed single-row routing score, then selects the routing threshold and operating threshold on a validation stream under a minimum precision floor. Because the public ULB/Worldline fraud data were not available inside the execution sandbox, the empirical artifact uses a deterministic synthetic transaction stream with 60,000 chronological transactions, a 0.91% fraud rate, and controlled concept drift; the released code automatically uses a real ULB-style creditcard.csv file when supplied. On the synthetic drift benchmark, the random-forest expert achieves the strongest average precision (0.859) and F1 (0.803) but requires serving every request through the heavy model. UDMR routes 39.6% of test transactions to the expert, reaches average precision of 0.557 and F1 of 0.528, and reduces median single-row latency from 2429 microseconds for the expert-only service to 345 microseconds. The results show that uncertainty-aware routing is a practical cloud-native design pattern when median capacity, alert precision, and graceful degradation matter, while also revealing that high routing rates still expose p95/p99 latency to expert-model cost.
Downloads
References
[1] Zi, B. (2024). Cloud-native distributed systems for real-time payment intelligence. AI and Data Science Journal, 1(1), 51-56.
[2] Jamshidi, P., Pahl, C., Mendonca, N. C., Lewis, J., & Tilkov, S. (2018). Microservices: The journey so far and challenges ahead. IEEE Software, 35(3), 24-35. https://doi.org/10.1109/MS.2018.2141039
[3] Dean, J., & Barroso, L. A. (2013). The tail at scale. Communications of the ACM, 56(2), 74-80. https://doi.org/10.1145/2408776.2408794
[4] Dal Pozzolo, A., Boracchi, G., Caelen, O., Alippi, C., & Bontempi, G. (2018). Credit card fraud detection: A realistic modeling and a novel learning strategy. IEEE Transactions on Neural Networks and Learning Systems, 29(8), 3784-3797. https://doi.org/10.1109/TNNLS.2017.2736643
[5] Dal Pozzolo, A., Caelen, O., Le Borgne, Y.-A., Waterschoot, S., & Bontempi, G. (2014). Learned lessons in credit card fraud detection from a practitioner perspective. Expert Systems with Applications, 41(10), 4915-4928. https://doi.org/10.1016/j.eswa.2014.02.026
[6] Carcillo, F., Dal Pozzolo, A., Le Borgne, Y.-A., Caelen, O., Mazzer, Y., & Bontempi, G. (2018). SCARFF: A scalable framework for streaming credit card fraud detection with Spark. Information Fusion, 41, 182-194. https://doi.org/10.1016/j.inffus.2017.09.005
[7] Carcillo, F., Le Borgne, Y.-A., Caelen, O., & Bontempi, G. (2018). Streaming active learning strategies for real-life credit card fraud detection: Assessment and visualization. International Journal of Data Science and Analytics, 5(4), 285-300. https://doi.org/10.1007/s41060-017-0076-9
[8] Davis, J., & Goadrich, M. (2006). The relationship between precision-recall and ROC curves. In Proceedings of the 23rd International Conference on Machine Learning (pp. 233-240). ACM. https://doi.org/10.1145/1143844.1143874
[9] Saito, T., & Rehmsmeier, M. (2015). The precision-recall plot is more informative than the ROC plot when evaluating binary classifiers on imbalanced datasets. PLOS ONE, 10(3), e0118432. https://doi.org/10.1371/journal.pone.0118432
[10] Breiman, L. (2001). Random forests. Machine Learning, 45(1), 5-32. https://doi.org/10.1023/A:1010933404324
[11] Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., & Duchesnay, É. (2011). Scikit-learn: Machine learning in Python. Journal of Machine Learning Research, 12, 2825-2830.
[12] Guo, C., Pleiss, G., Sun, Y., & Weinberger, K. Q. (2017). On calibration of modern neural networks. In Proceedings of the International Conference on Machine Learning (ICML) (pp. 1321-1330). PMLR.
[13] Kendall, A., & Gal, Y. (2017). What uncertainties do we need in Bayesian deep learning for computer vision? In Advances in Neural Information Processing Systems 30 (pp. 5574-5584).
[14] Gal, Y., & Ghahramani, Z. (2016). Dropout as a Bayesian approximation: Representing model uncertainty in deep learning. In Proceedings of the International Conference on Machine Learning (ICML) (pp. 1050-1059). PMLR.
[15] Gama, J., Žliobaitė, I., Bifet, A., Pechenizkiy, M., & Bouchachia, A. (2014). A survey on concept drift adaptation. ACM Computing Surveys, 46(4), Article 44. https://doi.org/10.1145/2523813
[16] Bifet, A., & Gavaldà, R. (2007). Learning from time-changing data with adaptive windowing. In Proceedings of the SIAM International Conference on Data Mining (SDM) (pp. 443-448). SIAM. https://doi.org/10.1137/1.9781611972771.42
[17] Bolukbasi, T., Wang, J., Dekel, O., & Saligrama, V. (2017). Adaptive neural networks for efficient inference. In Proceedings of the International Conference on Machine Learning (ICML) (pp. 527-536). PMLR.
[18] Teng, D., Rhee, M., Qin, Y., Zi, B., & Liu, W. (2026). SW-SpeedDLM: Sliding-window speculative decoding for diffusion language models under long-context constraints. Mathematics, 14(11), 2105. https://doi.org/10.3390/math14112105
[19] Wang, Z., Yang, J. S., Shang, W., & Ding, J. (2026). FairPromote: Explainable and fairness-aware talent promotion prediction via adversarial debiasing and SHAP-based interpretation. IEEE Access, 14, 1-16.
[20] Teng, D. (2025). TEAS: Token- and energy-aware autoscaling for cost-efficient LLM serving. AI and Data Science Journal, 6(3), 1-10.
[21] Zhang, F., Guo, Z., Ding, J., Yang, J., & Liu, W. (2026). Adaptive sensor fusion for robust perception in dense fog: A gated vision and LiDAR integration framework. Sensors, 26(12), Article 3728. https://doi.org/10.3390/s26123728
[22] Zi, B. (2024). Large language models for enterprise workflow automation in financial operations. Innovation and Technology Studies, 1(2), 112-118.
[23] Ding, J., Shen, Z., & Liu, W. (2026). Game-theoretic cost-sensitive adversarial training for robust cloud intrusion detection against GAN-based evasion attacks. Applied Sciences, 16(8), Article 3944. https://doi.org/10.3390/app16083944
[24] Liang, Y., Jiao, Y., Ping, W., Fan, H., & Han, X. (2026). Adaptive event-driven labeling: A neuro-symbolic multiagent framework for causal inference in non-stationary time series. IEEE Access, 14, 1-18.
[25] Wang, B., Wang, Z., Zhao, W., Zhang, F., & Shang, W. (2026). DRL-Adapt: Deep reinforcement learning for adaptive routing convergence optimization in large-scale networks. IEEE Open Journal of the Computer Society, 7, 1-14.
[26] Teng, D. (2025). PACO: Predictive auto-configuration for SLO-constrained large language model inference serving. Innovation and Technology Studies, 2(1), 1-12.
[27] Jiao, Y., Fan, H., Yue, X., Ping, W., Sun, T., & Wang, J. (2026). Dynamic heterogeneous graph contrastive learning for uncovering collusive financial fraud. Scientific Reports, 16, Article 14567. https://doi.org/10.1038/s41598-026-58938-5
[28] Ping, W., Jiao, Y., Fan, H., & Zhang, X. (2026). Multimodal fraud detection in financial statements: A trimodal attention network with contrastive evidence chain construction. IEEE Access, 14, 1-17.
Downloads
Published
Issue
Section
License
Copyright (c) 2026 Journal of Mathematical Finance and Risk Management
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
