Year: 2019

Abstract:
We present graph wavelet neural network (GWNN), a novel graph convolutional neural network (CNN), leveraging graph wavelet transform to address the shortcomings of previous spectral graph CNN methods that depend on graph Fourier transform. Different from graph Fourier transform, graph wavelet transform can be obtained via a fast algorithm without requiring matrix eigendecomposition with high computational cost. Moreover, graph wavelets are sparse and localized in vertex domain, offering high efficiency and good interpretability for graph convolution. The proposed GWNN significantly outperforms previous spectral graph CNNs in the task of graph-based semi-supervised classification on three benchmark datasets: Cora, Citeseer and Pubmed.

text: We present graph wavelet neural network (GWNN), a novel graph convolutional neural network (CNN), leveraging graph wavelet transform to address the shortcomings of previous spectral graph CNN methods that depend on graph Fourier transform. Different from graph Fourier transform, graph wavelet transform can be obtained via a fast algorithm without requiring matrix eigendecomposition with high computational cost. Moreover, graph wavelets are sparse and localized in vertex domain, offering high efficiency and good interpretability for graph convolution. The proposed GWNN significantly outperforms previous spectral graph CNNs in the task of graph-based semi-supervised classification on three benchmark datasets: Cora, Citeseer and Pubmed.

heading: 1 INTRODUCTION
text: Convolutional neural networks (CNNs) (LeCun et al., 1998) have been successfully used in many machine learning problems, such as image classification (He et al., 2016) and speech recognition (Hinton et al., 2012), where there is an underlying Euclidean structure. The success of CNNs lies in their ability to leverage the statistical properties of Euclidean data, e.g., translation invariance. However, in many research areas, data are naturally located in a non-Euclidean space, with graph or network being one typical case. The non-Euclidean nature of graph is the main obstacle or challenge when we attempt to generalize CNNs to graph. For example, convolution is not well defined in graph, due to that the size of neighborhood for each node varies dramatically (Bronstein et al., 2017).
Existing methods attempting to generalize CNNs to graph data fall into two categories, spatial methods and spectral methods, according to the way that convolution is defined. Spatial methods define convolution directly on the vertex domain, following the practice of the conventional CNN. For each vertex, convolution is defined as a weighted average function over all vertices located in its neighborhood, with the weighting function characterizing the influence exerting to the target vertex by its neighbors (Monti et al., 2017). The main challenge is to define a convolution operator that can handle neighborhood with different sizes and maintain the weight sharing property of CNN. Although spatial methods gain some initial success and offer us a flexible framework to generalize CNNs to graph, it is still elusive to determine appropriate neighborhood.
Spectral methods define convolution via graph Fourier transform and convolution theorem. Spectral methods leverage graph Fourier transform to convert signals defined in vertex domain into spectral domain, e.g., the space spanned by the eigenvectors of the graph Laplacian matrix, and then filter is defined in spectral domain, maintaining the weight sharing property of CNN. As the pioneering work of spectral methods, spectral CNN (Bruna et al., 2014) exploited graph data with the graph Fourier transform to implement convolution operator using convolution theorem. Some subsequent works make spectral methods spectrum-free (Defferrard et al., 2016; Kipf & Welling, 2017; Khasanova & Frossard, 2017), achieving locality in spatial domain and avoiding high computational cost of the eigendecomposition of Laplacian matrix.
In this paper, we present graph wavelet neural network to implement efficient convolution on graph data. We take graph wavelets instead of the eigenvectors of graph Laplacian as a set of bases, and define the convolution operator via wavelet transform and convolution theorem. Graph wavelet neural network distinguishes itself from spectral CNN by its three desirable properties: (1) Graph wavelets can be obtained via a fast algorithm without requiring the eigendecomposition of Laplacian matrix, and thus is efficient; (2) Graph wavelets are sparse, while eigenvectors of Laplacian matrix are dense. As a result, graph wavelet transform is much more efficient than graph Fourier transform; (3) Graph wavelets are localized in vertex domain, reflecting the information diffusion centered at each node (Tremblay & Borgnat, 2014). This property eases the understanding of graph convolution defined by graph wavelets.
We develop an efficient implementation of the proposed graph wavelet neural network. Convolution in conventional CNN learns an individual convolution kernel for each pair of input feature and output feature, causing a huge number of parameters especially when the number of features is high. We detach the feature transformation from convolution and learn a sole convolution kernel among all features, substantially reducing the number of parameters. Finally, we validate the effectiveness of the proposed graph wavelet neural network by applying it to graph-based semi-supervised classification. Experimental results demonstrate that our method consistently outperforms previous spectral CNNs on three benchmark datasets, i.e., Cora, Citeseer, and Pubmed.

