acceptodds
Under review as a conference paper at ICLR 2027

Capturing Higher-Order Fraud: Multi-view Continual Learning for Streaming Fraud Detection

Abstract

High-order fraud is increasingly prevalent in transaction networks, where fraudulent behaviors only emerge after aggregating weak signals across distant users. Existing graph-based methods typically rely on stacking multiple aggregation layers to capture such high-order patterns. However, in Streaming Fraud Detection (SFD), our theoretical analysis reveals that multi-layer aggregation can amplify the embedding drift bound under continuous concept drift, potentially leading to unstable model updates and degraded fraud detection performance. To address this issue, we propose MC-SFD, a Multi-view hypergraph Continual learning model for Streaming Fraud Detection, which reduces embedding drift through shallow hypergraph aggregation and effectively captures evolving high-order fraud. MC-SFD incorporates an RL-based Adaptive Hypergraph Constructor (RL-AHC) to dynamically evolve hypergraph structures and a Multi-view Personalized Prompt Generator (MPPG) for efficient adaptation with minimal parameter updates. In addition, both RL-AHC and MPPG integrate LLMs for policy initialization and semantic enhancement, respectively. Experiments on four SFD datasets show that MC-SFD consistently outperforms 23 state-of-the-art baselines by 1.63% to 3.71% in AUC.

Primary area:
learning on graphs and other geometries & topologies
Keywords:
Streaming Fraud Detection, High-order Fraud, Multi-view Hypergraph Learning, Graph Continual Learning

Reviews

Among:
Shape:
1234this paper, Top 15%
Figure 1. Mean review rating of the reviewed papers at ICLR 2027. This paper averages 3.00 over 4 reviews, above 85% of the others.
Reviewer_J2jAOpenReview ↗
Rating
4
Confidence
3
Informativeness
2
Presentation
3
Soundness
2
Read review
Paper summary

This paper presents MC-SFD, a multi-view hypergraph continual learning framework for streaming fraud detection. The authors analyze how structural and feature drift propagate through graph aggregation and derive an embedding drift bound, which motivates the use of shallow hypergraph modeling for capturing higher-order fraud patterns. MC-SFD integrates an RL-based adaptive hypergraph constructor with a personalized prompt generator, leveraging LLMs to initialize hypergraph construction and enhance semantic representations. Experiments on four datasets demonstrate consistent AUC improvements over 23 baselines, along with reduced average forgetting.

Critical strengths
  • The theoretical analysis provides a sound foundation for the proposed architecture. Proposition 3.5 separately analyzes the effects of feature and structural drift and explains how deeper aggregation can amplify the embedding drift bound. The empirical comparison across different TGAT depths further supports the practical relevance of this analysis to streaming fraud detection. The proposed components address distinct challenges in the streaming setting. Temporal and frequency hyper-views capture complementary behavioral patterns, while RL-AHC adaptively adjusts their construction as tasks evolve. Meanwhile, MPPG enables lightweight adaptation while keeping the main encoder frozen. Together, these design choices balance higher-order fraud pattern modeling with the need for efficient adaptation across successive tasks.

  • The empirical evaluation is comprehensive and includes several informative comparisons and analyses. MC-SFD improves AUC over the strongest incremental baseline by +1.63% to +3.71% across the four datasets. Comparisons with TGAT-based continual learning variants further help isolate the benefits of the proposed framework under a shared temporal backbone.

Critical weaknesses
  • The notation could be easier to follow. In particular, γ\gamma denotes the amplification factor in the drift analysis and the discount factor in reinforcement learning. Both definitions are clear locally, but using distinct symbols would make reading across sections more convenient.

  • Table 2 reports negative AFR values for several methods on Wikipedia and Reddit, but the manuscript provides no explanation for how these negative values should be interpreted under the stated definition. This omission leaves readers confused about the physical meaning of negative AFR and weakens the credibility of the experimental evaluation.

  • Appendix J suggests that a small neighbor sample and prototype bank are sufficient, yet the paper offers no concrete guidance on hyperparameter selection for unseen datasets. The absence of recommended starting settings (e.g., whether c=5c=5 and k=3k=3 are generally applicable) limits the method's practical utility for new applications.

Questions for authors
  • The symbol γ\gamma is used to denote both the amplification factor in the drift analysis and the discount factor in reinforcement learning. While this is locally clear, it may cause confusion when reading across sections. Would the authors consider using distinct symbols for these two concepts in the final version to improve readability?

  • Table 2 reports negative AFR values for several methods on Wikipedia and Reddit. Could the authors briefly explain how readers should interpret a negative value under the stated definition?

  • Appendix J suggests that a small neighbor sample and prototype bank are sufficient. For readers applying MC-SFD to a new dataset, would c=5c=5 and k=3k=3 be reasonable starting settings?

2 comments

We thank the reviewer for the valuable feedback. We have carefully responded to each weakness and question and incorporated the corresponding revisions into the manuscript, with changes highlighted in blue.

Response to W1&Q1: Clarification of Notation

We thank the reviewer for this valuable suggestion. We agree that using the same symbol for different concepts may cause confusion when reading across sections. To improve clarity and consistency, we have revised the notation to distinguish the two concepts. Specifically, we retain γ\gamma for the embedding drift amplification factor defined in Proposition 3.5, while replacing the RL discount factor with λ\lambda in Section 4.2 (Eq. (16)). We have also updated the corresponding implementation details in Section 5.1 and the relevant appendix descriptions.

These revisions ensure that γ\gamma consistently denotes drift amplification, while λ\lambda denotes reward discounting in reinforcement learning, eliminating potential ambiguity between the theoretical analysis and the RL-AHC formulation.

Response to W2&Q2: Interpretation of Negative AFR

We thank the reviewer for this valuable comment. A negative Average Forgetting Rate (AFR) indicates positive backward transfer rather than performance degradation. To clarify this interpretation, we first recall the definition of AFR in Section 5.1:

AFR=1T∑i=1T(pi,i−pT,i),\mathrm{AFR}=\frac{1}{T}\sum_{i=1}^{T}(p_{i,i}-p_{T,i}),

