Title: CURVATURE GRAPH NETWORK

Abstract: Graph-structured data is prevalent in many domains. Despite the widely celebrated success of deep neural networks, their power in graph-structured data is yet to be fully explored. We propose a novel network architecture that incorporates advanced graph structural information, specifically, discrete graph curvature, which measures how the neighborhoods of a pair of nodes are structurally related. The curvature of an edge (x, y) is defined by comparing the distance taken to travel from neighbors of x to neighbors of y, with the length of edge (x, y). It is a much more descriptive structural measure compared to previously ones that only focus on node specific attributes or limited graph topological information such as degree. Our curvature graph convolution network outperforms state-of-the-art methods on various synthetic and real-world graphs, especially the large and dense ones.

1. INTRODUCTION:

Despite the huge success of deep neural networks, it remains challenging to fully exploit their power on graph-structured data, i.e., data whose underlying structure is captured by graphs, e.g., social networks, telecommunication networks, biological networks and brain connectomes. Inspired by the power of convolutional neural networks on image data, convolutional networks have been proposed for graph-structured data. Existing works can be roughly divided into two categories, depending on whether convolution is applied to the spectral or spatial domain.

Spectral approaches (Bruna et al., 2013; Defferrard et al., 2016; Henaff et al., 2015; Veličković et al., 2017) apply convolution to eigen-decomposed graph Laplacians and are generally efficient in both computation and memory. However, the learned convolution filters are graph-specific and cannot generalize to different graphs. Spatial approaches execute "convolution" directly on the graph and operate on the neighborhood as defined by the graph topology. A spatial method iteratively updates the representation of each graph node by aggregating representations from its neighbors, i.e., adjacent nodes (Xu et al., 2018) . Nonlinear transformations are applied to the representation passed from one node to another, called a message. These transformations have the same input/output dimension, i.e., the dimension of the node representation. They can be shared and learned across different nodes and even different graphs.

For spatial approaches, it is important to incorporate local structural information of the graph. Node degree has been used to re-parametrize the non-linear transformation of messages (Monti et al., 2017) or as an additional node feature (Hamilton et al., 2017) . However, node degree is fairly limited; there can be different graph topologies with the same degree distribution. The limitation is illustrated in x y

(a) Tree: κxy = -0.5

x y (b) Grid: κxy = 0

x y (c) Clique: κxy = 0.625

Figure 1 : Illustration of structural information. In all three graphs, the degrees of x and y are the same. However, the Ricci curvature of the edge (x, y) is negative, zero, and positive, respectively. All edges have weight 1. α = 0.5 so each node keeps 50% of the probability mass to itself.

Figure 1 . Nodes x and y have the same degree in three significantly different graphs: a tree, a grid and a clique. To effectively make use of graph structural knowledge, one would need a feature with more discriminative power; one that can distinguish these three scenarios in Figure 1 .

In this paper, we propose a novel graph neural network that exploits advanced structural information.

Notice that node degree only describes the number of neighbors of each node, but does not say how these neighbors are connected among themselves. We seek to use structural information characterizing how neighborhoods of a pair of nodes relate to each other. In Figure 1 , the neighborhoods of x and y are well separated in different branches of a tree. In a grid graph, the two neighborhoods are within a parallel shift of each other. In a clique, they completely overlap. To quantify such pairwise structural information, we draw inspiration from recent study of graph curvature (Ollivier, 2009; Lin et al., 2011; Weber et al., 2016) .

Similar to curvature in the continuous domain, e.g., the Ricci curvature of a Riemannian manifold, the discrete graph curvature measures how the geometry of a pair of neighborhoods deviates from a "flat" case, namely, the case of a grid graph. There are several definitions of discrete curvature for graphs. The most notable one is Ollivier's Ricci curvature (Ollivier, 2009) . The edges of an infinite grid graph have zero curvature. The curvature of an edge in a tree is negative and is positive in a complete graph. Intuitively, the graph curvature measures how well two neighborhoods are connected and/or overlap with each other. Such information is related to how information propagates in the neighborhood, and should be leveraged by a graph convolutional network.

