- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper rethink the released implementation of T-Spectral HyperGNN and shows that its tensor-based computation can be evaluated using sparse operations on the hypergraph incidence structure. This leads to computational savings. The same derivation also reveals that the released layer reduces higher-order relationships to weighted pairwise interactions, making certain distinct hypergraph structures indistinguishable.
Critical strengths
-interesenting and well delimited research question -Important computational improvement -reproducibility -interesting study on efficiency, but also on the limitation of expressiveness
Critical weaknesses
-
The main result are on the released code, not the full published method. The reference implementation does not use the symmetrisation described in Wang et al. (2025). However, the symmetrised version does not have the same collapse and reaches 100% on the Pasch task. For me the significance depend a lot on how much this released code is used in the community, and this is not discussed.
-
The main simplification follows from a known property of circular convolution. the authors explain that the resulting operator is a special case of the TTSV2 contraction from Aksoy et al. (2024). The matrix formulation is also related to classical clique expansion methods (Zhou et al., 2006; Agarwal et al., 2006). the fact that different hypergraphs can have the same weighted clique expansion was in (Aksoy et al., 2024). So while the result is useful the main novelty seems to be the application of these ideas to one specific layer.
-
once prop. 1 is established, thm 3 follows directly from the fact that the model only sees the effective pairwise operator. The interesting part is the Pasch example. However, the two hypergraphs considered are isomorphic under a permutation of nodes. The limitation is therefore about distinguishing labelled relations, rather than non-isomorphic hypergraph structures. This should be considered when discussing the general significance of the result.
-
thm 2 is proved only for M = 3. The hypergraphs used in the paper have larger order (for example House has ), and for there is only exact enumeration on very small and a conjecture.
-
the released layer is shown to be equivalent to a model with one weighted pairwise propagation step, similar in structure to SGC or APPNP. I think it would be interesting to see a direct comparison with a simple one-hop graph model using the clique expansion and the same tuning budget.
-
the proposed model uses a larger hyperparameter search than most baselines. the trained model uses an absorbed parameterisation and sometimes an additional normalisation that is not present in the released layer.
-
I found the introduction difficult to follow. Its purpose should be to help the reader understand the problem, instead it starts directly from more technical aspects without giving the big picture of the work.
-Aksoy, S. G., Amburg, I., and Young, S. J. (2024). Scalable tensor methods for nonuniform hypergraphs. SIAM Journal on Mathematics of Data Science, 6(2):481–503.
-Zhou, D., Huang, J., and Schölkopf, B. (2006). Learning with hypergraphs: Clustering, classification, and embedding. NeurIPS.
-Agarwal, S., Branson, K., and Belongie, S. (2006). Higher order learning with graphs. ICML.
Questions for authors
see weaknesses.
3 comments
Thank you for your response and for the changes. I appreciate the effort. I think that some of my concerns have been addressed, like the one on theorem 2 and the additional experiments.
However, I decided to keep my original score for two main reasons:
-
Novelty (my Weakness 2). The new results on the symmetrised layer improve the paper but many of the main ideas are already in previous work especially Aksoy et al. I still have doubts about whether the novelty is enough for iclr.
-
Original model (my Weakness 6 and Reviewer 7u7Q's Weakness 1). The new experiments show large differences between the original and absorbed parameterisations with accuracy differences from 6.2 to 52.9 points on DHG-Bench. Even if the two versions can represent the same functions, their training behaviour is very different. For this reason, I think this concern is still important.
-
Clarity. I tried to read again the paper, with the new parts that you added. I still think that the clarity of the writing is not good enough for this venue, especially abstract and introduction which should help the reader understand the problem. Instead, I had to read them many times to understand their contents. I think the paper would be improved if it were rewritten, making the abstract and introduction simpler and ensuring a better logical flow.
Thank you for reading the revision again.
Clarity. We rewrote the abstract and introduction around one question (can a tensor layer tell apart teams that have the same weighted coauthor pairs?) and one idea (the readout).
Original scale factor. This is a property of the original layer, which exact evaluation at scale exposes. The layer multiplies each channel by S_c^(M-2). On Wang et al.'s hypergraphs (M = 4) this is harmless (-5.65 to +1.67 points); at DHG-Bench sizes it reaches 10^505 at initialisation and sets the logit scale, so the layer as written trains 6.2 to 52.9 points lower. Absorbing the factor keeps the same functions (Appendix E.3) and is what makes the layer trainable (Section 5.3).
Novelty. The ingredients are known and credited where used (Aksoy et al.'s generating functions). New are the exact evaluation of both forms, the bound between them, and what each form can separate.
Thank you for the detailed review; we agree with most points and changed the paper. We answer your seven Critical Weaknesses in the order you wrote them. Abar is the paper's A-bar.
Weakness 1, released code vs published method. Agreed; this is the main change. Theorem 1 evaluates the published (symmetrised) form exactly from incidence data in O(M2nnz(H)d) time. Proposition 2 bounds it against the implemented form: published = implemented ×(1−θ), 0≤θ≤1−(1−ρ/2)M−2 (θ: damping; ρ: largest share of a channel held by one node). Both forms match the authors' code to single precision; for the published form this uses the padding functions the code defines but does not call (Section 5.1). Up to a constant scale, the implemented form, the published form and Wang et al.'s T-Spatial layer are the full sum, the half sum and slice 0 of one symmetrised t-product (Section 2). On use: the T-HyperGNNs line is built on in later work: DHG-Bench ships its message-passing network T-MPHN, which Taimoor et al. (2025) speed up. T-Spectral itself is not in DHG-Bench, which is part of why running it at scale matters (now stated in Section 6).
Weakness 2, novelty. We agree the ingredients are known: the zero-frequency coefficient of a circular convolution, TTSV2 (Aksoy et al.), clique expansions (Zhou et al.; Agarwal et al.), and distinct hypergraphs with one clique expansion (Aksoy et al.). Section 6 ("What is known, and what we add") says so. We add: the implemented form is exactly such an operator, with the builder's normalisation and duplicate conventions; the published form is evaluated exactly with the same generating functions at a feature-dependent vector; the gap between the forms is bounded.
Weakness 3, labelled vs non-isomorphic. Correct: the Pasch pair is one labelled trade, a node-level limit, which is the setting of transductive node classification. We agree the node-level limit follows from the collapse, the submission's Proposition 1 (now eq. (4)); its Theorem 3 is now Remark 1. We added a non-isomorphic pair on six nodes, {13, 15, 135, 146, 236, 245} and {13, 15, 136, 145, 235, 246}, with the same Abar and degrees (Section 4.1; Example 1, Appendix G.3). With the same features, every stack of implemented layers gives them the same output. The published form separates them: in exact arithmetic its outputs differ by 1.6e-3 to 4.7e-2 of the output scale with random positive features (Appendix G.3).
Weakness 4, Theorem 2 only at M = 3. Theorem 2 is now proved for every M≥3 whenever N≥2M−3 (Appendix C), which every dataset in the paper satisfies (House: N = 1,290, M = 81). Section 4.3 gives the M = 3 argument. Exact enumeration at 21 pairs (M, N) with 3≤M≤7 and M≤N≤10, ten of them with N<2M−3, outside the theorem's hypotheses, finds that the equivariant weightings are exactly the constants. A second check, exact ranks modulo a prime on a random sample of the equations, reaches N = 1,000 for M = 3, N = 100 for M = 4 and N = 12 for M = 7 (for M≥5 it did not reach N = 100), with no failure at any of its 12 pairs; all have N≥2M−3, so it is a cross-check (Appendix E.2).
Weakness 5, one-hop clique model at the same budget. Added (Table 12, Appendix J): the same model with Abar, HGNN's normalised operator, the unweighted clique and SGC, each tuned with our search. Abar is within 1.12 points of HGNN's operator on all eight sets. Both lead the unweighted clique and SGC by 22.4 to 23.8 points on House-committees, 15.8 to 17.2 on Actor and 4.4 to 26.8 on Walmart-trips. Remark 3 (Appendix D) says why: a hyperedge of size c gives each pair a weight between 1/c and 1/(c-1). So Abar is, up to a diagonal, HGNN's operator before its node-degree normalisation, with hyperedge weights between 1 and c/(c-1), the largest within 4.2% of 1 on every set but Cora.
Weakness 6, search budget, absorbed form, normalisation. We compared the budget in both directions (Table 11, Appendix J). At one default configuration with no search, T-Spectral (exact) loses 0.7 to 11.6 points, so its main rows depend on the search. TF-HNN and UniGCNII retuned with our selection rule are level with it on the homophilic sets and 4.6 to 4.7 points ahead on House-committees and Actor. Table 1 now discusses the row without normalisation; the row with it differs by about one point or less on every set but Yelp. The original factor, trained in double precision with its own search, trails the absorbed form by 6.2 to 52.9 points on DHG-Bench, where it reaches 10505 at initialisation (a fixed log-domain shift keeps it finite on PubMed). Both forms represent the same functions, so this gap measures training, not the model (Section 5.3).
Weakness 7, introduction. Rewritten to start from the problem: why tensor hypergraph networks, why they have not run at scale, and then the readout as the idea (Section 1).