where pi,ip_{i,i} denotes the AUC on task ii immediately after learning that task, and pT,ip_{T,i} denotes its AUC after learning all TT tasks. A positive AFR indicates that performance on previously learned tasks has declined on average, whereas a negative AFR indicates that their performance has improved after learning subsequent tasks. Therefore, negative AFR values reflect beneficial backward knowledge transfer rather than catastrophic forgetting.

We have explicitly clarified the interpretation of negative AFR in Section 5.1 (Metrics) of the revised manuscript to avoid potential confusion.

Response to W3&Q3: Hyperparameter Selection for New Datasets

We thank the reviewer for this valuable suggestion. Yes, we recommend c=5c=5 and k=3k=3 as reasonable starting settings for new datasets, followed by validation-based tuning.

As shown in the parameter sensitivity analysis, c=5c=5 provides a favorable balance between neighborhood information and computational overhead, since smaller values may miss useful contextual information, while larger values introduce additional noise and computational cost. Similarly, k=3k=3 provides sufficient capacity for personalized prompt generation, as increasing the number of prototypes yields diminishing performance gains while introducing additional overhead.

Although the optimal settings may vary across datasets, these results provide practical guidance for applying MC-SFD to new scenarios.

We sincerely thank the reviewer again for the constructive feedback. We hope our responses and revisions have adequately addressed the concerns. Please let us know if there are any remaining questions or concerns.

Thank you for the authors’ response, which has adequately addressed my concerns. I have decided to maintain my original score and clearly recommend acceptance.

Reviewer_qQ67OpenReview ↗
Rating
3
Confidence
3
Informativeness
3
Presentation
2
Soundness
3
Read review
Paper summary

This paper explores the problem of high-order fraud detection in streaming transaction networks, focusing on capturing long-range dependencies and mitigating catastrophic forgetting that may arise as fraud patterns evolve. The proposed framework, MC-SFD, integrates transaction graphs, temporal hypergraphs, and frequency hypergraphs to capture high-order relationships. It further employs reinforcement learning to dynamically optimize hypergraph construction and incorporates a prompt-based adaptive mechanism to accommodate new tasks.

Critical strengths
  1. This paper explicitly identifies a trade-off in streaming fraud detection between high-order relationship modeling and representation stability. Through a theoretical analysis of embedding drift and an evaluation based on Temporal Graph Attention Networks (TGATs) of varying depths, the authors demonstrate that deeper aggregation amplifies changes occurring at the input level.
  2. MC-SFD integrates adaptive hypergraph construction with a parameter-efficient continual learning approach. It leverages hypergraphs in both the time and frequency domains to capture complementary behavioral patterns, utilizes an RL-AHC mechanism to dynamically optimize the hypergraph structure, and incorporates an MPPG module that enables task adaptation via personalized prompts while keeping the parameters of the main encoder frozen. This comprehensive design is highly compelling and demonstrates solid innovation.
  3. Experimental results across four datasets and multiple baseline models indicate that this method not only achieves superior detection performance but also effectively mitigates the problem of catastrophic forgetting.
Critical weaknesses
  1. Section 4.3 defines task-specific prompt prototypes stored in a prototype bank, while Equations (21)–(22) describe how prompts are constructed within a given task. When calculating pT,ip_{T,i} for the AFR, how are the prototypes from historical tasks selected? Does this process require the use of a task ID? Appendix D notes that for subsequent tasks, the MPPG and the fraud decoder are updated, while the SME remains unchanged. Could you clarify whether the historical prototypes are also frozen? Furthermore, are WpvW_p^v, WsvW_s^v, and the fraud decoder shared across different tasks, or are they stored separately for each task?
  2. Do the execution times reported in Figure 6 include the following stages: LLM-based initialization, generation of semantic embeddings for all nodes, hypergraph reconstruction, drift estimation, and PPO updates? Please provide a detailed breakdown of the time consumed by each component.
  3. Could the authors use synthetic transaction graphs with controllable dependency hop distances to compare the detection performance of MC-SFD against deep TGAT across different fraud orders?
Questions for authors

Please refer to my weaknesses.

3 comments
AuthorsOpenReview ↗

Responses to W1 and W2

We thank the reviewer for the valuable feedback. We have carefully responded to each weakness and question and incorporated the corresponding revisions into the manuscript, with changes highlighted in blue.

Response to W1: Historical Prototype Retrieval and Parameter Sharing

We thank the reviewer for this valuable comment. We have clarified the historical prototype retrieval and parameter sharing mechanisms of MPPG, as summarized below.

(1) Historical Prototype Selection for AFR Evaluation.

Yes, MC-SFD uses the task ID to retrieve the corresponding historical prototypes during AFR evaluation. Specifically, when evaluating a historical task jj after learning task ii (j≤ij \leq i), MC-SFD retrieves the frozen prototypes Pjv\mathbf{P}_j^v from the prototype bank using task ID jj. These prototypes are combined with the latest shared PG weights and fraud decoder to evaluate the model's performance on historical tasks.

We have clarified this evaluation procedure in Section 5.1 (Metrics).

(2) Prototype Freezing and Parameter Sharing across Tasks.

Historical prompt prototypes remain frozen, while the PG weights and fraud decoder are continually updated and shared across tasks. To clarify the training and parameter sharing strategies of different components, we have added Table 1 in Section 4.3, summarized below:

ComponentTraining StrategyParameter Sharing
SMETrained on the first task and then frozenShared across tasks
Prompt prototypes Piv\mathbf{P}_i^vTrained for each task and then frozenTask-specific
PG weights Wpv,WsvW_p^v,W_s^vContinually updatedShared across tasks
Fraud decoderContinually updatedShared across tasks

Specifically, MPPG learns a new set of task-specific prototypes for each incoming task, while keeping historical prototypes frozen in the prototype bank. The SME remains frozen after the first task, whereas the PG weights and fraud decoder are continually updated to adapt to emerging fraud patterns. This procedure is also explicitly clarified in Algorithm 1 (Appendix E).

These clarifications distinguish task-specific prototypes from shared model parameters and specify how historical knowledge is preserved and retrieved during continual learning.

Response to W2: Component-wise Runtime Breakdown