We propose Curvature Graph Network (CurvGN), the first graph convolutional network built on advanced graph curvature information. The use of curvature information allows CurvGN to adapt to different local structural scenarios and filter messages passed between nodes differently. Notice that curvature captures how easily information flows between two nodes. Within a well-connected community, neighborhoods of adjacent nodes have large overlap and many shortcuts. The corresponding curvature is positive and passing information between the nodes is easy. For an edge serving as a bridge of two clusters, its curvature is negative and it is hard for information to pass. The key to our success is that we choose to be agnostic on whether curvature should be used to block or accelerate the messages in graph convolution. We exploit the curvature information in a data-driven manner and learn how to use it to reweigh different channels of the messages.

To further investigate how curvature information affects graph convolution, we carried out extensive experiments with various synthetic graphs and real-world graphs. Our synthetic graphs are generated according to various well-established graph models, e.g., stochastic block model (Decelle et al., 2011 ), Watts-Strogatz network (Watts & Strogatz, 1998) , Newman-Watts network (Newman & Watts, 1999) and Kleinberg's navigable small world graph (Kleinberg, 2000) . On these data, CurvGN outperforms vanilla graph network and networks using node degree information and self attention, demonstrating the benefit of curvature information in graph convolution. Such benefit is more apparent as the graph size increases. We hypothesize that graph convolution alone can adapt to any graph topology, at the cost of more convolutional layers and more training data. This is corroborated by our experiments on real-world graphs. CurvGN outperforms state-of-the-art graph neural networks, especially on large and dense graphs, which tend to have a large variation of local structures. The success of CurvGN demonstrates how topological intuitions inspire better practical solutions. It encourages us to continue the endeavor in applying theoretical insights in successful deployments of deep learning.

2. RELATED WORK:

We briefly summarize previous works on graph convolution. In early works (Frasconi et al., 1998; Sperduti & Starita, 1997) , recursive neural networks were applied on data whose underlying structures are directed acyclic graphs. In Graph Neural Networks (GNNs) (Gori et al., 2005; Scarselli et al., 2009) , the recursive network framework was extended to general graphs. Li et al. (2015) introduced gated recurrent units into the framework in order to improve the performance. Since Convolutional Neural Networks (CNNs) have demonstrated strong performance in grid-like-structured data, various methods have been proposed to implement "convolution" on graph-structured data. The efforts can be roughly divided into spectral approaches and spatial approaches. Below we will review both categories in details.

Spectral approach. Bruna et al. (2013) transformed the graph convolution into spectral domain multiplication by graph Fourier transform. This method is expensive due to the need to perform matrix eigen-decomposition. Furthermore, it cannot create spatially localized filters as in CNNs. Henaff et al. (2015) applied smooth coefficients on spectral filters to make them spatially localized. Defferrard et al. (2016) used Chebyshev expansion of the graph Laplacian to approximate the filters as a k-polynomial function. Kipf & Welling (2016) simplified those methods by reducing to degree one polynomials. Their method is to essentially filter the graph with a kernel whose receptive field is the one-hop neighborhood of each node. The common limitation of spectral approaches is that the convolution filters depend on the Laplacian of each specific graph.

Spatial approach. The main challenge of spatial approaches is to design an operator which applies to neighborhoods with different topology and still maintains shared filters. Monti et al. (2017) introduced a mixture model CNN (MoNet) that maps graph neighborhood into spatial neighborhood (with pseudo-coordinates) for spatial convolution. Hamilton et al. (2017) proposed GraphSAGE that samples fixed size neighbors and aggregates their representations. Veličković et al. (2017) proposed Graph Attention Network (GAT), which uses self-attention mechanism to reweigh graph convolution. Recently, there have been other methods which studied graph neural networks from different perspectives, such as pooling (Gao & Ji, 2019; Ying et al., 2018) .

