- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes Joint Neighbor Semantic Modeling (JNSM) to mitigate the semantic bottlenecks associated with oversquashing for heterogeneous social event detection. Prior to messagepassing propagation, the method assembles complementary neighbors into joint semantic units via dual neighbor selection, targetcentered semantic gain evaluation, learnable unit representation, and semanticdriven local rewiring.
Critical strengths
The paper provides an interesting semantic perspective on over-squashing, emphasizing the importance of preserving complementary information across neighboring nodes. The proposed framework is logically structured, and its combination of semantic gain evaluation, joint representation learning, and local rewiring offers a reasonable approach to improving neighborhood aggregation. JNSM achieves competitive results across three benchmarks, outperforming its backbone on most evaluation metrics. The improvements in high-diversity neighborhoods are particularly encouraging. The paper also includes component ablations, parameter sensitivity studies, and runtime comparisons, providing useful empirical support for the proposed design.
Critical weaknesses
Although the integration is reasonable, the paper does not sufficiently clarify how the proposed approach differs fundamentally from existing semantic-aware aggregation and neighbor interaction methods. Although the ablation experiments support its empirical usefulness, the theoretical relationship between this criterion and actual semantic complementarity remains unclear.
Questions for authors
Could the authors please provide more direct evidence demonstrating that JNSM mitigates oversquashing? Beyond the downstream performance observed in ablation experiments, could the authors further validate whether the semantic gain in Eq. 9 is capable of identifying genuinely complementary neighbor pairs?
W1-1: limited innovation and distinction from existing semantic-aware aggregation and neighbour interaction methods.
JNSM's core novelty lies in target-specific joint semantic unit construction, integrating three complementary mechanisms: (1) target-centered semantic gain to identify relevant, non-redundant neighbor pairs; (2) adaptive mean-gain thresholding to select informative pairs according to target-specific neighborhood semantics; and (3) residual unit encoding to preserve and integrate complementary interactions before aggregation. Unlike GraphAIR's parallel convolutions for neighbor interactions, JNSM explicitly constructs complementary semantic units for joint propagation. Unlike FoSR and LASER, which rewire existing nodes, JNSM locally connects newly constructed units to their targets. We will clarify these distinctions in the revision.
W1-2: unclear theoretical relationship between semantic gain and actual semantic complementarity.
Semantic gain is a geometrically motivated heuristic, not a theoretical guarantee, informed by the information-theoretic motivation in Appendix B.1. It combines midpoint proximity for target relevance, redundancy suppression for complementary evidence, and cancellation correction against spurious alignment. Together, these factors favor target-relevant, non-redundant pairs. We will clarify this rationale in the revised manuscript.
Q1: direct evidence of over-squashing mitigation.
We thank the reviewer for this question. We conducted a semantic recovery experiment using linear probes on frozen representations to recover the mean and standard deviation of PCA-projected SBERT features from each target's same-event 1- and 2-hop neighbors, excluding the target. All methods use identical data splits and evaluation procedures.
JNSM (joint + keep distant) achieves the lowest recovery error, suggesting a greater recoverability for original neighborhood semantics from the target final representations. We prioritize semantic recovery as a probing-based diagnostic of information preservation [2, 3], rather than Jacobian sensitivity, which primarily measures source-to-target deviation influence along graph connections [1].
References:
[1] Di Giovanni et al. (ICML 2023). On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topology.
[2] Hewitt and Liang (EMNLP-IJCNLP 2019). Designing and Interpreting Probes with Control Tasks.
[3] Hewitt et al. (EMNLP 2021). Conditional Probing: Measuring Usable Information Beyond a Baseline.
Q2: Can semantic gain identify genuinely complementary neighbor pairs in Eq. 9?
To directly validate Eq. (9), we introduce Incremental Evidence Coverage (IEC), an independent metric measuring additional event-relevant keywords jointly covered by a neighbor pair beyond its more informative individual neighbor:
\frac{ |K_v\cap(T_i\cup T_j)| -\max\left(|K_v\cap T_i|,\ |K_v\cap T_j|\right) }{ |K_v| }$$ Here, (K_v) contains TF-IDF-derived event keywords from reference messages, excluding target keywords, while (T_i,T_j) denote neighbor keyword sets. **Pair-level Semantic Complementarity Validation on Twitter2012.** | Gain Group | Selection Criterion | Incremental Evidence Coverage (%) | Same-event Pair Rate (%) | |:---|:---|---:|---:| | Low Gain | $$0 \leq G \leq 0.5\bar{G}_v$$| 0.42 | 36.61 | | Mid Gain | $0.5\bar{G}_v < G \leq \bar{G}_v$| 0.81 | 55.48 | | **High Gain** |\$ G > \bar{G}_v\$ | **3.54** | **83.93** | High-gain pairs achieve 3.54% IEC, compared with 0.81% and 0.42% for mid- and low-gain pairs. The high–low difference is 3.12 percentage points (95% bootstrap CI: [0.45, 6.73]), with a positive mean within-target Spearman correlation (ρ = 0.428). Based on 102 evaluated pairs across eight matched target–relation groups, these findings support semantic gain's ability to identify complementary event evidence, while IEC remains a lexical proxy rather than a theoretical guarantee.