We thank the reviewer for this valuable comment. We have clarified the measurement scope of Figure 6 in Section 5.5 and added a detailed component-wise end-to-end runtime analysis in Appendix H.2.

(1) Clarification of Training Time in Figure 6.

Figure 6 reports the per-batch training time, which includes all non-LLM operations, such as hyper-view reconstruction, drift estimation, PPO updates, SME encoding, and backpropagation. LLM-based initialization and semantic embedding generation are excluded because they are performed at the task level rather than within each training batch. Specifically, LLM initialization is performed only once at the beginning of each task, while semantic embeddings are pre-computed and cached for reuse throughout the task. The runtime of these two components is separately reported in the end-to-end runtime analysis in Appendix H.2 (Table 7).

(2) Component-wise End-to-end Runtime Breakdown.

We measure the complete runtime across 10 sequential tasks, with 5 training epochs per task, on all four datasets. The breakdown of the five components raised by the reviewer is summarized below.

ComponentS-FFSDCreditWikipediaReddit
LLM-based initialization0.36 min0.39 min0.32 min0.38 min
Semantic embedding generation53.21 h176.76 h15.33 h18.74 h
Hypergraph reconstruction1.09 min9.43 min1.36 min3.07 min
Drift estimation0.09 min0.26 min0.03 min0.05 min
PPO computation and updates0.24 min0.24 min0.23 min0.24 min

The results reveal three key observations:

  • LLM-based initialization introduces negligible overhead, as it is performed only once per task (10 times in total), requiring less than 0.4 minutes across all tasks on each dataset.
  • The non-LLM operations introduced by RL-AHC are computationally lightweight. Hypergraph reconstruction, drift estimation, and PPO updates require relatively little time, demonstrating that adaptive hyper-view construction introduces limited additional training overhead.
  • Semantic embedding generation is time-consuming but can be pre-computed and cached. Since the embeddings are generated based on the initial hyper-views of each task, they can be computed before training and reused across subsequent epochs.

A comprehensive runtime breakdown and further discussion are provided in Appendix H.2 (Table 7).

AuthorsOpenReview ↗

Response to W3: Direct Evaluation Across Different Orders

Response to W3: Direct Evaluation Across Different Orders

We thank the reviewer for this insightful suggestion. To directly address this question, we have conducted additional experiments on synthetic transaction graphs with controllable fraud orders, comparing MC-SFD against TGAT with different aggregation depths. The detailed experimental setup and results have been added to Appendix K, "Evaluation Across Fraud Orders on Tide Dataset".

Specifically, we use the public synthetic transaction dataset Tide [1], which supports three controllable fraud patterns (FrontBusinessActivity, RapidFundMovement, and RepeatedOverseasTransfers). Following Definition 3.3, we generate fraud patterns of orders o∈{1,2,3,4}o\in\{1,2,3,4\} by inserting (o−1)(o-1) intermediate accounts (nodes) between the designated endpoints of each fraud pattern. For each order, AUC is computed using fraudulent transactions of that order as positives and benign transactions as negatives. We compare MC-SFD against TGAT with 1–4 aggregation layers (TGAT-1 to TGAT-4) to examine the relationship between fraud order and GNN depth. We additionally include two SOTA continual learning baselines (DSLR+TGAT and RL-GNN+TGAT) under the same protocol.

The results in Appendix K (Table 10) are summarized below (mean AUC, %):

Methodo=1o=1o=2o=2o=3o=3o=4o=4Overall
TGAT-195.2493.6592.9392.9093.74
TGAT-295.2895.0693.2992.9694.12
TGAT-394.3794.3394.0692.0593.64
TGAT-494.0693.8393.8792.3293.53
DSLR+TGAT97.4596.0496.1395.9696.36
RL-GNN+TGAT97.5195.9896.1796.0196.40
MC-SFD99.3498.7898.8298.5698.74

The results reveal two key findings:

  • (1) Increasing TGAT depth does not consistently improve high-order fraud detection. When the fraud order exceeds the aggregation depth, TGAT generally exhibits performance degradation. Moreover, deeper TGAT variants (TGAT-3 and TGAT-4) do not consistently outperform shallower ones, which is consistent with the embedding drift amplification discussed in Proposition 3.5.
  • (2) MC-SFD achieves the highest AUC at all four fraud orders and overall, outperforming the strongest baseline by +1.83%, +2.74%, +2.65%, and +2.55% at orders 1–4, respectively, and +2.34% overall. These results demonstrate that MC-SFD effectively captures high-order fraud patterns through shallow multi-view hypergraph aggregation without requiring deeper GNN layers.

These additional experiments directly validate the effectiveness of MC-SFD in detecting fraud patterns across different orders.

[1] van den Beukel, Montijn, Jože Martin Rožanec, and Ana-Lucia Varbanescu. "Tide: A customisable dataset generator for anti-money laundering research." arXiv e-prints (2026): arXiv-2603.

We sincerely thank the reviewer again for the constructive feedback. We hope our responses and revisions have adequately addressed the concerns. Please let us know if there are any remaining questions or concerns.

Thank you for your clear explanation and additional experiments. I have decided to maintain my score.

Reviewer_n7ZUOpenReview ↗
Rating
3
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

This paper proposed MC-SFD for Streaming Fraud Detection based on a multi-view hyper-graph continue learning model. To overcome the difficulties with structual inflexibility and mitigate stability-plasticity trade-off, MC-FSD uses RL-AHC constructs hyper-views through reinforcement learning with LLMassisted initialization, tracking evolving fraud patterns dynamically. Moreover, MPPG is updated to enable fast adaptation to new fraud patterns with LLM-assisted semantic embeddings during continual learning.

Critical strengths

S1: The structure of this paper is really good, where the challenges proposed by authors can be resolved by the methods in this paper.

S2: It is clear for the three parts of this framework working in structural, feature and LLM.

S3: The ablation study contains main modules and the design is detailed, which show the performance gains come from.

Critical weaknesses

W1: I see that your method is similar to MH-LGC [1], both you and that paper use multiview hypergraph fraud detection and LLM assists components for fraud detation, you should clarify the difference.