Discrete graph curvature. Different proposals for discrete graph curvature have been introduced in recent years, including Ollivier-Ricci curvature (Ollivier, 2009; Lin et al., 2011) and Forman curvature (Forman, 2003) . We focus on Ollivier-Ricci curvature as it is more geometric in nature, while Forman curvature (Forman, 2003) is combinatorial and is faster to compute. Both curvatures have been applied to real-world graphs. Ni et al. (2015) showed that Ollivier-Ricci curvature can be used to identify backbone edges of an Internet AS graph and is closely related to network vulnerability. Similar applications are shown in the characterization of complex biological networks (Sandhu et al., 2015) . There are also applications of Ollivier-Ricci curvature in network alignment (Ni et al., 2018) and community detection (Ni et al., 2019; Sia et al., 2019) . Forman curvature is shown to have similar effect (Weber et al., 2017; 2016) . To the best of our knowledge, graph curvature has not been used in graph neural networks.

3. CURVATURE GRAPH NETWORK:

We first formulate the node label prediction problem and explain the mechanism of a Graph Neural Network (GNN). Suppose we have an undirected graph G = (V, E) with features on the vertices

H = (h 1 , h 2 , • • • , h n ), h i ∈ R F .

Here n = |V | is the number of nodes in the graph and F is the feature dimension of each node. Given labels of some nodes in V , we would like to predict the labels of the remaining nodes. A GNN iteratively updates the graph G's node representation and eventually predicts node labels. A GNN consists of multiple hidden layers that update node representation from a lower level node representation H t ∈ R n×F t where F t is feature dimension at the t-th layer to a higher level representation H t+1 ∈ R n×F t+1

. In particular, H 0 is the input feature H and F t = F . The last node representation, H T , are fed to a fully connected layer or a linear classifier to predict node labels. The layers and node representations are illustrated in the top of Figure 2 . Now we explain how to construct hidden layers that update node representations from H t to H t+1 . We focus on spatial approaches and treat convolution as a message passing scheme. The (t + 1)-th representation of node x is computed by aggregating messages passed from x's neighbors. We also include the message from x to itself. There are several aggregation methods, such as mean, max and sum. We choose summation as it is a commonly used aggregation method (Kipf & Welling, 2016; Veličković et al., 2017; Xu et al., 2018) . Denote by N (x) = N (x) ∪ {x} the neighborhood of x including itself. We have h t+1 x = σ t y∈N (x) M t y→x , in which σ t is a non-linear transformation. A message passed from y to x is a linear transformation of y's representation. We also introduce a weight τ t xy whose purpose will be clear later. Formally, we have M t y→x = τ t xy W t h t y , in which W t is the linear transformation matrix learned through training. Formally, we have the updating equation

h t+1 x = σ t y∈N (x) τ t xy W t h t y (3.1)

It is crucial to obtain suitable reweighting parameter τ t xy since it is directly affecting how information from neighbors of node x is passed to x. Some papers use node degree information as τ t xy (Kipf & Welling, 2016; Monti et al., 2017) and other work uses joint node features to compute self attention as τ t xy (Veličković et al., 2017) . We propose to use more advanced structural information, i.e., the Ricci curvature, to compute τ t xy . It is also known that the reweighting parameter τ t xy is not necessarily a scalar. It can be anything between a scalar and a F t+1 × F t+1 matrix. Empirically, we choose τ t xy as a vector in the experiments because a vector has more expressive power than a scalar and is easier to train than a matrix.

To develop the curvature convolution layer in Equation (3.1), we define discrete Ricci curvature in the context of a general graph in Section 3.1. We explain how to compute τ t xy from the curvature in Section 3.2.

3.1. RICCI CURVATURE:

