- Rating
- 4(+1)
- Confidence
- 3
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 3(+1)
Read review
Paper summary
The authors propose a new framework of node injection attacks for hyperedge prediction, called Distribution-Preserving Hypergraph Injection Attack (DPHIA). The ultimate goal is to design effective and stealthy attacks on hypergraphs. To achieve this aim, the authors combine the choice of the uncertainty-guided injection with distribution-preserving feature optimization, by using an adaptive ranking-based attack objective and dual-level adversarial regularization. It is important to note that adversarial hypergraph learning is one of the rapidly developing directions over the last few years, but it is still substantially behind the conventional adversarial graph learning. This paper provides an interesting new contribution to this important, yet largely uncharted domain.
Critical strengths
The paper focuses on the important but largely under-investigated topic of adversarial learning of hypergraph-structured data. Most existing studies in this domain target node classification, while adversarial robustness of hyperedge prediction remains virtually unexplored. To the best of my knowledge, this paper is the first one to address adversarial hyperedge prediction and offers a new and important contribution to the existing body of knowledge.
The paper also presents a comprehensive study on node injection attacks for hyperedge prediction and their deficiencies, which is of interest on its own.
Critical weaknesses
My main criticism is that the considered datasets, i.e., Citeseer, Cora etc, are not inherently hypergraphs. Of course, other papers on adversarial hypergraph learning use these data, but from my perspective, it undermines the paper value. It will be much more interesting and valuable, especially in the context of hyper-edge prediction, to consider the data which are intrinsically described by a hypergraph. Probably, some knowledge graphs will be a good option to consider.
A related comment, it will be beneficial to have a deeper discussion comparing the scenarios of hyperedge vs. edge prediction, so that the peculiarities of hypergraphs are pronounced stronger.
Another major concern is that the numerical results are provided without assessment of variability, no standard deviations are reported. As such, it is hard to judge how much better (if better) DPHIA is, given uncertainties.
Questions for authors
See comments above
12 comments
Response to Weakness #1
W1. Evaluation on more intrinsic hypergraphs.
A1. Thank you for this thoughtful comment. Our original evaluation follows widely adopted benchmarks for hyperedge prediction, enabling comparison with prior work. We fully agree that incorporating additional datasets with more explicit real-world semantics of higher-order interactions would further strengthen our work.
Following your suggestion, we extend our evaluation to five additional intrinsic hypergraphs: (a) two knowledge hypergraphs and (b) three hypergraphs capturing real-world group interactions. All experiments follow the main-paper protocol, with HyGEN as the victim.
(a) Knowledge hypergraphs. We adopt WD50K (100) [1] from Wikidata and FB-AUTO [2] from Freebase, both dominated by higher-arity facts (arity > 2) and used in recent knowledge hypergraph learning [3]. Knowledge hypergraphs encode multi-entity factual relations. We represent each entity as a node and each fact as a hyperedge connecting its participating entities. Relation types and entity roles are discarded, duplicate entity sets are merged, and entity names and descriptions are encoded using Qwen3-Embedding-0.6B as node features.
Table A1(a) shows that DPHIA achieves the best overall attack performance, with the lowest AUC on both knowledge hypergraphs and the lowest AP on FB-AUTO. Specifically, DPHIA reduces AUC by 6.47 and 19.05 points on WD50K (100) and FB-AUTO, respectively. These results demonstrate DPHIA's effectiveness on intrinsic higher-order knowledge relations, beyond conventional hyperedge prediction benchmarks.
Table A1(a). Results on knowledge hypergraphs (AUC | AP, %).
| Domain | Dataset | Benign | Random | FGA | TH-Attack | HyperNear | DPHIA |
|---|---|---|---|---|---|---|---|
| Open-domain | WD50K (100) | 65.11 | 62.12 | 62.16 | 62.20 | 64.12 | 60.49 | 61.10 | 59.60 | 61.15 | 58.42 | 58.64 | 60.40 |
| Automotive | FB-AUTO | 74.18 | 73.31 | 73.34 | 74.50 | 62.61 | 63.22 | 63.90 | 59.62 | 68.70 | 65.28 | 55.13 | 53.12 |
(b) Real-world group interactions. We further evaluate three hypergraphs from TAHB [4], whose hyperedges capture naturally occurring group relationships across diverse domains:
- Amazon Pet Supplies (e-commerce): Nodes represent products, with each hyperedge connecting products purchased and reviewed by the same user.
- TMDB (movies): Nodes represent movies, with each hyperedge grouping movies featuring the same actor.
- House (politics): Nodes represent legislative bills, with each hyperedge connecting bills sponsored by the same legislator.
As shown in Table A1(b), DPHIA achieves the lowest AP on all three datasets and the lowest AUC on two of them. Notably, on House, DPHIA reduces AUC by 16.02 percentage points, compared with 11.78 percentage points for the strongest baseline. These results further support DPHIA's effectiveness across diverse real-world higher-order interactions.
Table A1(b). Results on real-world group interactions (AUC | AP, %).
| Domain | Dataset | Benign | Random | FGA | TH-Attack | HyperNear | DPHIA |
|---|---|---|---|---|---|---|---|
| E-commerce | Amazon Pet Supplies | 67.65 | 69.83 | 67.32 | 69.76 | 66.68 | 68.88 | 67.62 | 69.91 | 61.62 | 63.69 | 63.29 | 62.80 |
| Movies | TMDB | 52.25 | 54.65 | 52.57 | 54.89 | 55.15 | 57.64 | 52.24 | 54.47 | 51.93 | 53.83 | 50.27 | 51.64 |
| Politics | House | 64.25 | 64.11 | 58.56 | 59.01 | 58.47 | 59.46 | 63.91 | 63.66 | 52.47 | 54.46 | 48.23 | 50.47 |
We have included the new results and analysis in Appendix G.10 (Tables 16–17) of the revised manuscript.
Response to Weakness #2
W2. Discussion about hyperedge prediction and edge prediction.
A2. Thank you for this valuable comment. Following your suggestion, we provide a deeper comparison between the two scenarios below.
(a) Comparison between edge and hyperedge prediction. Edge prediction aims to predict whether a pair of nodes forms an edge, whereas hyperedge prediction aims to predict whether a candidate set of multiple nodes forms a hyperedge. This distinction introduces two fundamental challenges:
- Node aggregation. Edge prediction typically combines the representations of two endpoint nodes through pairwise scoring operations (e.g., dot product or concatenation). In contrast, hyperedge prediction requires aggregating variable numbers of member nodes with potentially different contributions to capture more complex group-level interactions.
- Combinatorial candidate space. For nodes, edge prediction considers possible undirected edges, whereas hyperedge prediction involves a potentially exponential candidate space of node subsets, introducing substantially greater computational complexity and challenges in accurate candidate prediction.
(b) Differences in adversarial attack settings. Existing attacks on edge prediction primarily perturb graph edges to degrade prediction performance [5, 6] or inject malicious nodes to manipulate specific edge predictions [7]. To the best of our knowledge, untargeted node injection poisoning for edge prediction remains relatively underexplored. More importantly, directly adapting pairwise attacks to hyperedge prediction faces two distinct challenges:
- Group-level perturbation attenuation. Pairwise attacks manipulate node representations or pairwise prediction scores without explicitly considering how group-level aggregation can attenuate node-level perturbations (Lemma 1 and Corollary 1). DPHIA addresses this through an adaptive ranking-based objective that directly optimizes post-aggregation scores to disrupt positive–negative hyperedge rankings.
- Higher-order stealthiness constraints. Unlike attacks targeting pairwise relations, injecting a node into a hyperedge changes its interactions with an entire group, potentially introducing membership- and hyperedge-level distributional deviations. DPHIA addresses these deviations through dual-level adversarial regularization.
Together, these distinctions highlight the peculiarities of hypergraphs for adversarial attacks, and the need for task-specific attack designs beyond directly transferring existing edge prediction attacks.
We have incorporated this discussion into Appendix H of the revised manuscript to further clarify the distinctions between hyperedge and edge prediction.
Overall response to Reviewer Cuzb
Thank you for your thoughtful and encouraging feedback on our paper. We sincerely appreciate your recognition of the importance of adversarial hyperedge prediction and the novelty of our contribution to this underexplored area. We are also grateful for your positive assessment of our comprehensive analysis of existing node injection attacks and their limitations.
We address your concerns as follows.
[Preview]