W2: Similar to W1, the authors are encouraged to compare the performance between MC-FSD and MH-LGC.

W3: The paper does not show the evaluation of different fraud orders.

[1]Ou, R., Zhu, K., Zhang, N., Li, J., Chen, C., Xu, Y., & Jiang, C. (2026). Targeting Borderline Fraudsters: Multi-View Hypergraph Fraud Detection with LLM-Guided Contrastive Learning. Proceedings of the AAAI Conference on Artificial Intelligence, 40(18), 15591–15599. https://doi.org/10.1609/aaai.v40i18.38588

Questions for authors

Q1: I have a question about the theoretical motivation for using shallow hypergraph aggregation. Proposition 3.5 shows that the embedding drift bound depends not only on GNN depth but also on the spectral norms of the aggregation and weight matrices. Since MC-SFD uses a different aggregation mechanism. Could the authors clarify how Proposition 3.5 supports the claim that MC-SFD reduces EDB compared with deeper GNNs?

Q2: The LLM embeddings are computed and cached using the initial hypergraphs, but RL-AHC keeps updating the hypergraph structures during training. Wouldn't this mean that the cached embeddings might no longer match the current neighborhoods? Could this affect how well MPPG works with the updated hypergraphs?

5 comments
AuthorsOpenReview ↗

Response to W1&W2: Additional Baseline, MH-LGC

We thank the reviewer for the valuable feedback. We have carefully responded to each weakness and question and incorporated the corresponding revisions into the manuscript, with changes highlighted in blue.

Response to W1&W2: Additional Baseline, MH-LGC

Thank you for this valuable suggestion. We have included MH-LGC (AAAI 2026) as an additional baseline under the same continual learning protocol in Section 5.2 and further clarified the differences between the two methods in Appendix P. We summarize the key differences and experimental results below.

(1) Main Differences between MC-SFD and MH-LGC.

  1. Different Scenarios. MH-LGC (AAAI 2026) focuses on non-streaming fraud detection, whereas MC-SFD addresses streaming fraud detection, where transaction graphs and fraud patterns continuously evolve. MC-SFD explicitly models sequential tasks and incrementally adapts to newly emerging fraud patterns.

  2. Different Research Problems. MH-LGC (AAAI 2026) primarily targets borderline fraudsters whose fraudulent behaviors are difficult to distinguish from benign ones. In contrast, MC-SFD focuses on detecting evolving high-order fraud patterns in streaming environments, while addressing the challenges of embedding drift and catastrophic forgetting.

  3. Theoretical Analysis. Compared with MH-LGC (AAAI 2026), which provides limited theoretical analysis, MC-SFD formalizes fraud orders and establishes Embedding Drift Bounds (EDB), revealing how deep GNN aggregation amplifies representation drift under streaming concept drift. We further extend the analysis to the proposed multi-view architecture, providing theoretical support for capturing high-order fraud through shallow hypergraph aggregation.

  4. Reinforcement Learning for Adaptive Hypergraph Construction. Unlike MH-LGC (AAAI 2026), which relies on predefined hypergraph construction rules, MC-SFD introduces RL-AHC to dynamically optimize temporal and frequency tolerances. Specifically, RL-AHC combines LLM-assisted initialization with reinforcement learning to adapt hypergraph structures based on current graph statistics, estimated embedding drift, and multi-objective rewards that balance detection performance, structural complexity, and policy stability.

  5. Continual Learning with Lightweight Parameter Updates. Unlike MH-LGC (AAAI 2026), which is designed for non-streaming settings without continual learning, MC-SFD introduces MPPG to enable efficient continual adaptation while mitigating catastrophic forgetting. Specifically, MPPG freezes the main encoder (SME) after the first task and learns task-specific prompt prototypes for each view, while continually updating lightweight prompt generation parameters. Historical prototypes are frozen and preserved in a prototype bank to retain previously learned knowledge.

  6. Different Roles of LLMs. MH-LGC (AAAI 2026) employs LLMs to provide semantic guidance for contrastive learning, improving the identification of borderline fraudsters. In contrast, MC-SFD integrates LLMs into two key components: (a) initializing the hyper-view construction policy and action space in RL-AHC, and (b) extracting view-specific neighborhood semantics to guide personalized prototype composition in MPPG. These designs leverage LLM knowledge for both adaptive hypergraph construction and efficient continual adaptation.

(2) Additional Comparison with MH-LGC.

We have included MH-LGC as an additional baseline and reported its results in Table 3 under the same continual learning protocol. The comparison is summarized below.

DatasetMethodAUC ↑AFR ↓
S-FFSDMH-LGC69.935.57
MC-SFD74.232.73
CreditMH-LGC86.017.21
MC-SFD90.081.27
WikipediaMH-LGC79.264.75
MC-SFD85.61-1.53
RedditMH-LGC61.782.57
MC-SFD64.71-1.50

MC-SFD consistently outperforms MH-LGC across all four datasets, with AUC improvements ranging from +2.93% to +6.35% and substantially lower AFR. These results demonstrate the effectiveness of MC-SFD in capturing evolving fraud patterns while mitigating catastrophic forgetting.

AuthorsOpenReview ↗

Response to W3: Direct Evaluation Across Different Orders

Response to W3: Direct Evaluation Across Different Orders

We thank the reviewer for this insightful comment. We have added Appendix K, "Evaluation Across Fraud Orders on Tide Dataset" to directly evaluate the detection performance across different orders.

Specifically, we conduct additional experiments on the public synthetic transaction dataset Tide [1], which supports three controllable fraud patterns (FrontBusinessActivity, RapidFundMovement, and RepeatedOverseasTransfers). Following Definition 3.3, we evaluate fraud patterns of orders o∈{1,2,3,4}o\in\{1,2,3,4\} with (o−1)(o-1) intermediate accounts (nodes) between the designated endpoints of each fraud pattern. For each order, AUC is computed using fraudulent transactions of that order as positives and benign transactions as negatives. We compare MC-SFD against TGAT with 1–4 aggregation layers and two SOTA continual learning baselines (DSLR+TGAT and RL-GNN+TGAT) under the same protocol.