heading: 2 OUR METHOD

heading: 2.1 PRELIMINARY
text: Let G = {V,E,A} be an undirected graph, where V is the set of nodes with |V| = n, E is the set of edges, and A is adjacency matrix withAi,j = Aj,i to define the connection between node i and node j. The graph Laplacian matrix L is defined as L = D−A where D is a diagonal degree matrix with Di,i = ∑ j Ai,j , and the normalized Laplacian matrix is L = In−D−1/2AD−1/2 where In is the identity matrix. Since L is a real symmetric matrix, it has a complete set of orthonormal eigenvectors U = (u1,u2, ...,un), known as Laplacian eigenvectors. These eigenvectors have associated real, non-negative eigenvalues {λl}nl=1, identified as the frequencies of graph. Eigenvectors associated with smaller eigenvalues carry slow varying signals, indicating that connected nodes share similar values. In contrast, eigenvectors associated with larger eigenvalues carry faster varying signals across connected nodes.

heading: 2.2 GRAPH FOURIER TRANSFORM
text: Taking the eigenvectors of normalized Laplacian matrix as a set of bases, graph Fourier transform of a signal x ∈ Rn on graph G is defined as x̂ = U>x, and the inverse graph Fourier transform is x = Ux̂ (Shuman et al., 2013). Graph Fourier transform, according to convolution theorem, offers us a way to define the graph convolution operator, denoted as ∗G . Denoting with y the convolution kernel, ∗G is defined as
x ∗G y = U ( (U>y) (U>x) ) , (1)
where is the element-wise Hadamard product. Replacing the vector U>y by a diagonal matrix gθ, then Hadamard product can be written in the form of matrix multiplication. Filtering the signal x by the filter gθ, we can write Equation (1) as UgθU>x.
However, there are some limitations when using Fourier transform to implement graph convolution: (1) Eigendecomposition of Laplacian matrix to obtain Fourier basis U is of high computational cost with O(n3); (2) Graph Fourier transform is inefficient, since it involves the multiplication between a dense matrix U and the signal x; (3) Graph convolution defined through Fourier transform is not localized in vertex domain, i.e., the influence to the signal on one node is not localized in its neighborhood. To address these limitations, ChebyNet (Defferrard et al., 2016) restricts convolution kernel gθ to a polynomial expansion
gθ = K−1∑ k=0 θkΛ k, (2)
where K is a hyper-parameter to determine the range of node neighborhoods via the shortest path distance, θ ∈ RK is a vector of polynomial coefficients, and Λ =diag({λl}nl=1). However, such a polynomial approximation limits the flexibility to define appropriate convolution on graph, i.e., with a smaller K, it’s hard to approximate the diagonal matrix gθ with n free parameters. While with a largerK, locality is no longer guaranteed. Different from ChebyNet, we address the aforementioned three limitations through replacing graph Fourier transform with graph wavelet transform.

