Empowering Credit Risk Detection in Weixin Pay with Billion-Scale Deep Graph Learning
Not on the map. Why?
Abstract (arXiv)
Credit risk detection, particularly mitigating individual fraud, is crucial for maintaining the stability of digital financial ecosystems. Accurately identifying credit fraud among billions of users is critical for minimizing financial losses and safeguarding the sustainability of inclusive financial services. Given that credit fraud risks are often concealed within heterogeneous user-risk graphs, Graph Neural Networks (GNNs) have emerged as an effective tool for risk mining by capturing complex dependencies. To address the scalability bottleneck of industrial GNNs, distributed training based on subgraphs is indispensable. However, existing strategies often compromise topological integrity for load balancing. This can be catastrophic for risk detection, as it indiscriminately severs the long-tail evidence chains essential for risk propagation. Overlapping subgraphs can restore severed risk contexts but inevitably introduce redundancy and noise, while overlooking the representation alignment across different local subgraphs. In this paper, we propose a risk-aware overlapping subgraph learning framework for large-scale credit risk detection. We first construct base partitions to ensure load balance. Then, we perform budget-constrained sampling that selects informative long-tail nodes, thereby preserving critical risk diffusion patterns while filtering out noise. To mitigate representation inconsistency, we design a cross-subgraph consistency alignment mechanism. By enforcing alignment constraints on the overlapping nodes, we harmonize the local representations into a globally consistent latent space. Extensive experiments on Weixin Pay's production dataset demonstrate that our model significantly outperforms existing strategies for risk detection, offering a scalable and effective solution for industrial graph learning.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 63 references that are in the map. First posted on arXiv 3 Aug 2026.
Builds on
20 of 63 references.
References · 20
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2017Graph Attention Networkscited by 8,923
- 2017Inductive Representation Learning on Large Graphscited by 6,320
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2019Simplifying Graph Convolutional Networkscited by 1,477
- 2020Heterogeneous Graph Transformercited by 582
- 2019Cluster-GCN: An Efficient Algorithm for Training Deep and Large Graph Convolutional Networkscited by 541
- 2021Deep Long-Tailed Learning: A Surveycited by 417
- 2017Gate-Variants of Gated Recurrent Unit (GRU) Neural Networkscited by 242
- 2023NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classificationcited by 210
- 2018Large-Scale Learnable Graph Convolutional Networkscited by 113
- 2020PyTorch Distributed: Experiences on Accelerating Data Parallel Trainingcited by 90
8 more
- 2020Scalable Graph Neural Networks via Bidirectional Propagationcited by 87
- 2023Temporal and Heterogeneous Graph Neural Network for Financial Time Series Predictioncited by 30
- 2024Semi-supervised Credit Card Fraud Detection via Attribute-Driven Graph Representationcited by 26
- 2024Graph Neural Networks for Financial Fraud Detection: A Reviewcited by 25
- 2020Ripple Walk Training: A Subgraph-based training framework for Large and Deep Graph Neural Networkcited by 19
- 2024Hypergraph Self-supervised Learning with Sampling-efficient Signalscited by 7
- 2022From Node Interaction to Hop Interaction: New Effective and Scalable Graph Learning Paradigmcited by 4
- 2017Visual analytics for networked-guarantee loans risk managementcited by 3
Built on by
Not cited yet.