The results in Appendix K (Table 10) are summarized below (mean AUC, %):

Methodo=1o=1o=2o=2o=3o=3o=4o=4Overall
TGAT-195.2493.6592.9392.9093.74
TGAT-295.2895.0693.2992.9694.12
TGAT-394.3794.3394.0692.0593.64
TGAT-494.0693.8393.8792.3293.53
DSLR+TGAT97.4596.0496.1395.9696.36
RL-GNN+TGAT97.5195.9896.1796.0196.40
MC-SFD99.3498.7898.8298.5698.74

MC-SFD achieves the highest AUC at all four fraud orders and overall, outperforming the strongest baseline by +1.83%, +2.74%, +2.65%, and +2.55% at orders 1–4, respectively, and +2.34% overall. Notably, MC-SFD consistently outperforms both deeper TGAT variants and SOTA continual learning baselines, demonstrating its effectiveness in capturing high-order fraud patterns through shallow multi-view hypergraph aggregation.

[1] van den Beukel, Montijn, Jože Martin Rožanec, and Ana-Lucia Varbanescu. "Tide: A customisable dataset generator for anti-money laundering research." arXiv e-prints (2026): arXiv-2603.

AuthorsOpenReview ↗

Response to Q1: EDB Analysis of MC-SFD

Response to Q1: EDB Analysis of MC-SFD

We thank the reviewer for this insightful question.

(1) The reason we primarily focus on GNN depth rather than the spectral norms of the aggregation and weight matrices.

We agree that the Embedding Drift Bound (EDB) depends on both aggregation depth and the spectral norms of the aggregation and weight matrices. As established in Proposition 3.5 (Eq. (4)):

\leq \gamma^{L}\|\Delta\mathbf{X}_{i+1}\|_F + \sum_{l=1}^{L} \gamma^{L-l}L_\sigma\alpha \|\mathbf{Z}_i^{l-1}\|_F \|\Delta\mathbf{A}_{i+1}\|_{\mathrm{sp}},$$ where $\gamma=L_\sigma\beta\alpha$. While the spectral norms determine the per-layer amplification factor $\gamma$, **the aggregation depth $L$ has a more cumulative impact on the EDB**, as it determines both the exponent of the amplification factor and the number of accumulated structural-drift terms. In particular, when $\gamma>1$, increasing $L$ can exponentially amplify embedding drift even if the spectral norms remain bounded and unchanged. This makes aggregation depth a particularly important factor in high-order fraud detection, where conventional GNNs require deeper aggregation to capture distant dependencies (Lemma 3.4). To further support this analysis, Appendix C provides empirical estimates of the layer-wise amplification factors $\gamma$ for seven representative GNN backbones across four datasets. The results show that empirical amplification factors exceeding 1 (i.e., $\gamma>1$) are prevalent among standard GNNs, supporting the practical relevance of depth-induced drift amplification. Therefore, **aggregation depth plays a critical role in the cumulative amplification of embedding drift**, motivating MC-SFD to capture high-order dependencies through shallow multi-view hypergraph aggregation rather than increasing GNN depth. **(2) EDB Analysis of MC-SFD's Multi-view Aggregation Architecture.** To further characterize the EDB under MC-SFD's multi-view aggregation architecture, we have added **Appendix D, "Embedding Drift Bound Analysis of MC-SFD"**, which extends Proposition 3.5 to our proposed model. Specifically, we first derive the EDB for each of the three views, including the Transaction Graph View, Time Hyper-view, and Frequency Hyper-view. We then analyze how embedding drift propagates through inter-view attention and derive the overall EDB of MC-SFD. The key analyses are summarized as follows: **(i) Transaction Graph View:** We apply Proposition 3.5 with a single-layer TGAT, incorporating attention weights into a dynamic aggregation matrix (Eq. (43)). **(ii) Time and Frequency Hyper-Views:** We represent the successive intra-hyperedge and inter-hyperedge attention operations using an effective hypergraph aggregation matrix, capturing the effects of hypergraph structural changes and attention weight variations on embedding drift (Eq. (47)). **(iii) Inter-View Fusion:** We further analyze how variations in inter-view attention weights contribute to the overall embedding drift (Eqs. (48)–(50)). Combining these analyses, we derive the overall EDB of MC-SFD (Eq. (51)). The key theoretical insight is that **MC-SFD avoids depth-dependent drift amplification while capturing high-order relations.** Unlike deep GNNs discussed in Proposition 3.5, whose EDB can increase with aggregation depth through the $\gamma^L$ factor and accumulated structural-drift terms, MC-SFD captures high-order dependencies through hyperedges without stacking multiple graph message-passing layers. The empirical results in Section 5.3 (Figure 4) also demonstrate that MC-SFD achieves lower measured embedding drift than deeper TGAT models while maintaining superior fraud detection performance. We believe the additional analysis clarifies how Proposition 3.5 motivates shallow hypergraph aggregation and provides theoretical support for MC-SFD in mitigating embedding drift compared with deeper GNNs.
Reviewer_wYePOpenReview ↗
Rating
2
Confidence
3
Informativeness
2
Presentation
2
Soundness
2
Read review
Paper summary

This paper studies high-order fraud relationship modeling and continual learning in the Streaming Fraud Detection (SFD) setting. The authors point out that traditional GNNs often need to increase the number of message-passing layers to capture long-range fraud relationships, but deeper message passing may exacerbate Embedding Drift and affect the stability of models across continual tasks. To address this issue, the paper proposes MC-SFD, which integrates the Transaction View, Time Hyper-view, and Frequency Hyper-view through a Multi-view Hypergraph Encoder (SME), aiming to capture high-order relationships through shallow aggregation. It also introduces a reinforcement learning-based adaptive hypergraph construction module (RL-AHC), which uses PPO to dynamically adjust hypergraph construction parameters, and a Multi-view Personalized Prompt Generator (MPPG), which combines LLM semantic representations and Prompt Prototypes to achieve lightweight continual adaptation. The authors also theoretically analyze the relationship between GNN depth and representation drift, and conduct experiments on four datasets: S-FFSD, Credit, Wikipedia, and Reddit. The experimental results show that MC-SFD achieves promising results in terms of overall detection performance and continual learning stability.