heading: 2.3 GRAPH WAVELET TRANSFORM
text: Similar to graph Fourier transform, graph wavelet transform projects graph signal from vertex domain into spectral domain. Graph wavelet transform employs a set of wavelets as bases, defined as ψs = (ψs1, ψs2, ..., ψsn), where each wavelet ψsi corresponds to a signal on graph diffused away from node i and s is a scaling parameter. Mathematically, ψsi can be written as
ψs = UGsU >, (3) where U is Laplacian eigenvectors, Gs=diag ( g(sλ1), ..., g(sλn) ) is a scaling matrix and g(sλi) = eλis.
Using graph wavelets as bases, graph wavelet transform of a signal x on graph is defined as x̂ = ψ−1s x and the inverse graph wavelet transform is x = ψsx̂. Note that ψ −1 s can be obtained by simply replacing the g(sλi) in ψs with g(−sλi) corresponding to a heat kernel (Donnat et al., 2018). Replacing the graph Fourier transform in Equation (1) with graph wavelet transform, we obtain the graph convolution as
x ∗G y = ψs((ψ−1s y) (ψ−1s x)). (4)
Compared to graph Fourier transform, graph wavelet transform has the following benefits when being used to define graph convolution:
1. High efficiency: graph wavelets can be obtained via a fast algorithm without requiring the eigendecomposition of Laplacian matrix. In Hammond et al. (2011), a method is proposed to use Chebyshev polynomials to efficiently approximate ψs and ψ−1s , with the computational complexity O(m× |E|), where |E| is the number of edges and m is the order of Chebyshev polynomials. 2. High spareness: the matrix ψs and ψ−1s are both sparse for real world networks, given that these networks are usually sparse. Therefore, graph wavelet transform is much more computationally efficient than graph Fourier transform. For example, in the Cora dataset, more than 97% elements in ψ−1s are zero while only less than 1% elements in U > are zero (Table 4).
3. Localized convolution: each wavelet corresponds to a signal on graph diffused away from a centered node, highly localized in vertex domain. As a result, the graph convolution defined in Equation (4) is localized in vertex domain. We show the localization property of graph convolution in Appendix A. It is the localization property that explains why graph wavelet transform outperforms Fourier transform in defining graph convolution and the associated tasks like graph-based semisupervised learning.
4. Flexible neighborhood: graph wavelets are more flexible to adjust node’s neighborhoods. Different from previous methods which constrain neighborhoods by the discrete shortest path distance, our method leverages a continuous manner, i.e., varying the scaling parameter s. A small value of s generally corresponds to a smaller neighborhood. Figure 1 shows two wavelet bases at different scale on an example network, depicted using GSP toolbox (Perraudin et al., 2014).

heading: 2.4 GRAPH WAVELET NEURAL NETWORK
text: Replacing Fourier transform with wavelet transform, graph wavelet neural network (GWNN) is a multi-layer convolutional neural network. The structure of the m-th layer is
Xm+1[:,j] = h(ψs p∑ i=1 Fmi,jψ −1 s X m [:,i]) j = 1, · · · , q, (5)
where ψs is wavelet bases, ψ−1s is the graph wavelet transform matrix at scale s which projects signal in vertex domain into spectral domain, Xm[:,i] with dimensions n × 1 is the i-th column of Xm, Fmi,j is a diagonal filter matrix learned in spectral domain, and h is a non-linear activation function. This layer transforms an input tensor Xm with dimensions n × p into an output tensor Xm+1 with dimensions n× q. In this paper, we consider a two-layer GWNN for semi-supervised node classification on graph. The formulation of our model is
first layer : X2[:,j] = ReLU(ψs p∑ i=1 F 1i,jψ −1 s X 1 [:,i]) j = 1, · · · , q, (6)
second layer : Zj = softmax(ψs q∑ i=1 F 2i,jψ −1 s X 2 [:,,i]) j = 1, · · · , c, (7)
where c is the number of classes in node classification, Z of dimensions n × c is the prediction result. The loss function is the cross-entropy error over all labeled examples:
Loss = − ∑ l∈yL c∑ i=1 YlilnZli, (8)
where yL is the labeled node set, Yli = 1 if the label of node l is i, and Yli = 0 otherwise. The weights F are trained using gradient descent.