In Riemannian geometry, curvature measures how a smooth object deviates from being flat, or being straight in the case of a line. Similar concepts can be extended to a non-smooth setting for discrete objects. In particular, curvature has been studied for metric-measure space (Bonciocat, 2014; Bonciocat & Sturm, 2009; Lott & Villani, 2009; Sturm et al., 2006) , Markov chain (Ollivier, 2009) and general graphs (Ollivier, 2009; Lin et al., 2011) . There are a number of possibilities to define discrete curvature for an edge in a graph. For example, the Gaussian curvature for a triangulated surface could be defined s.t. the curvature of a vertex is 2π (or π) minus the sum of corner angles (the angles of the triangles) at it, if it is an interior (or boundary) vertex. The definitions of curvatures easier to generalize in a discrete and general graph setting are sectional curvature and Ricci curvature.

Curvature computation. For a point x on the surface, considers two tangent vectors v and w x . Let y be the end point of the tangent vector v at x. Imagine transporting in parallel w x along v to a tangent vector w y at y. If the surface is flat, any pair of points x and y which is away from x and y along w x and w y will have the same distance as x and y. Its deviation from |v| defines the sectional curvature. Then averaging it over all directions of w x gives the Ricci curvature which only depends on the tangent vector v. Intuitively, instead of w x , we can think of S x be the set of end points of all tangent vectors at x with length . Again, if we map S x to S y using parallel transport along v, the distance between a point at S x and its corresponding image at S y can be different from |v| if the surface is not flat.

To generalize Ricci curvature to discrete spaces, Ollivier (2009) takes a coarse approach and represents S x as a probability measure m x of total mass 1 around x. Thus the distance can be measured by Wasserstein distance (or Earth Mover distance) which finds the optimal mass-preserving transportation plan between two probability measures. Then the coarse Ricci curvature κ xy on edge (x, y) is defined by comparing the Wasserstein distance W (m x , m y ) to the distance d(x, y), formally,

κ xy = 1 -W (m x , m y )/d(x, y).

The natural analogy of a small ball S x at point x in the metric space is the 1-hop neighborhood N (x) of node x in a graph. This motivates the Ollivier-Ricci curvature on graph edges. For an undirected graph G = (V, E), denote the set of neighboring nodes of a node x ∈ V as N (x) = {x 1 , x 2 , . . . , x k }. Then we can define a probability measure m α

x at x:

m α x (x i ) =    α if x i = x (1 -α)/k if x i ∈ N (x) 0 otherwise

where α is a parameter within [0, 1]. It is to keep probability mass of α at node x itself and distribute the rest uniformly over the neighborhood. We set α = 0.5, similar to (Ni et al., 2018) . To compute the Wasserstein distance W (m α x , m α y ) between the probability measures around two end points x, y of the edge (x, y), the optimal transportation plan can be solved by the following linear programming:

min M i,j d(x i , y j )M (x i , y j ) s.t. j M (x i , y j ) = m α x (x i ), ∀i; i M (x i , y j ) = m α y (y j ), ∀j (3.2)

where M (x i , y j ) is the amount of probability mass transported from node x i to y i along the shortest path with length d(x i , y j ). In the language of graph theory, if the Ollivier-Ricci curvature is negative (W (m α x , m α y ) > d(x, y)), the edge (x, y) serves as the bridge connecting the neighborhood around x and y. This aligns with the intuition in the smooth setting where the small balls S x and S y are closer to each other than their centers.

3.2. CURVATURE-DRIVEN GRAPH CONVOLUTION:

Next we present how Ricci curvature is used in our graph convolutional network. Intuitively, curvature measures how easily a message flows through an edge, and could be used to guide message passing in convolution. But its usage should really depend on the problem and data. We choose to be agnostic on how the knowledge of edge curvature should be used. We resort to a data-driven strategy and learn a mapping function that maps Ricci curvature κ xy to the weight of messages, i.e., τ t xy in Equation (3.1). We first explain how the mapping is learned end-to-end (CurvGN-1). Next we expand the mapping to a multi-valued version, to incorporate more flexibility in the model (CurvGN-n).