Critical strengths
  1. This paper focuses on high-order fraud relationship modeling and continual learning in the Streaming Fraud Detection (SFD) setting. It attempts to address the potential Embedding Drift problem caused by increasing the number of message-passing layers in traditional GNNs to capture long-range relationships, which is a meaningful research problem.
  2. The paper proposes MC-SFD, which combines a Multi-view Hypergraph Encoder (SME), a reinforcement learning-based adaptive hypergraph construction module (RL-AHC), and a Multi-view Personalized Prompt Generator (MPPG). The authors conduct extensive baseline comparisons, ablation studies, and sensitivity analyses on four datasets, providing a relatively comprehensive experimental evaluation.
Critical weaknesses
  1. The theoretical analysis defines an Embedding Drift Bound for conventional message-passing GNNs, whereas the proposed SME consists of a Transaction Graph, two Hypergraphs, and multi-level Attention operations. The current theoretical analysis does not sufficiently account for the effects of hypergraph structural changes, attention weight variations, and multi-view fusion on representation drift. Therefore, there may be a gap between the scope of the theoretical analysis and the actual model architecture.

  2. The baseline comparisons may be incomplete. The authors cite MH-LGC (AAAI 2026) in the related work, which already adopts a Transaction View, Time Hyper-view, Frequency Hyper-view, and LLM-assisted semantic learning. This makes its basic architecture highly similar to that of MC-SFD. Although the two methods focus on different settings, it would still be worthwhile to adapt MH-LGC to the same continual learning protocol to clarify the actual contributions of MC-SFD over existing multi-view hypergraph-based fraud detection methods. However, MH-LGC is not included in the baseline comparisons.

  3. High-order fraud detection is the central motivation of this paper, but the current experiments mainly evaluate the model using overall AUC, AFR, and Embedding Drift. They do not directly verify whether the model actually improves high-order fraud detection. Whether users with similar transaction times or interaction frequencies really exhibit coordinated fraudulent behavior also requires further experimental validation.

  4. The necessity of the specific mechanisms used in RL-AHC and MPPG needs further experimental validation. The current experiments mainly demonstrate the effectiveness of combining these modules, but there are still gaps in establishing the necessity of their specific designs. RL-AHC only optimizes two continuous parameters, namely temporal and frequency tolerances, but is not compared with conventional optimization methods such as Grid Search and Bayesian Optimization. Therefore, it is difficult to determine whether PPO is necessary. The ablation study of MPPG shows that the relevant components contribute to performance, but it does not compare MPPG with lightweight adaptation methods such as ordinary Prototype Learning or Adapters. The individual contributions of LLM semantic representations, prototype learning, and parameter freezing have also not been sufficiently disentangled. Overall, the current experiments demonstrate the effectiveness of the combined modules but do not sufficiently establish the necessity of the specific mechanisms.

  5. Some technical details in the paper remain unclear. For example, the specific hypergraph construction rules and the process of extracting and transforming LLM representations into vectors are not sufficiently described. This may affect the credibility of the paper.

Questions for authors
  1. I am a little confused about the relationship between the theoretical analysis and the actual model. The Embedding Drift theory in the paper is mainly derived for the message-passing process of conventional GNNs, but the actual SME uses multiple hypergraphs and multi-level Attention. Can this theory directly explain the representation drift of SME? In particular, could changes in hypergraph structures and attention weights across tasks introduce additional representation drift? It seems that the current theoretical analysis does not fully cover the actual model.

  2. I noticed that MH-LGC (AAAI 2026) already uses a Transaction View, Time Hyper-view, Frequency Hyper-view, and LLM-assisted semantic learning, making its basic architecture quite similar to that of this paper. What exactly is the main novelty of MC-SFD compared with MH-LGC? Why was MH-LGC not included as a baseline? Could the authors compare the two methods under the same continual learning setting to see how much improvement the newly introduced RL-AHC and MPPG actually bring?

  3. The paper repeatedly emphasizes capturing high-order fraud relationships through hypergraphs. However, do users with similar transaction times or interaction frequencies necessarily exhibit coordinated fraudulent behavior? The overall AUC improvement does not seem sufficient to directly demonstrate this. Have the authors conducted any further analysis of the distribution of fraudulent users within hyperedges, or compared detection performance across different relationship orders?

  4. I have a question about the necessity of RL-AHC and MPPG. RL-AHC mainly adjusts two parameters, temporal and frequency tolerances, so why is PPO necessary here? Could simpler methods such as Grid Search or Bayesian Optimization achieve similar results? Also, does MPPG really offer advantages over ordinary Prototype Learning or Adapter-based methods? The current ablation studies show that these modules contribute to performance, but they do not seem to explain why these specific designs are necessary.

  5. Some implementation details are still unclear to me. For example, what specific rules are used to construct the Time Hypergraph and Frequency Hypergraph? How exactly are the temporal and frequency tolerances defined? How are the texts generated by the LLM converted into vectors? Also, it would be helpful if the authors could clarify the PPO training configuration and which data split is used to calculate the reward. These details directly affect whether other researchers can reproduce the proposed method.

5 comments
AuthorsOpenReview ↗

Response to W1&Q1: Theoretical Analysis for Actual Model

We thank the reviewer for the valuable feedback. We have carefully responded to each weakness and question and incorporated the corresponding revisions into the manuscript, with changes highlighted in blue.

Response to W1&Q1: Theoretical Analysis for Actual Model

Thank you for this valuable suggestion. Current theoretical analysis (Proposition 3.5) primarily serves as the theoretical motivation for the shallow design of MC-SFD, revealing that increasing GNN depth to capture high-order fraud patterns can substantially amplify embedding drift in streaming environments. However, we agree that Proposition 3.5 primarily focuses on conventional message-passing GNNs and does not directly characterize our actual model.

To address this concern, we have added Appendix D, "Embedding Drift Bound Analysis of MC-SFD", which extends the embedding drift bound (EDB) analysis to our actual model. Hypergraph structural changes and attention weight variations are captured by the structural drift terms of the corresponding views, while changes in inter-view attention weights are captured by the fusion drift term.

