- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper presents HyperOTri, a single model for node classification, hyperedge prediction, and hypergraph classification. The goal is clear. The model performs better than Naive MTL on several tasks, but its gains over single-task training are mixed.
I have several concerns. The paper does not explain how its -hop
neighborhood preserves distance information in distance-based hypergraphs.
Section3.2 and the appendix also describe different procedures for
constructing subhypergraphs. Although Equation(8) defines the joint loss,
the benefit of adding other tasks to a primary task remains unclear.
Finally, the paper does not explain why it sets the adapter scale
to 0.1 or test how sensitive the results are to this choice. These issues
weaken the evidence for the method's effectiveness.
Critical strengths
1.The method is clearly designed. Its query-marked subhypergraphs, shared encoder, task-conditioned adapters, and unified prediction module form a coherent framework for the three tasks.
2.The experimental evaluation is relatively comprehensive. It includes multiple datasets, comparisons with single-task and multitask baselines, component ablations, and analyses of several hyperparameters.
Critical weaknesses
-
The definition and implementation of the core input construction are inconsistent. Section 3.2 defines the local input as a node-induced subhypergraph. Appendix B.4 instead describes collecting incident hyperedges hop by hop, with at most hyperedges retained. These procedures can produce different input structures. Subhypergraph construction is central to the proposed framework. Without a precise account of the algorithm and sampling rules used in the experiments, the method is difficult to reproduce. It is also unclear whether the reported gains result from the stated definition or a particular sampling procedure.
-
The experiments do not sufficiently establish the value of joint learning across three tasks. In Table 1, HyperOTri performs worse than single-task training in four of nine results. Under the three-task setting in Figure 4, node-classification accuracy drops by 1.70 percentage points and hypergraph-classification accuracy drops by 6.70 percentage points. Although the model outperforms Naive MTL, this comparison does not establish consistent benefits for the target tasks. When performance on one task is the primary goal, the current evidence does not sufficiently justify using the proposed method. This substantially affects my assessment of the paper’s central contribution and experimental support.
Questions for authors
-
Neighborhood definition. Section 3.2 treats any two nodes in the same hyperedge as one hop apart. Is -hop distance intended to describe incidence-based connectivity only? For distance-constructed hypergraphs such as NTU2012, does the subhypergraph construction use any information about distances between nodes within a hyperedge?
-
Subhypergraph construction. Which rule is implemented: retaining all hyperedges fully contained in the -hop node set, as stated in Section 3.2, or collecting incident hyperedges at each expansion step, as stated in Appendix B.4? These rules can produce different subhypergraphs. How is the limit of hyperedges applied?
-
Effect of joint training. Equation (8) assigns equal weight to the three task losses. Using the same architecture and evaluation protocol, what is the performance of each target task when trained alone, with each auxiliary task, and with both auxiliary tasks? Please report the changes relative to target-task-only training so that positive and negative transfer can be assessed directly.
-
Strength of the empirical gains. Several improvements in Table 1 are small, and some results are below the single-task baseline. Which gains over the strongest applicable baseline are consistent across the five runs, and what is the main empirical advantage supported by these results?
-
Choice of . How was the residual scale selected? How sensitive are the three task results to , including , which removes the adapter contribution?