CurvGN-1. As mentioned before, τ t xy can be anything between a scalar and a F t+1 × F t+1 matrix. We first assume τ t xy is a scalar. Then the mapping function can be defined as:

f t : κ xy → τ t xy (3.3)

We create a multi-layer perceptron (MLP) to approximate the mapping function f t since MLP is proved to be a universal approximation machine and can be easily incorporated into our GNN model for end-to-end training. Denote the MLP at the t-th layer as MLP t . As summation is used as the aggregation function in Equation (3.1), the messages may accumulate to an arbitrarily large value. To prevent a numerical explosion, we apply a softmax function, S t , to MLP t (κ xy ) of all neighbors of x including itself, y ∈ N (x) nodes.

τ t xy = S t (MLP t (κ xy )) (3.4)

Figure 2 shows how MLP transforms curvature to reweigh messages.

CurvGN-n. Messages M t y→x are usually multi-channeled. In particular, they are F t+1 -dimensional. The scalar weight generated using curvature is not necessarily the same for different channels. To improve the expressing power of τ t xy , we create a similar mapping function as f t in Equation ( 3.3) but it generates a reweighting vector T t xy ∈ R F t+1 instead. In other words, we learn to reweigh different message channels differently. In principle, we can even learn a matrix of dimension R F t+1 × R F t+1 to reweigh the message. However, a vector has significantly fewer parameters to train and is found to be sufficient in practice.

Using the same strategy as CurvGN-1, the vector T t xy is calculated by applying a MLP t with F t+1 outputs. Then, we apply a channel-wise softmax function, S t , that normalizes the MLP outputs separately on each message channel: T t xy = S t (MLP t (κ xy )) Substituting T xy into Equation (3.1), we have the convolution of CurvGN-n:

h t+1 x = σ t y∈N (x) diag(T t xy )W t h t y (3.5)

where diag(T t xy ) is a matrix whose diagonal entries are entries of T t xy . For the details of MLP t , please refer to Appendix A.1.

3.3. DESIGN DETAILS OF THE NETWORK:

In practice, we use a two-convolutional-layer CurvGN model. The first layer is a linear transform layer that produces an output feature vector paired with a three layer MLP that computes reweighting vector. The output feature is pushed into an exponential linear unit layer to add non-linearity. The second layer is for classification, with the same structure as the first layer except that the output feature is now at length of class number. The hyperparameters are similar to GAT implemented in Veličković et al. (2017) . For synthetic experiments, the hidden layer output is reduced to 8 dimensions.

4. EXPERIMENTS:

We have evaluated our method for both synthetic and real-world graphs. Our method outperforms the state-of-the-art methods, especially on large and dense graphs, which tend to have heterogeneous topological structures. To demonstrate the prediction power, we use different graph theoretical models in synthetic experiments and different parameter settings to gain insights of how curvature information helps graph convolution. We focus on node classification tasks, while our method easily generalizes to graph classification tasks.

4.1. GRAPH THEORETICAL MODELS:

We generate synthetic data using different graph theoretical models. We start with the Stochastic Block Model (SBM) (Holland et al., 1983) , which assumes a partition of the graph into communities. We create random graphs, each with 1000 nodes and equally partition the node set into five disjoint communities. Nodes in the same community have the same class label. Edges are randomly sampled with an intra-community probability, p, for nodes within the same community and with an intercommunity probability, q, for nodes in different communities. We randomly create 100 graphs with p ranging in {0.05, 0.07, • • • , 0.23} and q ranging in {0.0, 0.005, • • • , 0.045}. For each generated graph, we randomly select 400 nodes as the training set, another 400 nodes as the validation set and the remaining 200 nodes as the test set. We assign each node with a randomly generated feature of dimension 10 and use them as uninformative input of our CurvGN.

