We lifted 5 functions out of this paper's own repositories and ran 3 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| dshi3553usyd/curvature_enhanced_graph_convolution | canonical | 3 of 5 |
| Function | Status | Where it lives |
|---|---|---|
| qm7_test | Ran | dshi3553usyd/curvature_enhanced_graph_convolution/QM7.py code served (permissive licence) · get_code("016cc9dd0fa62d7a") |
| qm7_test_train | Ran | dshi3553usyd/curvature_enhanced_graph_convolution/QM7.py code served (permissive licence) · get_code("fc78af938f4a4823") |
| scipy_to_torch_sparse | Ran | dshi3553usyd/curvature_enhanced_graph_convolution/curvature_UFGPool.py code served (permissive licence) · get_code("de85f6168a586bd8") |
| ChebyshevApprox | Not yet run | dshi3553usyd/curvature_enhanced_graph_convolution/curvature_UFGPool.py code served (permissive licence) · get_code("34b82f5922857186") |
| get_operator | Not yet run | dshi3553usyd/curvature_enhanced_graph_convolution/curvature_UFGPool.py code served (permissive licence) · get_code("25d0341431feab5e") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Graph neural network (GNN) has been demonstrated powerful in modeling graph-structured data. However, despite many successful cases of applying GNNs to various graph classification and prediction tasks, whether the graph geometrical information has been fully exploited to enhance the learning performance of GNNs is not yet well understood. This paper introduces a new approach to enhance GNN by discrete graph Ricci curvature. Specifically, the graph Ricci curvature defined on the edges of a graph measures how difficult the information transits on one edge from one node to another based on their neighborhoods. Motivated by the geometric analogy of Ricci curvature in the graph setting, we prove that by inserting the curvature information with different carefully designed transformation function $ζ$, several known computational issues in GNN such as over-smoothing can be alleviated in our proposed model. Furthermore, we verified that edges with very positive Ricci curvature (i.e., $κ_{i,j} \approx 1$) are preferred to be dropped to enhance model's adaption to heterophily graph and one curvature based graph edge drop algorithm is proposed. Comprehensive experiments show that our curvature-based GNN model outperforms the state-of-the-art baselines in both homophily and heterophily graph datasets, indicating the effectiveness of involving graph geometric information in GNNs.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2307.09768")
get_code_for_paper("2307.09768")
have("2307.09768")
Connect an agent — have() is free.