- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper proposes a subgraph-guided adaption method for log anomaly detection across domains and the extensive experiments are conducted to show the effectiveness and efficiency across various settings, including single-domain log detection, cross-domain log detection, few-shot setting, and adaptation efficiency.
Critical strengths
-
This paper proposes a subgraph-guided adaption method for log anomaly detection across domains.
-
The experimental resutls demonstrate the efficiency during the domain adaptation.
-
The proposed method outperform most of the baseline methods across multiple settings.
Critical weaknesses
- The log constructed graph is usually small. In the paper, the experiments are conducted on Thunderbird and BGL datasets, and according to [1], the number of nodes for these two graphs are 16 and 10, respectively. Many existing works have explored the effectiveness of the graph-based methods. This drives me to question about the necessity of learning which local event structure to retrain for such small graphs. In the experiment, comparison with graph-based baseline methods are not sufficient to support this. The authors mentioned quite a few graph-based log anomaly detection methods in the introduction (e.g., LogGD, Logs2Graphs, and GLAD), while these methods are not compared in the experiment. The authors only compare SGALAD with loggraph in single domain setting and GraphLoRA in cross-domain setting, which is not sufficient to support the central question in the introduction.
- [1] Zhong Li, Jiayang Shi, and Matthijs van Leeuwen. Graph neural networks based log anomaly detection and explanation. Data Mining and Knowledge Discovery, 40:66, 2026. doi: 10.1007/s10618-026-01235-6.
-
In the introduction, the authors mainly emphasizes the importance of retaining local event structure and ignores the domain adaptation part. However, the title of this paper highlights the log anomaly detection across domains. The missing emphasis of cross-domain diminished the motivation of anomaly detection across domains. Specifically, different systems may have substantially different event vocabularies, dependencies, and anomaly patterns. It remains unclear why local event structures selected using source-domain supervision would remain informative in an unseen target domain. Since cross-domain adaptation is a central objective of the proposed method, I would suggest the authors to provide a stronger justification for the assumption that anomaly-related local structures are more stable across domains. In addition, the authors do not provide insightful analysis for the experimental resutls in Table 3. Simply mentioning 'Table 3 further examines target performance across explicit support budgets with an expanded baseline set.' is not sufficient.
-
The proposed framework combines several well-established techniques, including graph-based log representations ([1, 2]), local subgraph selection + attention-based aggregation ([3]), adversarial domain alignment, and parameter-efficient adaptation. Although their integration for cross-domain log anomaly detection is potentially useful, the methodological novelty appears somewhat incremental. This impression comes from the lack of validation of the key research question mentioned in the introduction. Why is it an important research question? In the experiment, the cross-domain experiments mainly involve existing transfer methods (LogTransfer) and general-purpose GNN adaptation approaches (AdaptiveGNN). It remains unclear whether the observed improvements arise from the proposed local subgraph learning mechanism or from the effectiveness of the adaptation framework itself.
- [1] Zhong Li, Jiayang Shi, and Matthijs van Leeuwen. Graph neural networks based log anomaly detection and explanation. Data Mining and Knowledge Discovery, 40:66, 2026. doi: 10.1007/s10618-026-01235-6.
- [2] Y. Li, Y. Liu, H. Wang, Z. Chen, W. Cheng, Y. Chen, W. Yu, H. Chen, and C. Liu. GLAD: Content- Aware Dynamic Graphs For Log Anomaly Detection. in 2023 IEEE International Conference on Knowledge Graph (ICKG), Dec. 2023, pp. 9–18. doi: 10.1109/ICKG59574.2023.00007., 2023.
- [3] Lee, Junhyun, Inyeop Lee, and Jaewoo Kang. "Self-attention graph pooling." In International conference on machine learning, pp. 3734-3743. pmlr, 2019.
-
In the experiment, the authors compare SGALAD with full GNN fine-tuning and claim its efficency and effectiveness for adaptation in few-shot settings. I am concerned that full finetuning updates for GNN with 1.25M parameters under the limited label information might easily lead to overfitting. The improvement over full GGN finetuning cannot be a strong evidence to support the effectiveness for adaptation in such few-shot settings.
-
Suggestion for Figure 4: You can add frozen and fire symbols to indicate the frozen neural network and finetuning component. This immediately helps the reader understand which part is frozen and which part can be finetuned.
Questions for authors
Q1: In line 57, you mention that A local graph encoder maps each retained neighborhood to node features . Do you mean that is derived from (the output of equation 3) with the second local GNN?
Q2: In line 81, what is in ? I assume that refers to the relevance score of the selected seed node , rather than an attention weight generated by the subsequent multi-head attention mechanism. The authors should better clarify this to avoid potential confusion.