Detailed analysis can be found in Appendix D and we summarize the key derivations below.

(1) EDB in Transaction graph view. Since MC-SFD adopts a single-layer TGAT for the graph view, the changes of attention weights can be incorporated into a dynamic aggregation matrix, as discussed in Appendix A.2. Therefore, we can apply Proposition 3.5 with L=1L=1 to derive the graph-view EDB (Eq. (43)):

\leq \gamma^{G}\|\Delta\mathbf{X}_{i+1}^{G}\|_F + L_\sigma\alpha^{G}\|\mathbf{X}_i^{G}\|_F \|\Delta\mathbf{A}_{i+1}^{G}\|_{\mathrm{sp}}.$$ The two terms capture feature drift and structural drift, respectively, with the latter accounting for the effect of attention weight variations. **(2) EDB in Time and frequency hyper-views.** Each hyper-view performs two successive attention operations: intra-hyperedge attention (node-to-hyperedge) and inter-hyperedge attention (hyperedge-to-node). These operations can be combined into a single effective hypergraph aggregation matrix (Eqs. (44)–(46)): $$\mathbf{Z}_i^v=\mathbf{A}_i^v\mathbf{X}_i^v\mathbf{W}^v, \quad \mathbf{A}_i^v= \mathbf{A}_{H\rightarrow N,i}^v \mathbf{A}_{N\rightarrow H,i}^v, \quad v\in\{T,F\}.$$ Based on this formulation, we derive the EDB for each hyper-view (Eq. (47)): $$\|\Delta\mathbf{Z}_{i+1}^v\|_F \leq \gamma^v\|\Delta\mathbf{X}_{i+1}^v\|_F + \alpha^v\|\mathbf{X}_i^v\|_F \|\Delta\mathbf{A}_{i+1}^v\|_{\mathrm{sp}}.$$ The two terms capture feature drift and structural drift, respectively, with the latter accounting for the effects of hypergraph structural change and attention weight variations. **(3) EDB in Inter-view fusion.** We further analyze how drift propagates through inter-view attention. Let $\mathbf{D}_i^v$ denote the diagonal matrix of attention weights assigned to view $v\in\mathcal{V}=\{G,T,F\}$. The fused embedding drift can be decomposed as (Eq. (49)): $$\Delta\mathbf{Z}_{i+1} = \sum_{v\in\mathcal{V}} \mathbf{D}_{i+1}^v \Delta\mathbf{Z}_{i+1}^v + \sum_{v\in\mathcal{V}} \Delta\mathbf{D}_{i+1}^v \mathbf{Z}_i^v.$$ The first term captures view-level embedding drift, while the second captures variations in inter-view attention weights across tasks (i.e., the effect of multi-view fusion). Since these attention weights assigned to three views are normalized by softmax, the view-level drift of each node is a weighted combination of its three view-specific drifts rather than their direct accumulation. **(4) Overall EDB of MC-SFD.** Combining the above results, we obtain the overall EDB of MC-SFD (Eq. (51)): $$\|\Delta\mathbf{Z}_{i+1}\|_F \leq {} \underbrace{\sum_{v\in\mathcal{V}} \gamma^v\|\Delta\mathbf{X}_{i+1}^v\|_F}_{\text{Feature Drift}} + \underbrace{\sum_{v\in\mathcal{V}} \kappa^v\|\mathbf{X}_i^v\|_F \|\Delta\mathbf{A}_{i+1}^v\|_{\mathrm{sp}}}_{\text{Structural Drift}} + \underbrace{\sum_{v\in\mathcal{V}} \|\Delta\mathbf{D}_{i+1}^v\|_{\mathrm{sp}} \|\mathbf{Z}_i^v\|_F}_{\text{Fusion Drift}}.$$ The fusion drift term reflects the effects of evolving features and structures on inter-view attention weights rather than an independent source of drift. **(5) Discussion**. The key theoretical insight is that **MC-SFD avoids depth-dependent drift amplification while capturing high-order relations.** Unlike deep GNNs discussed in Proposition 3.5, whose EDB can increase with aggregation depth through the $\gamma^L$ factor and accumulated structural-drift terms, MC-SFD captures high-order dependencies through hyperedges without stacking multiple graph message-passing layers. The empirical results in Section 5.3 (Figure 4) also demonstrate that MC-SFD achieves lower measured embedding drift than deeper TGAT models while maintaining superior fraud detection performance.
AuthorsOpenReview ↗

Response to W2&Q2: Additional Baseline, MH-LGC

Response to W2&Q2: Additional Baseline, MH-LGC

Thank you for this valuable suggestion. We have included MH-LGC (AAAI 2026) as an additional baseline under the same continual learning protocol in Section 5.2 and further clarified the differences between the two methods in Appendix P. We summarize the key differences and experimental results below.

(1) Main Differences between MC-SFD and MH-LGC.

  1. Different Scenarios. MH-LGC (AAAI 2026) focuses on non-streaming fraud detection, whereas MC-SFD addresses streaming fraud detection, where transaction graphs and fraud patterns continuously evolve. MC-SFD explicitly models sequential tasks and incrementally adapts to newly emerging fraud patterns.

  2. Different Research Problems. MH-LGC (AAAI 2026) primarily targets borderline fraudsters whose fraudulent behaviors are difficult to distinguish from benign ones. In contrast, MC-SFD focuses on detecting evolving high-order fraud patterns in streaming environments, while addressing the challenges of embedding drift and catastrophic forgetting.

  3. Theoretical Analysis. Compared with MH-LGC (AAAI 2026), which provides limited theoretical analysis, MC-SFD formalizes fraud orders and establishes Embedding Drift Bounds (EDB), revealing how deep GNN aggregation amplifies representation drift under streaming concept drift. We further extend the analysis to the proposed multi-view architecture, providing theoretical support for capturing high-order fraud through shallow hypergraph aggregation.

  4. Reinforcement Learning for Adaptive Hypergraph Construction. Unlike MH-LGC (AAAI 2026), which relies on predefined hypergraph construction rules, MC-SFD introduces RL-AHC to dynamically optimize temporal and frequency tolerances. Specifically, RL-AHC combines LLM-assisted initialization with reinforcement learning to adapt hypergraph structures based on current graph statistics, estimated embedding drift, and multi-objective rewards that balance detection performance, structural complexity, and policy stability.

  5. Continual Learning with Lightweight Parameter Updates. Unlike MH-LGC (AAAI 2026), which is designed for non-streaming settings without continual learning, MC-SFD introduces MPPG to enable efficient continual adaptation while mitigating catastrophic forgetting. Specifically, MPPG freezes the main encoder (SME) after the first task and learns task-specific prompt prototypes for each view, while continually updating lightweight prompt generation parameters. Historical prototypes are frozen and preserved in a prototype bank to retain previously learned knowledge.

  6. Different Roles of LLMs. MH-LGC (AAAI 2026) employs LLMs to provide semantic guidance for contrastive learning, improving the identification of borderline fraudsters. In contrast, MC-SFD integrates LLMs into two key components: (a) initializing the hyper-view construction policy and action space in RL-AHC, and (b) extracting view-specific neighborhood semantics to guide personalized prototype composition in MPPG. These designs leverage LLM knowledge for both adaptive hypergraph construction and efficient continual adaptation.