Baselines. We compared our proposed methods, CurvGN-1 and CurvGN-n, with two popular state-of-the-art methods: GCN (Kipf & Welling, 2016) and GAT (Veličković et al., 2017) . For these methods, we use the same setting as for Cora dataset mentioned in (Veličković et al., 2017; Kipf & Welling, 2016) , except that the dimension of the hidden layer is 8. We also included a baseline method which aggregates messages without reweighting, namely, Vanilla GN. Compared with Vanilla GN, GCN reweighs messages using node degrees. GAT reweighs messages using self attention map computed using node representations. CurvGN-1 and CurvGN-n reweigh messages using the scalar and vector forms computed from Ollivier-Ricci curvature.

We ran all methods on 100 random graphs. For each graph, we ran the training and inference task 10 times and took average accuracy. For each training, we run 200 epochs and use validation set for early stopping. Figure 3 shows the heat maps for all methods. The title of each heatmap includes the max and average performance over all parameter settings. In Figure 3 (c), we run the same experiments on graphs with different sizes and report the average accuracy. Discussion. From the heatmaps, we observe that Vanilla GN, GCN and GAT are not better than random guessing. This implies node degree information is not enough. Meanwhile, we observe improved performance by CurvGN-1, confirming the power of reweighting with curvature in graph convolution. In addition, CurvGN-n outperforms CurvGN-1, suggesting that the multi-channel reweighting based on curvature is beneficial. Furthermore, in Figure 3 (c), we observe that the benefit of curvature increases as the graph size increases. We hypothesize that the graph convolution is sufficient in small graph setting to fully explore the graph structure and advanced structural information becomes important on graphs large in size and rich in structural diversity.

We also visualize the prediction results on one particular graph generated at (p, q) = (0.21, 0.025) in Figure 4 . We observe that CurvGN-1 and CurvGN-n make high quality predictions except for a small portion of data in a few communities. Meanwhile, other baselines can completely mix different communities and results are unsatisfactory. Further studies on different graph theoretic models. To further examine the expressive power of Ricci curvature, we run synthetic experiments using several well-accepted graph theoretical models: Watts-Strogatz model (Watts & Strogatz, 1998) , Newman-Watts model (Newman & Watts, 1999 ) and Kleinberg's navigable small world graphs (Kleinberg, 2000) . A Watts-Strogatz network randomly rewires edges of a ring graph. A Newman-Watts network randomly adds new edges to the ring. The Kleinberg's model also adds random edges, but the probability of a new edge is inversely proportional to the shortest path distance on the ring. In all these settings, we partition the ring into different communities and design experiments similar to the Stochastic Block Model. More details can be found in the Appendix A.2.

We compared all five methods on these different graph models and report the average accuracy over different parameter settings in Table 1 . The standard deviations on these results are generally large as we are averaging over different parameter settings. We observe consistently better performance of CurvGN-n than other methods. This confirms that curvature information is beneficial in a broad spectrum of graphs. We also note that GCN and GAT are indeed doing well for Watts-Strogatz and Newman-Watts models. This is because, in these networks, edge rewiring and addition enlarge differences in node degrees. Bridges crossing different communities tend to have higher node degree. Therefore, node degrees carry useful structural information and can help with graph convolution. We do not observe the same benefit of node degree information in SBM and Kleinberg's model as in these models, node degree is not correlated with the locations of bridges. More heatmap results can be found in the Appendix A.2. 

4.2. REAL-WORLD BENCHMARKS:

Our real-world benchmarks include two families of datasets: small sparse graphs and large dense graphs. We compare our networks CurvGN-1 and CurvGN-n with several strong baselines. Besides GCN and GAT that have been used in the experiments on synthetic data, we also compared CurvGN-1 and CurvGN-n with multilayer perceptron (MLP), MoNet (Monti et al., 2017) , WSCN (Morris et al., 2019) and GraphSAGE with mean aggregation (GS-mean) (Hamilton et al., 2017) . Our method is on par with state-of-the-art methods on relatively small graphs and greatly outperforms state-of-the-art methods on large and dense graphs, which tend to have heterogeneous graph topology.