heading: 2.5 REDUCING PARAMETER COMPLEXITY
text: In Equation (5), the parameter complexity of each layer is O(n× p× q), where n is the number of nodes, p is the number of features of each vertex in current layer, and q is the number of features of each vertex in next layer. Conventional CNN methods learn convolution kernel for each pair of input feature and output feature. This results in a huge number of parameters and generally requires huge training data for parameter learning. This is prohibited for graph-based semi-supervised learning. To combat this issue, we detach the feature transformation from graph convolution. Each layer in GWNN is divided into two components: feature transformation and graph convolution. Spectially, we have
feature transformation : Xm ′ = XmW , (9)
graph convolution : Xm+1 = h(ψsF mψ−1s X m′). (10)
where W ∈ Rp×q is the parameter matrix for feature transformation, Xm′ with dimensions n × q is the feature matrix after feature transformation, Fm is the diagonal matrix for graph convolution kernel, and h is a non-linear activation function.
After detaching feature transformation from graph convolution, the parameter complexity is reduced from O(n× p× q) to O(n+ p× q). The reduction of parameters is particularly valuable fro graphbased semi-supervised learning where labels are quite limited.

heading: 3 RELATED WORKS
text: Graph convolutional neural networks on graphs. The success of CNNs when dealing with images, videos, and speeches motivates researchers to design graph convolutional neural network on graphs. The key of generalizing CNNs to graphs is defining convolution operator on graphs. Existing methods are classified into two categories, i.e., spectral methods and spatial methods.
Spectral methods define convolution via convolution theorem. Spectral CNN (Bruna et al., 2014) is the first attempt at implementing CNNs on graphs, leveraging graph Fourier transform and defining convolution kernel in spectral domain. Boscaini et al. (2015) developed a local spectral CNN approach based on the graph Windowed Fourier Transform. Defferrard et al. (2016) introduced a Chebyshev polynomial parametrization for spectral filter, offering us a fast localized spectral filtering method. Kipf & Welling (2017) provided a simplified version of ChebyNet, gaining success in graph-based semi-supervised learning task. Khasanova & Frossard (2017) represented images as signals on graph and learned their transformation invariant representations. They used Chebyshev approximations to implement graph convolution, avoiding matrix eigendecomposition. Levie et al. (2017) used rational functions instead of polynomials and created anisotropic spectral filters on manifolds.
Spatial methods define convolution as a weighted average function over neighborhood of target vertex. GraphSAGE takes one-hop neighbors as neighborhoods and defines the weighting function as various aggregators over neighborhood (Hamilton et al., 2017). Graph attention network (GAT) proposes to learn the weighting function via self-attention mechanism (Velickovic et al., 2017). MoNet offers us a general framework for design spatial methods, taking convolution as the weighted average of multiple weighting functions defined over neighborhood (Monti et al., 2017). Some works devote to making graph convolutional networks more powerful. Monti et al. (2018) alternated convolutions on vertices and edges, generalizing GAT and leading to better performance. GraphsGAN (Ding et al., 2018) generalizes GANs to graph, and generates fake samples in low-density areas between subgraphs to improve the performance on graph-based semi-supervised learning.
Graph wavelets. Sweldens (1998) presented a lifting scheme, a simple construction of wavelets that can be adapted to graphs without learning process. Hammond et al. (2011) proposed a method to construct wavelet transform on graphs. Moreover, they designed an efficient way to bypass the eigendecomposition of the Laplacian and approximated wavelets with Chebyshev polynomials. Tremblay & Borgnat (2014) leveraged graph wavelets for multi-scale community mining by modulating a scaling parameter. Owing to the property of describing information diffusion, Donnat et al. (2018) learned structural node embeddings via wavelets. All these works prove that graph wavelets are not only local and sparse but also valuable for signal processiong on graph.

heading: 4 EXPERIMENTS

