- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 3
Read review
Paper summary
In this work the authors present a study on entropic curvature, a different type of discrete curvature for graphs, based on optimal transport and the Lott–Sturm-Villani framework. The study is built on strong theoretical foundations and contributes towards numerous perspectives: the discrete reformulation, the anti-oversmoothing guarantee, a generalization bound and the newly proposed GNN architectures. Nevertheless, the paper does not show application on larger real-world datasets.
Critical strengths
- A real and rigorous curvature notion into GNNs with theoretical foundation
- Anti-Oversmoothing Guarantee via Poincaré Inequality is one of the first designed under a curvature notion
Critical weaknesses
- The “local vs. global” pitch is not clear. κ_w to my understanding is just as local as Ollivier-Ricci (2-hop). The global guarantees only apply when the minimum of κ_w over all nodes is positive. Ollivier-Ricci also gives global results under a uniform positive lower bound. The real difference to me is which inequalities you get, not local versus global.
- The benchmarks are quite weak. The node-classification datasets are Cora, CiteSeer, PubMed, Cornell, Texas and Wisconsin (with 183–251 nodes each). Under 60/20/20 splits, Cornell’s test set is about 37 nodes. The paper’s pitch is also about long-range information flow, yet I saw no long-range benchmark (LRGB) if I am not mistaken.
Questions for authors
- Elaborate on the local vs global presentation
- Why not test on larger datasets?