- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes a hypergraph classification method that constructs a star expansion from the incidence matrix and computes random-walk positional encodings (RWPE) for nodes and hyperedges using the diagonal entries of different powers of the random-walk transition matrices, representing return probabilities at different walk lengths. These encodings are propagated through message passing and used to define learned filtrations, whose persistent-homology features are aggregated for classification.
Critical strengths
Empirical improvements on two datasets: +8.88 percentage points on Steam-Player and +11.78 on Twitter-Friend over the strongest benchmark baselines on the same splits.
Critical weaknesses
-
Limited novelty: The method mainly suggests positional encoding for hyper graphs, message passing, learned filtrations, and persistent-homology readouts. Its contribution is primarily their integration for hypergraph classification.
-
Limited improvements across benchmarks: The two IMDB datasets show no statistically significant advantage over the strongest baselines. Moreover, approximately 28% (as mentioned in the manuscript) of their test graphs duplicate training or validation inputs.
Questions for authors
1.The methodological novelty appears limited. PiPE (Verma et al., ICML 2025) [1] already combines positional encodings, including RWPE, message passing, and persistent homology of learned filtrations. HyLPF applies closely related ideas to hypergraph star expansions with a different persistence readout. It remains unclear what additional representational capability this formulation provides over existing approaches. A comparison with PiPE adapted to the typed star expansion would help clarify the contribution.
[1] Positional Encoding meets Persistent Homology on Graphs Yogesh Verma, Amauri H Souza, Vikas K Garg
2 comments
Response to Reviewer cQ1a (2/2)
Q1 – Additional capability over PiPE – HyLPF differs from PiPE in four respects, and a test that changes one setting shows that the main difference matters.
Both methods combine positional encodings, message passing and persistence of learned filtrations. The paper cites PiPE in Section 2. HyLPF differs in four respects.
- Domain. HyLPF is defined on hypergraphs through the typed star graph, with separate filtration networks for nodes and hyperedges. Proposition 6 gives two hypergraphs with the same clique graph and the same degrees whose star graphs have cycle ranks 3 and 5. The readout receives the cycle rank, so it separates them.
- Source of the filtrations and input of the classifier. PiPE predicts from pooled node embeddings together with a topological embedding. In HyLPF, the positional states are propagated separately from the features, and they alone define the filtrations. The classifier reads only the persistence descriptor.
- Ties. Vertices exchanged by an automorphism receive equal filtration values, so ties are systematic. Definition 3 and Propositions 4 and 5 give a descriptor that is well defined and isomorphism invariant under ties.
- Evaluation. Two matched twins separate the persistence-derived inputs from the persistence values (Definition 7, Table 2).
Relative to PiPE on the same star graph, the difference lies in point 2. We tested this difference directly in our own framework, on the same splits. The variants below ran on a different machine from PiPE, so Table R2 has its own rerun of HyLPF.
Table R2: Variants on the typed star expansion. Test accuracy in % (mean ± SD over 10 splits) and paired difference HyLPF − model. Every difference excludes zero under the 95% interval and under the overlap-corrected interval (Appendix C.1). Bold marks the best value in each column.
| Model | Steam-Player | Twitter-Friend | Diff. Steam-Player | Diff. Twitter-Friend |
|---|---|---|---|---|
| HyLPF | 66.28 ± 1.87 | 72.93 ± 2.31 | — | — |
| One switch changed: filtrations from the feature states | 62.99 ± 3.44 | 65.11 ± 3.22 | +3.28 | +7.81 |
| GFL-style, implemented in our framework | 58.85 ± 1.92 | 64.50 ± 2.28 | +7.43 | +8.42 |
| TOGL-style, implemented in our framework | 57.30 ± 2.97 | 62.85 ± 4.74 | +8.98 | +10.08 |
As shown in Table R2, the first variant changes one setting so that the filtrations come from the feature states instead of the positional states. This lowers the accuracy by 3.28 points on Steam-Player and by 7.81 points on Twitter-Friend. Two further variants follow the designs of GFL (Hofer et al., 2020) and TOGL (Horn et al., 2022). Their accuracies are 7.4 to 10.1 points lower. All six differences exclude zero under both intervals. The three variants use our tie-aware descriptor and the configuration of HyLPF.
In the revision, we will add Table R2 and a paragraph in Section 2 that states the differences from PiPE item by item.
W1 – Limited novelty – The components exist separately. HyLPF combines them in a new design with a tie-aware descriptor, and the new comparisons show that this design matters.
We agree that positional encodings, message passing, learned filtrations and persistence readouts exist separately. The four points above describe what is new. The tie-aware descriptor in point 3 is a technical contribution, as earlier work on learned filtrations does not address ties. Table R2 shows that the design choices of HyLPF raise the accuracy on the same representation. HyLPF also has a higher mean accuracy than PiPE in Table R3.
W2 – IMDB results and duplicated test graphs – We agree. The paper claims no significant difference on the IMDB collections, and the duplicates were found by our own audit.
The paper reports mean accuracies on the two IMDB collections, where HyLPF is first on IMDB-Dir-Genre and second on IMDB-Dir-Form. Every contrast whose interval excludes zero is on a social collection. Appendix D reports the duplicates so that readers can weigh the IMDB numbers accordingly.
We hope the comparison with PiPE and these answers resolve your concerns. If they do, we would be grateful if you would reconsider your score and confidence.
Response to Reviewer cQ1a (1/2)
We thank the reviewer for the review and for the concrete request. Below, we address each point. All new experiments build on the code of the submission. They use the ten splits of the paper on Steam-Player and Twitter-Friend and three initializations per split. HyLPF was rerun together with each new model. We report every model we ran, and we will add all new results to the revised paper.
Q1 – Comparison with PiPE on the typed star expansion– We ran PiPE with its public code on the same star expansion and the same splits. HyLPF has the higher mean accuracy on both collections.We added PiPE adapted to the typed star expansion, as you suggested.
Table R3: PiPE on the typed star expansion. Test accuracy in % (mean ± SD over 10 splits) and paired difference HyLPF − PiPE. Every difference has a 95% interval that excludes zero. As in the paper, † marks a difference whose overlap-corrected interval (Appendix C.1) contains zero. Bold marks the best value in each column.
As shown in Table R3, HyLPF has the higher mean accuracy on both collections, by 2.14 points on Steam-Player and by 4.48 points on Twitter-Friend. Both differences have 95% intervals that exclude zero, and on Twitter-Friend the overlap-corrected interval also excludes zero. In macro-F1, HyLPF is 2.33 points higher on Steam-Player and 6.44 points higher on Twitter-Friend. Both intervals again exclude zero on Twitter-Friend. In this run HyLPF reaches 66.50% and 73.05%, in agreement with the paper (66.41% and 72.93%).
PiPE on the star expansion is also above the 18 benchmark methods of Table 1 in mean accuracy. Their best values are 57.52% on Steam-Player and 61.15% on Twitter-Friend. This supports the typed star graph with random-walk encodings as a representation for these collections.
In the revision, we will add Table R3 and list every adaptation of the PiPE code.