C OLD E XPAND : S EMI -S UPERVISED G RAPH L EARNING IN C OLD S TART
Anonymous authors
Paper under double-blind review
A BSTRACT
Most real-world graphs are dynamic and eventually face the cold start problem.
A fundamental question is how the new cold nodes acquire initial information in order to be adapted in to the existing graph.
Here we propose a method that utilizes the deep autoencoding principle to extract structural information from the existing graph.
In particular, we apply graph convolutional networks to solve the ”Expanded Semi-Supervised Graph Learning” problem in cold start situations.
The proposed ColdExpand model classiﬁes the cold nodes based on link prediction with multiple goals to tackle.
We experimentally prove that by adding additional goal to existing link prediction method, our method outperforms the baseline in both expanded semi-supervised link prediction (at most 24%) and node classiﬁcation tasks (at most 15%).
To the best of our knowledge this is the ﬁrst study to address expansion of the semi-supervised learning to unseen nodes.
I NTRODUCTION
Graph-based semi-supervised learning has attracted much attention thanks to its applicability to real-world problems.
For example, a social network is graph-structured data in which people in the network are considered to be nodes and relationships between people are considered to be edges: two people are friends or sharing posts, etc.
With this structural information, we can infer some unknown attributes of a person (node) based on the information of people he is connected to (i.e., semi-supervised node classiﬁcation ).
In the case of retail applications, customers and products can be viewed as heterogeneous nodes and edges between customers and products can represent relationships between the customers and the purchased products.
Such a graph can be used to represent spending habits of each customer and we can recommend a product to a user by inferring the likelihood of connection between the user and the product (i.e., semi-supervised link prediction ).
Recent progress on Graph Neural Networks (GNN) (Bruna et al., 2013; Kipf & Welling, 2016a;
Gilmer et al., 2017;
Veli ˇ ckovi ´ c et al., 2018; Jia et al., 2019) allows us to effectively utilize the expressive power of the graph-structured data and to solve various graph related tasks.
Early GNN methods tackled semi-supervised node classiﬁcation task, a task to label all nodes within the graph when only a small subset of nodes is labeled, achieving a satisfactory performance (Zhou et al., 2004).
Link prediction is another graph-related task that was covered comparatively less than other tasks in the ﬁeld of GNNs.
In the link prediction task, the goal is to estimate the likelihood of connection between two nodes given node feature data and topological structure data.
Link prediction can be used in recommendation tasks (Chen et al., 2005;
Sarwar et al., 2001; Lika et al., 2014; Li &
Chen, 2013; Berg et al., 2017) or graph completion tasks (Kazemi & Poole, 2018; Zhang & Chen, 2018).
Most of the work on semi-supervised graph learning and link prediction assumes a static graph, that is, the structural information is at least partially observable in terms of nodes.
In the real world, however, new users or items can be added (as nodes) without any topological information (Gope & Jain, 2017).
Then, it is necessary to predict possible links (connections) of the novel node to existing nodes.
This is also referred as the cold start problem when a new node is presented to an existing graph without a single edge.
In contrast to the warm start case, in which at least some topological information is provided, the cold start problem is an extreme case where there isn’t any topological information to refer.
In this setting, previous semi-supervised learning algorithms can not propagate information to the cold nodes.
Even though the cold start problem is an extreme setting, it is an inevitable problem in order to expand the beneﬁts of semi-supervised learning to unseen nodes.
In this paper, we postulate the cold start problem as a fundamental issue, and tackle it by expanding semi-supervised learning even to the new cold nodes.
To this end, we suggest the ColdExpand method, the method that uses multi-task learning strategy to alleviate the cold start problem that typical graph learning methods face.
We experimentally prove that by adding an additional goal to the existing link prediction method, performance on the link prediction task is enhanced in every benchmark dataset and at most by 24%.
We also prove that our method can expand semi-supervised node classiﬁcation even to unseen, cold nodes.
To the best of our knowledge, this is the ﬁrst study to expand semi-supervised learning methods to unseen nodes.
In the next section, we brieﬂy introduce related works.
In Section 3, we deﬁne our problem deﬁnition.
Finally, in Section 4 we propose our
ColdExpand model followed by our experimental environments along with corresponding results.
R ELATED W ORK 2. S EMI - SUPERVISED N ODE C LASSIFICATION
Semi-supervised learning is a combination of unsupervised learning and supervised learning where true labels are only partially given.
Semi-supervised learning algorithms aim to improve the model’s performance by using unlabeled data points on top of labeled ones to approximate the underlying marginal data distribution (Van Engelen & Hoos, 2020).
One of the most popular ﬁelds of semi-supervised learning is graph based semi-supervised node classiﬁcation where all nodes should be classiﬁed when only a few node labels are given.
In order to smooth the given subset of labels throughout the graph, various methods have been studied to effectively represent nodes.
Deep
Walk (Perozzi et al., 2014), LINE (Tang et al., 2015), node2vec (Grover & Leskovec, 2016) were early deep-learning-based methods targeting the node classiﬁcation task by learning latent representations from truncated random walks.
However, these models fail to share parameters between nodes causing learning to be inefﬁcient.
Kipf & Welling (2016a) introduced Graph Convolutional
Networks (GCN) which use an efﬁcient layer-wise propagation rule by approximating the ﬁrst-order of spectral graph convolution.
By limiting the spectral convolution to the ﬁrst-order, GCNs not only lightened computation cost of the operation but also alleviated the over-ﬁtting problem that previous spectral methods had.
Commonly, GCN model is formed from stacked convolutional layers; the number of which decides how many hops of neighbors to consider for the convolution operation.
Gilmer et al.
(2017) presented Message Passing Neural Networks (MPNN) as a general form of spatial convolution operation and treated GCN as speciﬁc kind of a message passing process.
In MPNNs, information between nodes is delivered directly by edges without visiting any spectral domains.
2. L INK P REDICTION
Links in graph-structured data appeal important interactions between nodes that may not be represented solely by node attributes.
To this end, link prediction is an important task in order to effectively utilize graph data.
In the link prediction task, we aim to predict whether an edge exists between two nodes from the same graph.
Predicting the existence of links between nodes is useful for many applications including recommendation systems and graph completion tasks.
On a high level, link prediction methods can be separated into similarity-based and learning-based methods.
Similarity-based link prediction is the simplest way to predict the link by assigning a similarity score S xy between two nodes x, y .
Common Neighbors (Marchette & Priebe, 2008),
Salton Index, Jaccard Index (Leydesdorff, 2008), Sorensen Index, Hub Promoted Index, Hub Depressed Index
(Zhou et al., 2009), Leicht-Holme-Newman Index (LHN1) (Leicht et al., 2006)
each deﬁne similarity scores by using the overlapping set of neighboring nodes between two nodes.
While the former neighborhood-based methods focus on somewhat local similarity, other similarity-based methods consider global similarity by taking into account higher order links.
Katz Index (Katz, 1953) considers the ensemble of all paths between two nodes summed with quadratic weight according to the distance of each path.
SimRank (Jeh & Widom, 2002) also uses random walk process but measures how soon two random walkers from the two different nodes meet.
However, when a cold node is introduced, the required structural information needed for previous similarity-based approaches is missing, thus making them impossible to be applied in cold start situations (Wang et al., 2016).
On the other hand, learning-based methods formulate link prediction as a binary classiﬁcation problem given feature embedding vectors of two nodes; if an edge exists between the two nodes a positive label is given and vice versa.
Kipf & Welling (2016b) introduced the graph auto-encoder (GAE), an unsupervised learning technique, which aims to reconstruct the original adjacency matrix.
As a variant of GAE, variational graph auto-encoders (VGAE) additionally train a separate GCN module resulting in a log of variant matrix, Σ .
Additional Kullback-Leibler divergence loss between the distribution of encoder and decoder is added to the original reconstruction loss.
Pan et al.
(2019) further improved upon GAEs by applying adversarial training to regularize the latent node embedding matrix Z to match a prior distribution of the original node feature matrix X .
A simple MLP-based discriminator D was used for adversarial learning between the real distribution of G =
{ X, A } and the latent node matrix Z .
Unlike similarity-based methods, learning-based methods can be applied to cold start problems since they make use of node feature information along with topological structure information.
2. C OLD S TART P ROBLEM
The cold start problem is a common problem in real-world graph-structured data where new nodes may be added to an existing graph.
Most work tackling the cold start problem focuses on solving the recommendation problem in a cold start setting.
Recommendation systems are widely used in the real world applications such as friend recommendation, movie recommendation and purchase recommendation.
In the recommendation problem, the task is to predict recommendation links from a heterogeneous graph containing two types of graphs; a user-user social graph and user-item rating graph.
Users are involved in both types of graphs to connect the two types of graphs into a single heterogeneous graph.
The collaborative ﬁltering (CF) method is one of the traditional methods where a rating is predicted based on similarities between users or items.
In short, the CF method makes recommendations based on ratings given by other users in the social graph.
Sarwar et al.
(2001) introduced an item-based CF method, which computes item-item similarities, and proved it outperforms other user-based collaborative ﬁltering recommendation methods.
Efforts to make use of CF for recommendation systems in the cold start scenario have been made.
Lika et al.
(2014) approached the cold user problem by exploiting CF followed by hard-clustering of users based on their attributes.
Once the cluster of the new user has been decided, CF is only applied to members of the same cluster.
Berg et al.
(2017) formulated the matrix completion task of recommendation systems as a link prediction problem by viewing the user-item graph as a bipartite interaction graph.
However, they instead used a ”warm start” setting where at least one rating for a user is given which is not precisely a cold start assumption.
P ROBLEM D EFINITION
A graph G is denoted as a pair ( V , E ) with V = { v 1 , ..., v N } the set of nodes (vertices), and
E ∈ V × V the set of edges.
Each node v i is associated with a feature vector x i ∈ R F .
To make notation more compact, the set of node feature vectors of graph G is denoted as a matrix
X =
[ x 1 , x 2 , ..., x N ] (cid:62) ∈ R N × F .
Additionally, a graph has an N -by- N adjacency matrix A where
A i,j represents the existence of an edge between v i and v j and a degree matrix D , a diagonal matrix which contains information about the degree of each node.
In the cold start setting, we will call those nodes that are newly introduced without any link from the existing graph cold nodes and let them be denoted by v ci .
In the same manner, existing nodes in the graph are denoted as v ej .
Then, X e only contains feature vectors of existing nodes x e 0 , x e 1 , x e 2 , . . .
, x eN e and X c contains feature vectors of cold nodes x c 0 , x c 1 , x c 2 , . .
, x cN c , where N c and N e are the number of existing nodes and cold nodes, respectively.
In our problem setting, we assume that new nodes are added to the existing graph and need to ﬁnd possible links between new nodes and existing nodes followed by a node classiﬁcation to ﬁgure out the hidden attributes of new nodes.
Our problem deﬁnition is as follows:
Given existing graph,
G =
( V e , A ) , and cold nodes X c , ﬁnd out all possible links between cold nodes X c and existing nodes X e , then predict the class of cold nodes X c .
M ETHOD
Here we present our method, the ColdExpand, that compensates the lack of topological information from the cold nodes by adding an additional task of semi-supervised node classiﬁcation to a deep autoencoding principle in the stage of edge reconstruction.
4. L INK P REDICTION OF C OLD N ODES
Predicting possible edges of cold nodes is an important sub-goal for expanding a semi-supervised learning but is by itself still a difﬁcult task because the only clue the new node provides is its own node features.
As mentioned in Section 2.2, traditional similarity-based link prediction methods are not applicable in the cold start setting since no neighboring nodes of the cold node are known.
On the other hand, learning-based link prediction algorithms (Passino et al., 2019; Kipf & Welling, 2016b;
Pan et al., 2019) can be applied in the cold start setting by computing similarity scores between two embedded node feature vectors followed by a binary classiﬁcation layer.
Still, while embeddings of the existing nodes are conditioned on both the node feature and the features of neighboring nodes, embeddings of the cold nodes refer only to their own node features without any help from the topological structure of the graph resulting in isolated learning.
[Equation]
when N ( x i ) is a set of neighboring nodes of node x i and weights of the GNN encoder are shared between the two.
This hinders traditional GNN encoders from generalizing their training to the cold nodes.
In order to make a common goal that can be accomplished by both existing nodes x e and cold nodes x c , we train the GCN Encoder with an additional node classiﬁcation goal as given by the following equation.
[Equation]
4. C OLD E XPAND
Figure 2 illustrates the overall structure of our ColdExpand model.
Our model is composed of two parts; ﬁrst, the GCN module for link prediction on the cold nodes and, secondly, the GCN module for classiﬁcation on the cold nodes.
We denote the ﬁrst GCN module as GCN Encoder and the second
GCN module as GCN Classiﬁer.
In the GCN Encoder, graph G and a cold node v c are given as input.
We use two basic GCN layers as suggested in (Kipf & Welling, 2016a) for an encoder to get the embedded node vector Z .
In order to predict any possible links of the cold node v c , we feed this embedded node vector Z to an inner product decoder which is similar to previous link prediction methods (Passino et al., 2019; Kipf & Welling, 2016b; Pan et al., 2019).
Along with original edges, predicted links are then fed to the GCN Classiﬁer for node classiﬁcation.
One GCN layer can be written as follows:
[Equation]
where ˜ A is an adjacency matrix of graph G with additional self connections and ˜ D is the degree matrix of ˜ A .
Using the basic GCN layer, the embedding node matrix for all existing nodes X e and cold nodes X c is represented as follows:
[Equation]
The inner product decoder computes the sigmoid of the inner product between two embedded node vectors.
A ec indicates possible edges between the existing nodes and the cold nodes.
The probability of existence of a link between existing nodes x ei and cold nodes x cj is deﬁned as follows:
[Equation]
Once the probabilities of links have been computed, new hard links for the cold nodes can be added.
[Equation]
A cc can be obtained in a same manner.
Then the new ˆ A is fed to the GCN Classiﬁer for node classiﬁcation on the cold nodes.
In order to maintain a continuous gradient along the model, we use the convolution operation with edge weights.
Weights of all additional edges A ec , A cc are determined by the probability score of the edge, p ( A ecij = 1) while all the other weights for existing edges are ﬁxed to 1.
[Equation]
we only use ˆ Y c ∈ ˆ Y for class prediction on cold nodes.
For optimization, we use two losses for multi-task learning.
The ﬁrst loss is a link reconstruction loss from the link prediction part of the model and the second loss is node classiﬁcation loss from GCN Classiﬁer.
[Equation]
Finally, the total loss is represented as a weighted sum of the two losses.
λ is a hyperparameter for training.
[Equation]
[Table]
E XPERIMENT 5. D ATASET
In order to evaluate the performance of graph learning in the cold start setting, we ﬁrst select 10% of randomly shufﬂed nodes as a test set of cold nodes.
Then we create positive edge samples of the set of cold nodes by parsing all links in and out of the cold nodes and every other non-links become negative samples.
Whole positive and negative edge samples are used as test sets for the cold start link prediction task and are hidden in the training stage along with the class labels of cold nodes.
This process is done in 10-fold cross-validation on all nodes in the dataset.
In similar fashion, 5% of the nodes were masked as validation set and another 10% of the nodes as training set.
During training we choose the same amount of negative edge samples as positive edge samples.
At last, in the training period edges of 20% of nodes were masked.
For semi-supervised node classiﬁcation only 10% of the labels of the nodes were given.
5. B ASELINE
Since there are not many prior works for cold start graph learning tasks, we created some baselines to prove the beneﬁts of our model.
5.2. E XPANDED S EMI -S UPERVISED L INK P REDICTION
We used learning-based link prediction algorithms GAE, VGAE (Kipf & Welling, 2016b) and
ARGA (Pan et al., 2019) to compare the performance of link generation for cold nodes.
For fair comparison we have restricted the number of edges used in training to 10%.
Then each link prediction method was trained with the ColdExpand method by adding an additional task of node classiﬁcation with loss function as given in Equation 13.
5.2. E XPANDED S EMI - SUPERVISED N ODE C LASSIFICATION
The simplest baseline for semi-supervised node classiﬁcation is a linear model that only considers node attributes of the graph.
The number of labels that the model can see was restricted for fair comparison.
[Equation]
The other baselines are vanilla GNNs which are trained on the existing graph and used to predict the labels of the cold nodes.
In this setting, the same number of labels for existing nodes are provided during training.
[Equation]
There are several training strategies for our ColdExpand model.
In the ColdExpand-Freeze model, ﬁrst part of the model, the GCN Encoder, is pre-trained with a multi-task goal under ﬁxed λ .
Once pre-training is completed, weights of the GCN Encoder are frozen and training on the GCN Classiﬁer takes place.
Unlike the ColdExpand-Freeze model, the ColdExpand-Unfreeze model updates the weights of the GCN Encoder along with the GCN Classiﬁer.
For the ColdExpand models, we choose the best setting among several choices of λ .
To demonstrate the advantage of adding an additional task, we also tested with ColdExpand-CLS which shares the same model architecture but only uses
L cls for optimization.
Each test was done with various convolutional GNN methods including GCN,
GraphSAGE (Hamilton et al., 2017), and GAT (Veliˇckovi´c et al., 2017).
5. R ESULTS 5.3. R ESULTS OF L INK P REDICTION ON C OLD N ODES
[Table]
Table 2 illustrates the results of expanded semi-Supervised link prediction on cold nodes in area under the ROC curve (AUC) scores for each benchmark and dataset.
Training with our
ColdExpand strategy, ColdExpand encoders outperform most learning-based algorithms in reconstructing the links of the cold nodes.
Especially in the Cora and CiteSeer datasets which have enough number of classes, our model improves the performance (at most 24%) by a large margin.
In PubMed, where there are only 3 classes of labels, our model achieves 5.7% higher AUC score.
With the additional training goal, our model deﬁnitely outperforms traditional link prediction methods on predicting the possible links of the cold nodes and training is more beneﬁcial when there are enough number of classes.
[Table] [Table]
Results from Table 3 shows experimental results on the expanded semi-supervised node classiﬁcation task in comparison to various other models.
On every dataset, our ColdExpand method performed better than traditional GNN methods in the cold start setting.
The linear function model which does not consider topological structure of a graph, generally performed poorly.
However for
PubMed, which has only three classes of labels, the linear function model showed performance close to our model.
On other dataset, our ColdExpand model outperformed linear and vanilla GNN models by a big gap in performance:
Cora (15%), CiteSeer (8%).
Another notable result from the experiment was number of additional edges each GCN Encoder generates.
In case of ColdExpand-CLS where classiﬁcation loss was solely used for optimization, the number of the additional edges tends to explode, generating much more edges between cold nodes and existing nodes.
On the other hand, other ColdExpand models generated relatively fewer edges (around 75% of ColdExpand-CLS) using the link prediction loss as a regularizer for the GCN Encoder.
Results show that in general, ColdExpand-Unfreeze model works better than ColdExpand-Freeze model.
While traditional link prediction methods focus on reconstructing 1-hop links, Klicpera et al.
(2019) found that diffusion of graph, considering neighbors from multiple hops, improves semisupervised learning without over-smoothing problem.
This indicates that one-hop link prediction may not be the best solution for classifying the nodes.
By training GCN Encoder during the stage of node classiﬁcation we can ﬁnd such links that can improve node classiﬁcation that traditional link prediction methods could not ﬁnd.
In contrast, PubMed is a large graph with many nodes which degrades the effect of noisy connections.
[Figure]
Figure 3 illustrates trend of the results on cold start link prediction with different hyperparameter, λ , which decides the amount of additional classiﬁcation loss to be considered.
Each dataset has different property resulting in a different optimal λ .
From the trend we can easily ﬁgure out that adding an additional task beneﬁts cold start link prediction.
This approach was more effective when there were enough distinct classes to map nodes to.
C ONCLUSION
In this paper, we draw attention to a new task Expanded Semi-Supervised Learning which is a task to extend semi-supervised learning even to cold nodes.
Even though the cold start environment is an extreme situation, most real-world applications must face it.
We proposed the ColdExpand method which uses multi-task strategy to overcome the lack of topological information from cold nodes.
Our new task can be applied in many categories of machine learning.
For example, community detection is a task of discovering overlapping groups of nodes, also referred to as communities, that share similar properties from the network graph.
While most works on community detection only focused on static social networks (Leskovec & Mcauley, 2012;
Chen et al., 2017; Li et al., 2019; Jia et al., 2019), it is critical that learning can be propagated even to new users.
Our method can be used to categorize and adapt a new user to an existing community.
In addition, solving the cold start problem in graphs is an important stepping stone for incremental learning.
Incremental learning (Joshi & Kulkarni, 2012) is a learning policy that extends its existing model as new samples are dynamically added.
Graphs that can grow incrementally can be used to broaden the knowledge in cognitive models that rely on topological structure such as Adaptive Resonance Theory (Carpenter & Grossberg, 2010) or the Neural Gas model (Fritzke, 1995).