- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies Relational Injection Attacks against relational deep learning models, where an attacker inserts new database rows while preserving existing records and model parameters. The formulation incorporates insertion permissions, referential integrity, temporal constraints, and budgets. The proposed framework combines path selection, RelPGD-based value optimization, and subsequent local search. Experiments cover twelve binary classification tasks from seven RelBench datasets and two victim architectures.
Critical strengths
-
Meaningful database-specific setting. Requiring injections to be realizable through permitted database writes introduces substantive constraints beyond standard graph-level injection. The explicit treatment of permissions, foreign-key relationships, and temporal availability is a useful contribution to RDL robustness evaluation.
-
Broad empirical coverage. The evaluation spans multiple datasets, tasks, and architectures, with component ablations and computational-cost analyses. These experiments provide useful evidence that valid row insertions can manipulate relational predictions.
Critical weaknesses
-
Limited comparison with closely related injection attacks. Although the paper evaluates adapted tabular attacks, the path-selection baselines are mainly Random and W-norm. Relevant approaches—including G-NIA/OPTI (CIKM 2021), HeTa (IJCAI 2025), and TDGIA (KDD 2021)—are not experimentally compared. Their settings differ from RIA, so direct application may be inappropriate. Nevertheless, an adapted representative baseline under matched constraints and budgets, or a specific explanation of the adaptation difficulties, would help establish the methodological contribution beyond the valuable database setting.
-
The headline path-selection gain is concentrated in one task. Table 1 reports a 10.1-percentage-point macro-average improvement over W-norm, but stack/user-badge alone improves by 90.4 points. Based on the rounded table values, the average improvement across the remaining eight tasks is approximately 0.075 points, with notable gains and losses on individual tasks. Further explanation and stability checks would strengthen the conclusion.
As a minor presentation concern, the first experimental results table appears only on page 8. Introducing a motivating empirical example or a compact results overview earlier would make the methodological development easier to follow.
Questions for authors
-
Could the authors evaluate a representative adapted graph injection baseline, such as OPTI, under the same legal insertion space and computational budget? If this is impractical, which specific constraints prevent a meaningful adaptation?
-
What explains the particularly large gain on stack/user-badge and the decreases on stack/user-engagement and event/user-repeat?