- 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, 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 and are generally applicable) limits the method's practical utility for new applications.
Questions for authors
-
The symbol 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 and be reasonable starting settings?
2 comments
Thank you for the authors’ response, which has adequately addressed my concerns. I have decided to maintain my original score and clearly recommend acceptance.
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 γ for the embedding drift amplification factor defined in Proposition 3.5, while replacing the RL discount factor with λ 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 γ consistently denotes drift amplification, while λ 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=T1∑i=1T(pi,i−pT,i),
where pi,i denotes the AUC on task i immediately after learning that task, and pT,i denotes its AUC after learning all T 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=5 and k=3 as reasonable starting settings for new datasets, followed by validation-based tuning.
As shown in the parameter sensitivity analysis, c=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=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.