- Rating
- 3(+1)
- Confidence
- 2(−1)
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper studies over-smoothing in hypergraph neural networks, where repeated message passing gradually removes distinctions between node representations and can make deeper models ineffective. Its central observation is that different propagation rules collapse representations in different ways, so standard Dirichlet-energy measures can incorrectly indicate that meaningful variation remains even after collapse has effectively occurred. To address this, the paper proposes an operator-relative energy whose notion of collapse is matched to the specific propagation rule being analyzed, giving a common framework across different hypergraph architectures.
The main theoretical contribution is a unified analysis showing when representation variation decreases with depth for a broad class of hypergraph propagation operators, while also recovering familiar Dirichlet energies as special cases of the proposed framework. The paper then uses this perspective to analyze initial residual connections and identity mappings, showing that these mechanisms can preserve a nonzero amount of representation variation instead of allowing complete collapse. The practical contribution is to incorporate these mechanisms into five representative hypergraph neural network architectures, thereby connecting the theoretical analysis directly to a concrete architectural strategy for mitigating over-smoothing.
Critical strengths
- The paper provides a principled framework for analysing over-smoothing across different hypergraph propagation rules. Rather than assuming that all propagation operators collapse node representations in the same way, the proposed operator-relative energy adapts the notion of representation variation to the specific collapse behavior of the operator, while recovering familiar energy measures as special cases. This is consequential because it turns an architecture-dependent phenomenon into a common analytical framework that can be applied across multiple model families.
- The theoretical analysis is supported by coherent experimental validation. The controlled experiments directly test whether the proposed energy detects collapse where conventional measures fail, while the classification experiments separately examine whether the theoretically motivated mitigation strategy improves robustness as network depth increases.
Critical weaknesses
- The conceptual novelty is narrower than the paper's broad framing may initially suggest, because operator-dependent limiting subspaces and rank collapse have already been established in prior work [1, 2]. Limitations of conventional Dirichlet-energy-style diagnostics for characterising over-smoothing have also been demonstrated [3]. Initial residuals and identity mappings were introduced by GCNII and subsequently incorporated into hypergraph neural networks through the UniGNN framework [4, 5]. More recent theory has further characterised how residual connections can prevent excessive smoothing and determine the limiting representation subspace [6]. Consequently, the main novelty appears to lie in the specific operator-relative energy construction and its unified hypergraph analysis, rather than in the underlying observations about operator-dependent collapse or residual-based mitigation.
- The empirical evidence is less conclusive than the headline best-of-depth results suggest because the best depth is selected using test performance and the reported per-comparison significance tests do not account for multiple comparisons.This issue is more consequential because recent published work such as FrameHGNN already addresses deep-HGNN over-smoothing using multi-frequency hypergraph filtering together with initial residual and identity-mapping mechanisms [7]. Moreover, DHG-Bench provides a substantially broader and standardised evaluation of deep hypergraph learning, so stronger comparison with this recent benchmark literature would help establish whether the empirical advantages extend beyond the selected baseline architectures [8].
References
[1] Graph Neural Networks Exponentially Lose Expressive Power for Node Classification, ICLR'20.
[2] Rank Collapse Causes Over-Smoothing and Over-Correlation in Graph Neural Networks, LoG'24.
[3] Are We Measuring Oversmoothing in Graph Neural Networks Correctly?, ICLR'26.
[4] Simple and Deep Graph Convolutional Networks, ICML'20.
[5] UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks, IJCAI'21.
[6] Residual Connections and Normalization Can Provably Prevent Oversmoothing in GNNs, ICLR'25.
[7] Deep Hypergraph Neural Networks with Tight Framelets, AAAI'25.
[8] DHG-Bench: A Comprehensive Benchmark for Deep Hypergraph Learning, ICLR'26.
Questions for authors
- Could the authors recompute the best-depth comparisons using depth selected exclusively by validation performance, followed by evaluation on untouched test results, and report multiplicity-adjusted inference across the architecture-dataset comparisons? The appendix explicitly states that best depth is currently chosen according to test mean and that the reported p-values are uncorrected.
- How do the proposed II variants compare under the same splits and depth protocol with a recent published deep-HGNN method designed explicitly for over-smoothing [7]? I would not require the proposed approach to outperform it, but such a comparison would help determine whether the empirical contribution is competitive with the current literature rather than only with unmodified shallow architectures.
2 comments
2. FrameHGNN.
We thank the reviewer for this suggestion and have added a comparison with FrameHGNN [7] at matched depths. FrameHGNN uses the same initial residual and identity mapping as the II variants and adds a learned filter over multiple hypergraph frequencies.
Due to time limitations, some runs at and layers and those on 20News100 and Pokec are still in progress. The table below reports the dataset--depth combinations completed so far, and the remaining ones will be added to the revised manuscript.
These results suggest that the II variants are competitive with FrameHGNN. FrameHGNN has the higher mean in 10 of the 19 combinations and the best II variant in the other 9, with a largest gap of points. No significant difference was found between FrameHGNN and the best II variant at any matched depth after multiplicity correction.
| Dataset | Depth | HGNN-II | HNHN-II | HyperGCN-II | AllSetformer-II | UniGCNII | FrameHGNN |
|---|---|---|---|---|---|---|---|
| Cora | 79.68 0.78 | ||||||
| Citeseer | |||||||
| House-Committee | |||||||
| NTU2012 | |||||||
Node classification accuracy (%) at matched network depths. Entries give the mean standard deviation of test accuracy over ten seeds.
We thank the reviewer for these valuable comments. We have revised the manuscript with changes highlighted in brown and red. Below, we address each point concisely.
Novelty.
We thank reviewer for this careful read. Our contribution lies in the operator-relative energy construction and its unified hypergraph analysis, not in the observation of operator-dependent collapse [1, 2], the limitations of Dirichlet-type diagnostics [3], or the II mechanism itself [4, 5]. We have revised the abstract, introduction, and contribution list to reflect this. Beyond these prior observations, our framework makes three distinct theoretical contributions: (i) an operator-relative energy whose zero set exactly matches the operator-specific collapse subspace; (ii) a unified exponential decay analysis for non-symmetric two-stage hypergraph operators, including intermediate activations and learned channel transformations; and (iii) explicit deterministic lower bounds quantifying the variation preserved by II. In particular, unlike [6], which studies linearized graph networks with symmetric operators, our analysis extends to two-stage hypergraph operators and provides both asymptotic and finite-depth guarantees under explicit conditions.
1. Best-depth comparisons.
We thank the reviewer for this comment. The depth of each model is now selected by mean validation accuracy, and test accuracy is reported only at that depth. P-value is adjusted by Benjamini-Hochberg procedure controlling the false discovery rate at 0.05.
Overall, the direction of the comparison is unchanged. The II variant attains a higher mean test accuracy than its baseline in 27 of 30 pairs, and the three exceptions are each within one reported standard deviation. The strength of the evidence at the selected depth is lower than we originally reported, with 11 improvements remaining significant after correction. We have revised the results section accordingly, and the appendix now describes this protocol in place of the earlier caveat. The table below summarizes the changes.