heading: 4.1 DATASETS
text: To evaluate the proposed GWNN, we apply GWNN on semi-supervised node classification, and conduct experiments on three benchmark datasets, namely, Cora, Citeseer and Pubmed (Sen et al., 2008). In the three citation network datasets, nodes represent documents and edges are citation links. Details of these datasets are demonstrated in Table 1. Here, the label rate denotes the proportion of labeled nodes used for training. Following the experimental setup of GCN (Kipf & Welling, 2017), we fetch 20 labeled nodes per class in each dataset to train the model.

heading: 4.2 BASELINES
text: We compare with several traditional semi-supervised learning methods, including label propagation (LP) (Zhu et al., 2003), semi-supervised embedding (SemiEmb) (Weston et al., 2012), manifold regularization (ManiReg) (Belkin et al., 2006), graph embeddings (DeepWalk) (Perozzi et al., 2014), iterative classification algorithm (ICA) (Lu & Getoor, 2003) and Planetoid (Yang et al., 2016).
Furthermore, along with the development of deep learning on graph, graph convolutional networks are proved to be effective in semi-supervised learning. Since our method is a spectral method based on convolution theorem, we compare it with the Spectral CNN (Bruna et al., 2014). ChebyNet (Defferrard et al., 2016) and GCN (Kipf & Welling, 2017), two variants of the Spectral CNN, are also included as our baselines. Considering spatial methods, we take MoNet (Monti et al., 2017) as our baseline, which also depends on Laplacian matrix.

heading: 4.3 EXPERIMENTAL SETTINGS
text: We train a two-layer graph wavelet neural network with 16 hidden units, and prediction accuracy is evaluated on a test set of 1000 labeled samples. The partition of datasets is the same as GCN (Kipf & Welling, 2017) with an additional validation set of 500 labeled samples to determine hyper-parameters.
Weights are initialized following Glorot & Bengio (2010). We adopt the Adam optimizer (Kingma & Ba, 2014) for parameter optimization with an initial learning rate lr = 0.01. For computational efficiency, we set the elements of ψs and ψ−1s smaller than a threshold t to 0. We find the optimal hyper-parameters s and t through grid search, and the detailed discussion about the two hyperparameters is introduced in Appendix B. For Cora, s = 1.0 and t = 1e − 4. For Citeseer, s = 0.7 and t = 1e − 5. For Pubmed, s = 0.5 and t = 1e − 7. To avoid overfitting, dropout (Srivastava et al., 2014) is applied. Meanwhile, we terminate the training if the validation loss does not decrease for 100 consecutive epochs.

heading: 4.4 ANALYSIS ON DETACHING FEATURE TRANSFORMATION FROM CONVOLUTION
text: Since the number of parameters for the undetached version of GWNN is O(n × p × q), we can hardly implement this version in the case of networks with a large number n of nodes and a huge number p of input features. Here, we validate the effectiveness of detaching feature transformation form convolution on ChebyNet (introduced in Section 2.2), whose parameter complexity is O(K × p × q). For ChebyNet of detaching feature transformation from graph convolution, the number of parameters is reduced to O(K + p × q). Table 2 shows the performance and the number of parameters on three datasets. Here, the reported performance is the optimal performance varying the order K = 2, 3, 4.
As demonstrated in Table 2, with fewer parameters, we improve the accuracy on Pubmed by a large margin. This is due to that the label rate of Pubmed is only 0.003. By detaching feature transformation from convolution, the parameter complexity is significantly reduced, alleviating overfitting in semi-supervised learning and thus remarkably improving prediction accuracy. On Citeseer, there is a little drop on the accuracy. One possible explanation is that reducing the number of parameters may restrict the modeling capacity to some degree.

heading: 4.5 PERFORMANCE OF GWNN
text: We now validate the effectiveness of GWNN with detaching technique on node classification. Experimental results are reported in Table 3. GWNN improves the classification accuracy on all the three
datasets. In particular, replacing Fourier transform with wavelet transform, the proposed GWNN is comfortably ahead of Spectral CNN, achieving 10% improvement on Cora and Citeseer, and 5% improvement on Pubmed. The large improvement could be explained from two perspectives: (1) Convolution in Spectral CNN is non-local in vertex domain, and thus the range of feature diffusion is not restricted to neighboring nodes; (2) The scaling parameter s of wavelet transform is flexible to adjust the diffusion range to suit different applications and different networks. GWNN consistently outperforms ChebyNet, since it has enough degree of freedom to learn the convolution kernel, while ChebyNet is a kind of approximation with limited degree of freedom. Furthermore, our GWNN also performs better than GCN and MoNet, reflecting that it is promising to design appropriate bases for spectral methods to achieve good performance.

