- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper addresses the inverse problem of recovering latent higher-order interaction structure from observed node states. Existing methods either focus only on pairwise graphs or require prior knowledge of the governing dynamical equations. The paper aims to infer both pairwise edges and 2-simplices from time-series data in a model-free way.
Critical strengths
The paper infers both pairwise and 2-simplex interactions. It performs well against two baseline methods on three types of synthetic networks.
Critical weaknesses
Although honestly recognized by the authors, SCHOD only work for very small networks because of the cost of enumerating candidate 2-simplices. Moreover, experiments are only made on synthetic networks. The results are promising, but the experimental setup is limited to fully convince me about the advantage of SCHOD. This pertains to the breadth of synthetic networks with varying parameters (including size), to the types of dynamics, and the baselines tested against.
Questions for authors
- Is the limitation for very small networks for all methods or only for SCHOD?
- What about comparing against the ARNI method?
- How were the parameters for the synthetic networks chosen, especially the density for ER, the m for BA, and the rewiring probability for WS. We would need more experiments to show that SCHOD still outperforms for different structures of the synthetic networks.
- What is the restriction about testing on real-world networks?