Datasets. We use three popular citation network benchmark datasets: Cora, citetseer and PubMed (Sen et al., 2008) . We categorize Cora and citetseer into the first family since both Cora and citetseer graphs are relatively small and sparse. During the training stage, we set L 2 regularization with λ = 0.0005 for all datasets. Also, all the models are initialized by Glorot initialization and trained by minimizing cross-entropy loss using Adam SGD optimizer with learning rate 0.005. We apply an early stopping strategy based on the validation set's accuracy with a patience of 100 epochs. We compute curvature exactly following Eq. (3.2) for all datasets but one. For the Amazon Computer dataset, we use an approximation scheme for computational efficiency (Ni et al., 2018) . The linear programming problem is solved using an interior point solver (ECOS).

We report the mean and standard deviation of classification accuracy on test nodes on 100 runs and re-use the metrics reported by Monti et al. (2017) ; Shchur et al. (2018) ; Veličković et al. (2017) for other state-of-the-art methods. The results are reported in Table 2 . Our method is on par with state-of-the-art methods for relatively small graphs and achieves superior performance on large and dense graphs. This is consistent with our conclusion from synthetic experiments: when the graph is large and has heterogeneous topology, advanced structural information becomes critical in graph convolution. 

5. CONCLUSION:

We introduce a novel graph convolution network to leverage advanced graph structural information, namely, the graph curvature. The curvature information effectively helps to achieve superior performance on synthetic and real-world datasets, especially on large and dense graphs. This shows how principled mathematics and theory help the deployment of deep learning and encourages us to continue the endeavor in bridging the gap between graph theoretical foundation and neural networks. Since the edge is added with a probability proportional to 1/d(u, v), there can be long distance intercommunity edges. And the node degree can no longer capture the structural information introduced by the added edges. The GCN behaves similar to random guessing in this case. However, the Ricci Curvature is still negative on those inter community edges and it can still detect communities. Figure 6c shows the heatmaps of five different algorithms. CurvGN-n outperforms other methods by a large margin.

:

Note these models can be built on any d-dimensional grid. Ring is a special case when d = 1.

In general, the probability could be proportional to 1/d(u, v) m . We choose m to be 1.

Figures and Tables:

Figure 2: An overview of our Curvature Graph Network. The top row represents the iterative feature update function H t implemented by consecutive non-linear layers. The bottom row represents the computation of reweighting parameter τ t xy from the edge curvature information.

Figure 3: Heat maps on synthetic data by SBM. The top-right figure is the performance of Vanilla GN, CurvGN-1 and CurvGN-n over different graph sizes.

Figure 4: One SBM result with (p, q) = (0.21, 0.025). Small nodes are training set. Large nodes are testing set. Colors correspond to the predicted node labels.

(a) An example ring graph with n = 20, k = 4. (b) An example Watts-Strogatz graph with 100 nodes. (c) An example Kleinberg's graph with 100 nodes.

Figure 5: Visualization of theoretical graph models

Average prediction accuracy on four different graph models.

Table content: <table><tr><td>Method</td><td colspan="4">SBM Watts-Strogatz Newman-Watts Kleinberg</td></tr><tr><td>GCN</td><td>24%</td><td>32%</td><td>32%</td><td>23%</td></tr><tr><td>GAT</td><td>23%</td><td>30%</td><td>30%</td><td>22%</td></tr><tr><td colspan="2">Vanilla GN 28%</td><td>26%</td><td>27%</td><td>28%</td></tr><tr><td>CurvGN-1</td><td>31%</td><td>29%</td><td>29%</td><td>27%</td></tr><tr><td>CurvGN-n</td><td>36%</td><td>32%</td><td>33%</td><td>31%</td></tr></table>