heading: 4.6 ANALYSIS ON SPARSITY
text: Besides the improvement on prediction accuracy, wavelet transform with localized and sparse transform matrix holds sparsity in both spatial domain and spectral domain. Here, we take Cora as an example to illustrate the sparsity of graph wavelet transform.
The sparsity of transform matrix. There are 2,708 nodes in Cora. Thus, the wavelet transform matrix ψ−1s and the Fourier transform matrix U
> both belong to R2,708×2,708. The first two rows in Table 4 demonstrate that ψ−1s is much sparser than U
>. Sparse wavelets not only accelerate the computation, but also well capture the neighboring topology centered at each node.
The sparsity of projected signal. As mentioned above, each node in Cora represents a document and has a sparse bag-of-words feature. The input feature X ∈ Rn×p is a binary matrix, and X[i,j] = 1 when the i-th document contains the j-th word in the bag of words, it equals 0 otherwise. Here, X[:,j] denotes the j-th column of X , and each column represents the feature vector of a word. Considering a specific signal X[:,984], we project the spatial signal into spectral domain, and get its projected vector. Here, p = ψ−1s X[:,984] denotes the projected vector via wavelet transform, q = U>X[:,984] denotes the projected vector via Fourier transform, and p, q ∈ R2,708. The last row in Table 4 lists the numbers of non-zero elements in p and q. As shown in Table 4, with wavelet transform, the projected signal is much sparser.

heading: 4.7 ANALYSIS ON INTERPRETABILITY
text: Compare with graph convolution network using Fourier transform, GWNN provides good interpretability. Here, we show the interpretability with specific examples in Cora.
Each feature, i.e. word in the bag of words, has a projected vector, and each element in this vector is associated with a spectral wavelet basis. Here, each basis is centered at a node, corresponding to a document. The value can be regarded as the relation between the word and the document. Thus, each value in p can be interpreted as the relation between Word984 and a document. In order to elaborate the interpretability of wavelet transform, we analyze the projected values of different feature as following.
Considering two features Word984 and Word1177, we select the top-10 active bases, which have the 10 largest projected values of each feature. As illustrated in Figure 2, for clarity, we magnify the local structure of corresponding nodes and marked them with bold rims. The central network in each subgraph denotes the dataset Cora, each node represents a document, and 7 different colors represent 7 classes. These nodes are clustered by OpenOrd (Martin et al., 2011) based on the adjacency matrix.
Figure 2a shows the top-10 active bases of Word984. In Cora, this word only appears 8 times, and all the documents containing Word984 belong to the class “ Case-Based ”. Consistently, all top-10 nodes activated by Word984 are concentrated and belong to the class “ Case-Based ”. And, the frequencies of Word1177 appearing in different classes are similar, indicating that Word1177 is a universal word. In concordance with our expectation, the top-10 active bases of Word1177 are discrete and belong to different classes in Figure 2b.
Owing to the properties of graph wavelets, which describe the neighboring topology centered at each node, the projected values of wavelet transform can be explained as the correlation between features and nodes. These properties provide an interpretable domain transformation and ease the understanding of graph convolution.

heading: 5 CONCLUSION
text: Replacing graph Fourier transform with graph wavelet transform, we proposed GWNN. Graph wavelet transform has three desirable properties: (1) Graph wavelets are local and sparse; (2) Graph wavelet transform is computationally efficient; (3) Convolution is localized in vertex domain. These advantages make the whole learning process interpretable and efficient. Moreover, to reduce the number of parameters and the dependence on huge training data, we detached the feature transformation from convolution. This practice makes GWNN applicable to large graphs, with remarkable performance improvement on graph-based semi-supervised learning.

