- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper investigates the reliability of graph anomaly detection in scenarios where class base rates are actively manipulated by an adversary, and introduces the "base-rate dilution" threat model. The authors propose a "feasibility-gated detection" approach, which employs hard structural constraints—independent of model parameters—to restrict the detection model so that it only issues alerts for edges that violate specific system invariants. This architectural design ensures a zero false-positive rate on benign data.
Critical strengths
- The distinction between the threat model and classical perturbation-based attacks is clearly drawn.
- The "critical control" design is well-conceived.
Critical weaknesses
- The distinction between the core phenomenon presented and the classic "base-rate fallacy" is not sufficiently sharp.
- The term "Zero-Cost Attack" is an overstatement.
- The HARD rules were selected from 15 candidates based on their violation rate on benign data. It should be explicitly clarified whether the HARD/SOFT classification was determined solely using benign data from the training/validation sets.
- The coverage of malicious edges by the proposed defense is very low; the 11 HARD rules discussed cover, on average, only about 10.7% of such edges.
- The scope of the learning models examined is quite narrow, with the core experiments focusing almost exclusively on GraphSAGE.
- The cross-scenario experiments actually expose a fundamental vulnerability in the defense: a violation rate of benign invariants as low as 0.00009% is sufficient to cause the precision to decline again as a function of .
- There is a lack of comparison with more direct, operational defenses.
- I will adjust my score based on the authors' rebuttal.
Questions for authors
Q1. What is the core technical innovation of "base-rate dilution" compared to the classic "base-rate fallacy"?
Q2. Does the attack remain effective if the attacker has a realistic resource budget?
Q3. Why is there no comparison between dynamic thresholds and "alert-budget" defense?
Q4. What is the actual recall ceiling for "HARD rules"?
Q5. How are "benign-null" cases verified and maintained during deployment?