(2) Additional Comparison with MH-LGC.

We have included MH-LGC as an additional baseline and reported its results in Table 3 under the same continual learning protocol. The comparison is summarized below.

DatasetMethodAUC ↑AFR ↓
S-FFSDMH-LGC69.935.57
MC-SFD74.232.73
CreditMH-LGC86.017.21
MC-SFD90.081.27
WikipediaMH-LGC79.264.75
MC-SFD85.61-1.53
RedditMH-LGC61.782.57
MC-SFD64.71-1.50

MC-SFD consistently outperforms MH-LGC across all four datasets, with AUC improvements ranging from +2.93% to +6.35% and substantially lower AFR. These results demonstrate the effectiveness of MC-SFD in capturing evolving fraud patterns while mitigating catastrophic forgetting.

AuthorsOpenReview ↗

Response to W3&Q3: Direct Evaluation on High-order Fraud Detection

Response to W3&Q3: Direct Evaluation on High-order Fraud Detection

We thank the reviewer for this insightful comment. We agree that overall AUC, AFR, and embedding-drift results do not directly demonstrate the ability to detect high-order fraud. To address this concern, we have added Appendix K, "Evaluation Across Fraud Orders on Tide Dataset", including order-specific detection experiments and a shortest-path analysis examining whether temporal and frequency similarities help connect users involved in the same coordinated fraud patterns.

(1) Direct Evaluation across Different Fraud Orders.

We conduct additional experiments on the public synthetic transaction dataset Tide [1], which supports three controllable fraud patterns (FrontBusinessActivity, RapidFundMovement, and RepeatedOverseasTransfers). Following Definition 3.3, we evaluate fraud patterns of orders o∈{1,2,3,4}o\in\{1,2,3,4\} with (o−1)(o-1) intermediate accounts (nodes) between the designated endpoints of each fraud pattern. For each order, AUC is computed using fraudulent transactions of that order as positives and benign transactions as negatives. We compare MC-SFD against TGAT with 1–4 aggregation layers and two SOTA continual learning baselines (DSLR+TGAT and RL-GNN+TGAT) under the same protocol.

The results in Appendix K (Table 10) are summarized below (mean AUC, %):

Methodo=1o=1o=2o=2o=3o=3o=4o=4Overall
TGAT-195.2493.6592.9392.9093.74
TGAT-295.2895.0693.2992.9694.12
TGAT-394.3794.3394.0692.0593.64
TGAT-494.0693.8393.8792.3293.53
DSLR+TGAT97.4596.0496.1395.9696.36
RL-GNN+TGAT97.5195.9896.1796.0196.40
MC-SFD99.3498.7898.8298.5698.74

MC-SFD achieves the highest AUC at all four fraud orders and overall, outperforming the strongest baseline by +1.83%, +2.74%, +2.65%, and +2.55% at orders 1–4, respectively, and +2.34% overall. Notably, MC-SFD consistently outperforms both deeper TGAT variants and SOTA continual learning baselines, demonstrating its effectiveness in capturing high-order fraud patterns through shallow multi-view hypergraph aggregation.

(2) Whether users with similar transaction times or interaction frequencies really exhibit coordinated fraudulent behavior?

To address this question, we investigate whether the temporal and frequency relationships used for hypergraph construction can effectively connect users involved in the same fraudulent patterns. Specifically, we measure the average shortest path between the two endpoints of each fraud pattern in the Tide dataset. Nodes belonging to the same hyperedge are treated as directly connected (one hop). By comparing path lengths before and after introducing the hyper-views, we evaluate whether temporal and frequency similarities can reveal high-order coordinated fraudulent behavior that is difficult to capture through the original transaction graph.

The results in Appendix K (Table 11) are summarized below:

View Configurationo=1o=1o=2o=2o=3o=3o=4o=4
Transaction Graph (GG)1.002.003.004.00
GG + Time Hyper-view1.001.561.932.56
GG + Frequency Hyper-view1.001.341.782.37
GG + Both Hyper-views1.001.261.361.67

The results show that both hyper-views substantially shorten the connection paths between users involved in the same fraud patterns. For instance, at order 4, the average shortest path decreases from 4.00 to 2.56 and 2.37 hops with the time and frequency hyper-views, respectively, and further to 1.67 hops when both are combined. These findings suggest that similar transaction times and interaction frequencies can serve as useful structural cues for connecting users involved in coordinated fraudulent behavior, even when they are distant in the original transaction graph. Together with the improved detection performance across different fraud orders, these results support the effectiveness of the two complementary hyper-views in capturing high-order fraud patterns.

[1] van den Beukel, Montijn, Jože Martin Rožanec, and Ana-Lucia Varbanescu. "Tide: A customisable dataset generator for anti-money laundering research." arXiv e-prints (2026): arXiv-2603.

From OpenReview, CC BY 4.0. Authors as signed there; shown unedited.

Related papers

Loading the map…

Discussion (0)

Sign in to comment.