They have thousands of nodes and edges with an average node degree below 2. We also use four extra datasets: Coauthor CS and Coauthor Physics which are co-authorship graphs based on the Microsoft Academic Graph from the KDD Cup 2016 challenge; Amazon Computers and Amazon Photos which are segments of the Amazon co-purchase graph inMcAuley et al. (2015). These graphs, together with PubMed, are large and dense graphs. Those graphs have more than 10 thousands node and 200 thousands edges with an average node degree as high as 20. We use the exact data splitting as in semi-supervised learning setting used in Kipf & Welling (2016);Veličković et al. (2017): using 20 nodes per class for training, 500 nodes for validation and 1000 nodes for testing. The descriptions and statistics for all datasets in our experiments can be found in the Appendix A.3.

Table content: <table/>

Performance on real-world benchmarks.

Table content: <table><tr><td>Method</td><td>Cora</td><td colspan="3">CiteSeer PubMed Coauthor Coauthor</td><td>Amazon</td><td>Amazon</td></tr><tr><td/><td/><td/><td>CS</td><td>Physics</td><td>Computer</td><td>Photo</td></tr><tr><td>MLP</td><td>58.2</td><td>59.1</td><td>70.0±2.1 88.3±0.7</td><td>88.9±1.1</td><td>44.9±5.8</td><td>69.6±3.8</td></tr><tr><td>MoNet</td><td>81.7</td><td>71.2</td><td>78.6±2.3 90.8±0.6</td><td>92.5±0.9</td><td>83.5±2.2</td><td>91.2±1.3</td></tr><tr><td>GS-mean</td><td>79.2</td><td>71.2</td><td>77.4±2.2 91.3±2.8</td><td>93.0±0.8</td><td>82.4±1.8</td><td>91.4±1.3</td></tr><tr><td>WSCN</td><td colspan="3">78.9±0.9 67.4±0.8 78.1±0.6 89.1±0.7</td><td>90.7±0.9</td><td>67.6±3.7</td><td>82.1±1.2</td></tr><tr><td>GCN</td><td colspan="3">81.5±0.5 70.9±0.5 79.0±0.3 91.1±0.5</td><td>92.8±1.0</td><td>82.6±2.4</td><td>91.2±1.2</td></tr><tr><td>GAT</td><td colspan="3">83.0±0.7 72.5±0.7 79.0±0.3 90.5±0.6</td><td colspan="3">92.5±0.9 78.0±19.0 85.1±20.3</td></tr><tr><td colspan="4">CurvGN-1 82.6±0.6 71.5±0.8 78.8±0.6 92.9±0.4</td><td>94.1±0.3</td><td>86.3±0.7</td><td>92.5±0.5</td></tr><tr><td colspan="4">CurvGN-n 82.7±0.7 72.1±0.6 79.2±0.5 92.8±0.3</td><td>94.3±0.2</td><td>86.5±0.7</td><td>92.5±0.5</td></tr></table>

Peer review (iclr2020):
Curvature graph network This paper proposes a novel network architecture “curvature graph network” that incorporates the Ricci curvature to fully utilize the graph structure. The Ricci curvature can measure the connectivity around an edge. The higher Ricci curvature, the denser connections there. This is very important information especially for extracting hidden clusters in the graph. The proposed curvature driven graph convolution network shows good experimental results on theoretical synthetic data sets and real world benchmark data sets. I recommend “weak accept” to this paper since this paper proposes an interesting concept and it looks promising. Pros. The authors introduce a very useful metric “Ricci curvature” CurvGN-1 and CurvGN-2 outperforms existing graph convolution algorithms. Cons. To run the proposed algorithm, we have to compute the Ricci curvature values for all edges. This can increase the inference time significantly. The authors should discuss the inference time and check it with a proper experiment.