heading: 6 ACKNOWLEDGEMENTS
text: This work is funded by the National Natural Science Foundation of China under grant numbers 61425016, 61433014, and 91746301. Huawei Shen is also funded by K.C. Wong Education Foundation and the Youth Innovation Promotion Association of the Chinese Academy of Sciences.

heading: APPENDIX A LOCALIZED GRAPH CONVOLUTION VIA WAVELET TRANSFORM
text: We use a diagonal matrix Θ to represent the learned kernel transformed by wavelets ψ−1s y, and replace the Hadamard product with matrix muplication. Then Equation (4) is:
x ∗G y = ψsΘψ−1s x. (11)
We set ψs = (ψs1, ψs2, ..., ψsn), ψ−1s = (ψ ∗ s1, ψ ∗ s2, ..., ψ ∗ sn), and Θ = diag({θk}nk=1). Equation (11) becomes :
x ∗G y = n∑ k=1 θkψsk(ψ ∗ sk) >x. (12)
As proved by Hammond et al. (2011), both ψs and ψ−1s are local in small scale (s). Figure 3 shows the locality of ψs1 and ψ∗s1, i.e., the first column in ψs and ψ −1 s when s = 3. Each column in ψs and ψ−1s describes the neighboring topology of target node, which means that ψs and ψ −1 s are local. The locality of ψsk and ψ∗sk leads to the locality of the resulting matrix of multiplication between the column vector ψsk and row vector (ψ∗sk) >. For convenience, we set Mk = ψsk(ψ∗sk) >, Mk[i,j] > 0 only when ψsk[i] > 0 and (ψ∗sk) >[j] > 0. In other words, if Mk[i,j] > 0, vertex i and vertex j can correlate with each other through vertex k.
Since each Mk is local, for any convolution kernel Θ, ψsΘψ−1s is local, and it means that convolution is localized in vertex domain. By replacing Θ with an identity matrix in Equation (12), we get x ∗G y = ∑n k=1 Mkx. We define H = ∑n k=1 Mk, and Figure 4 shows H[1,:] in different scaling, i.e., correlation between the first node and other nodes during convolution. The locality of H suggests that graph convolution is localized in vertex domain. Moreover, as the scaling parameter s becomes larger, the range of feature diffusion becomes larger.

heading: APPENDIX B INFLUENCE OF HYPER-PARAMETERS
text: GWNN leverages graph wavelets to implement graph convolution, where s is used to modulate the range of neighborhoods. From Figure 5, as s becomes larger starting from 0, the range of neighboring nodes becomes large, resulting the increase of accuracy on Cora. However when s becomes too large, some irrelevant nodes are included, leading to decreasing of accuracy. The hyperparameter t only used for computational efficiency, has any slight influence on its performance.
For experiments on specific dataset, s and t are choosen via grid search using validation. Generally, a appropriate s is in the range of [0.5, 1], which can not only capture the graph structure but also guarantee the locality of convolution, and t is less insensive to dataset.

heading: APPENDIX C PARAMETER COMPLEXITY OF NODE CLASSIFICATION
text: We show the parameter complexity of node classification in Table 5. The high parameter complexity O(n ∗ p ∗ q) of Spectral CNN makes it difficult to generalize to real world networks. ChebyNet approximates the convolution kernel via polynomial function of the diagonal matrix of Laplacian eigenvalues, reducing parameter complexity to O(K ∗ p ∗ q) with K being the order of polynomial function. GCN simplifies ChebyNet via setting K=1. We detach feature transformation from graph convolution to implement GWNN and Spectral CNN in our experiments, which can reduce parameter to O(n+ p ∗ q).
In Cora and Citeseer, with smaller parameter complexity, GWNN achieves better performance than ChebyNet, reflecting that it is promising to implement convolution via graph wavelet transform. As Pubmed has a large number of nodes, the parameter complexity of GWNN is larger than ChebyNet. As future work, it is an interesting attempt to select wavelets associated with a subset of nodes, further reducing parameter complexity with potential loss of performance.

