- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes GraphBet, a statistical framework for identifying temporal graph node sets that receive significantly more future interactions than expected under an opportunity model. It combines temporal graph predictions with sequential betting and multiple hypothesis testing, providing theoretical guarantees for false discovery rate control under adaptive candidate selection and statistical dependence. Experiments on synthetic and real temporal graph data, including simulated interaction streams, benchmark replays, and observational analyses, report improvements in testing power and overall recall. However, the practical significance of the problem remains insufficiently motivated, while the reliance on restrictive assumptions, synthetic ground truth, and limited empirical gains raises concerns about the validity and generalizability of the conclusions.
Critical strengths
-
Clear problem formulation. The paper separates temporal graph prediction from statistical hypothesis testing, providing a structured framework for evaluating whether future interactions exceed expected opportunities.
-
Theoretical guarantees. The authors establish formal FDR control under adaptive candidate selection, statistical dependence, and evolving graph histories, which constitutes a meaningful theoretical contribution.
-
Detailed theoretical and empirical analysis. The paper provides extensive derivations, sensitivity analyses, and component evaluations to examine statistical validity and evidence accumulation.
Critical weaknesses
-
Limited significance and novelty. The practical relevance of the proposed discovery problem to temporal graph learning is insufficiently justified. The framework largely integrates established statistical techniques, with limited methodological innovation.
-
Unreliable key assumptions. The theoretical guarantees critically depend on the opportunity probability model, whose validity is not established for real world data. The substantial sensitivity of the Wiki results further undermines the reliability of the claimed discoveries.
-
Questionable ground truth and experimental validity. The ground truth is defined through artificially injected probability shifts rather than independently verified interaction patterns. Recovering these synthetic labels does not necessarily demonstrate meaningful group discovery.
-
Limited empirical improvements. The proposed method achieves modest overall recall, and the improvement from learned candidates under fixed betting is not statistically conclusive. The experiments provide insufficient evidence of practical advantages.
Questions for authors
-
What concrete applications motivate the proposed discovery problem, and what fundamental methodological advances distinguish GraphBet from existing sequential testing and FDR control techniques?
-
How can the opportunity probability model be reliably justified in real world temporal graphs, especially given the substantial sensitivity of the Wiki results to reference probability adjustments?
-
Why should recovering artificially boosted destinations be considered meaningful group discovery? Can the authors provide evidence that the identified groups correspond to meaningful interaction patterns in real data?
-
Given the limited overall recall and inconclusive improvement from learned candidates under fixed betting, can the authors provide a direct statistical comparison of the strongest complete pipelines and clarify the practical significance of the reported gains?