heading: APPENDIX D FAST GRAPH WAVELETS WITH CHEBYSHEV POLYNOMIAL
text: APPROXIMATION
Hammond et al. (2011) proposed a method, using Chebyshev polynomials to efficiently approximate ψs and ψ−1s . The computational complexity is O(m × |E|), where |E| is the number of edges and m is the order of Chebyshev polynomials. We give the details of the approximation proposed in Hammond et al. (2011).
With the stable recurrence relation Tk(y) = 2yTk−1(y)− Tk−2(y), we can generate the Chebyshev polynomials Tk(y). Here T0 = 1 and T1 = y. For y sampled between -1 and 1, the trigonometric expression Tk(y) = cos(k arccos(y)) is satisfied. It shows that Tk(y) ∈ [−1, 1] when y ∈ [−1, 1]. Through the Chebyshev polynomials, an orthogonal basis for the Hilbert space of square integrable functions L2([−1, 1], dy√
1−y2 ) is formed. For each h in this Hilbert space, we have a uniformly convergent Chebyshev series h(y) = 12c0 + ∑∞ k=1 ckTk(y), and the Chebyshev coefficients ck = 2 π ∫ 1 −1 Tk(y)h(y)√ 1−y2 dy = 2π ∫ π 0 cos(kθ)h(cos(θ))dθ. A fixed scale s is assumed. To approximate g(sx) for x ∈ [0, λmax], we can shift the domain through the transformation x = a(y + 1), where a = λmax
2 . T ′ k(x) = Tk( x−a a ) denotes the shifted Chebyshev polynomials, with x−a a ∈ [−1, 1]. Then we have g(sx) = 12c0 + ∑∞ k=1 ckT ′ k(x), and x ∈ [0, λmax], ck = 2π ∫ π 0 cos(kθ)g(s(a(cos(θ) + 1)))dθ. we truncate the Chebyshev expansion to m terms and achieve Polynomial approximation.
Here we give the example of the ψ−1s and g(sx) = e −sx, the graph signal is f ∈ Rn. Then we can give the fast approximation wavelets by ψ−1s f = 1 2c0f + ∑m k=1 ckT ′ k(L)f . The efficient computation of T ′k(L) determines the utility of this approach, where T ′ k(L)f = 2 a (L− I)(T ′ k−1(L)f)− T ′k−2(L)f .

heading: APPENDIX E ANALYSIS ON SPASITY OF SPECTRAL TRANSFORM AND
text: LAPLACIAN MATRIX
The sparsity of the graph wavelets depends on the sparsity of the Laplacian matrix and the hyperparameter s, We show the sparsity of spectral transform matrix and Laplacian matrix in Table 6.
The sparsity of Laplacian matrix is sparser than graph wavelets, and this property limits our method, i.e., the higher time complexity than some methods depending on Laplacian matrix and identity matrix, e.g., GCN. Specifically, both our method and GCN aim to improve Spectral CNN via designing localized graph convolution. GCN, as a simplified version of ChebyNet, leverages Laplacian matrix as weighted matrix and expresses the spectral graph convolution in spatial domain, acting as spatial-like method (Monti et al., 2017). However, our method resorts to using graph wavelets as a new set of bases, directly designing localized spectral graph convolution. GWNN offers a localized graph convolution via replacing graph Fourier transform with graph wavelet transform, finding good spectral basis with localization property and good interpretability. This distinguishes GWNN from ChebyNet and GCN, which express the graph convolution defined via graph Fourier transform in vertex domain.

Review summaries:
This paper proposes to learn graph wavelet kernels through a neural network. This idea is interesting, even if it is not a real surprise, given the interesting features graph wavelets, and the explosion of proposals for graph neural networks. Yet, the paper is interesting, pretty complete, and the proposed algorithm is shown to be relatively effective.