Title: NOIGAN: NOISE AWARE KNOWLEDGE GRAPH EMBEDDING WITH GAN

Abstract: Knowledge graph has gained increasing attention in recent years for its successful applications of numerous tasks. Despite the rapid growth of knowledge construction, knowledge graphs still suffer from severe incompletion and inevitably involve various kinds of errors. Several attempts have been made to complete knowledge graph as well as to detect noise. However, none of them considers unifying these two tasks even though they are inter-dependent and can mutually boost the performance of each other. In this paper, we proposed to jointly combine these two tasks with a unified Generative Adversarial Networks (GAN) framework to learn noise-aware knowledge graph embedding. Extensive experiments have demonstrated that our approach is superior to existing state-of-the-art algorithms both in regard to knowledge graph completion and error detection.

1. INTRODUCTION:

Knowledge graph, as a well-structured effective representation of knowledge, plays a pivotal role in many real-world applications such as web search (Graupmann et al., 2005) , question answering (Hao et al., 2017; Yih et al., 2015) , and personalized recommendation (Zhang et al., 2016) . It is constructed by extracting information as the form of triple from unstructured text using information extraction systems. Each triple (h, r, t) represents a relation r between a head entity h and a tail entity t. Recent years have witnessed extensive construction of knowledge graph, such as Freebase (Bollacker et al., 2008) , DBPedia (Auer et al., 2007) , and YAGO (Suchanek et al., 2007) . However, these knowledge graphs suffer from severe sparsity as we can never collect all the information. Moreover, due to the huge volumes of web resources, the task to construct knowledge graph usually involves automatic mechanisms to avoid human supervision and thus inevitably introduces many kinds of errors, including ambiguous, conflicting and erroneous and redundant information.

To address these shortcomings, various methods for knowledge graph refinement have been proposed, whose goals can be arguably classified into two categories: (1) knowledge graph completion, the task to add missing knowledge to the knowledge graph, and (2) error detection, the task to identify incorrect triples in the knowledge graph. Knowledge graph embedding (KGE) currently hold the state-of-the-art in knowledge graph completion for their promising results (Bordes et al., 2013; Yang et al., 2014) . Nonetheless, they highly rely on high quality training data and thus are lack of robustness to noise (Pujara et al., 2017) . Error detection in knowledge graph is a challenging problem due to the difficulty of obtaining noisy data. Reasoning based methods are the most widely used methods for this task (Paulheim, 2017) . Without the guidance of noisy data, they detect errors by performing reasoning over the knowledge graph to determine the correctness of a triple. A rich ontology information is required for such kind of methods and thus impede its application for real-world knowledge graphs.

Existing works consider knowledge graph embedding and error detection independently whereas these two tasks are inter-dependent and can greatly influence each other. On one hand, error detection model is extremely useful to prepare reliable data for knowledge graph embedding. On the other hand, high quality embedding learned by KGE model provides a basis for reasoning to identify noisy data. Inspired by the recent advances of generative adversarial deep models (Goodfellow et al., 2014) , in this paper, we proposed to jointly combine these two tasks with a unified GAN framework, known as NoiGAN, to learn noise-aware knowledge graph embedding. In general, NoiGAN consists of two main components, a noise-aware KGE model to learn robuster representation of knowledge and an adversarial learning framework for error detection. During the training, noiseaware KGE model takes the confidence score learned by GAN as guidance to eliminate the noisy data from the learning process whereas the GAN requires that KGE model continuously provides high quality embedding as well as credible positive examples to model the discriminator and the generator. Cooperation between the two components drives both to improve their capability. The main contributions of this paper are summarized as follows:

• We propose a unified generative adversarial framework NoiGAN, to learn noise-aware knowledge graph embedding. Under the framework, the KGE model and error detection model could benefit from each other: the error detection model prepares reliable data for KGE model to improve the quality of embedding it learns, while the KGE model provides a promising reasoning model for the error detection model to better distinguish noisy triples from the correct one.

• Our proposed framework can be easily generalized to various KGE models to enhance their ability in dealing with noisy knowledge graph.

• We experimentally demonstrate that our new algorithm is superior to existing state-of-the-art algorithms. The KGE model and GAN can alternately and iteratively boost performance in terms of both knowledge graph completion and noise detection.

2. RELATED WORK:



2.1. KNOWLEDGE GRAPH COMPLETION:

Embedding based methods currently hold the state-of-the-art in knowledge graph completion for their promising results (Wang et al., 2017b) . They aim to capture the similarity of entities by embedding entities and relations into continuous low-dimensional vectors. Existing methods can be roughly divided into two categories: translational distance models and semantic matching models.

Translational distance models measure the plausibility of a fact as the distance between two entities after a translation carried out by the relation. TransE (Bordes et al., 2013) , TransH (Wang et al., 2014) and TransR (Lin et al., 2015) are the representative approaches in this category. Semantic matching models measure plausibility of facts by matching latent semantics of entities and relations embodied in their vector space representations. The typical models include RESCAL (Nickel et al., 2011) , DistMult (Yang et al., 2014) and ComplEx (Trouillon et al., 2016) . To optimize the KGE model,negative sampling is usually required to minimize the margin based ranking loss. A conventional method to construct negative samples is randomly sampling. However, negative samples generated through a random mode are often too easy to be discriminated from positive facts and thus make little contribute towards the training. Some recent works proposed to incorporate GAN for better negative sampling to improve the quality of embeddings (Wang et al., 2018; Cai & Wang, 2017) . Nonetheless, none of the above methods has taken the potential noisy data into consideration, which leads to their sensitivity to unreliable data (Pujara et al., 2017) . In this paper, we proposed a novel technique to enable current embedding models to cope with noisy data.

2.2. ERROR DETECTION IN KNOWLEDGE GRAPH:

Due to lack of noisy data samples, error detection in knowledge graph is a challenging task. Existing methods can be either ontology based or anomaly detection based. Ontology based methods address this problem by exploring additional ontology information. A larger number of ontology reasoners are developed to utilize logic programming to derive uncovering contradictions among observed facts (Luther et al., 2009; Dentler et al., 2011; Ding et al., 2007) . Rich ontology information is required for such kind of methods and thus impede its application to real-world knowledge graphs. Another kind of methods is anomaly detection based methods (Wienand & Paulheim, 2014; Fleischhacker et al., 2014) . The main drawback of anomaly detection based methods are that they do not necessarily identify errors, but also natural outliers, which will compromise the objectivity of its results. More recently, a novel confidence-aware framework (Xie et al., 2018; Shan et al., 2018) proposed to incorporate triple confidence into KGE model to detect noises while learning knowledge representations simultaneously. However, it measures the triple confidence merely based on the how well the triple fits the model, which is easily affected by model bias. Before further discussing the detail of the algorithm, we first give a formal definition to knowledge graph. A knowledge graph, denoted by G = {E, R, T }, consists of a set of entities E, a set of relations R and a set of of observed facts T = {(h, r, t) | h, t ∈ E, r ∈ R}. A fact is represented by a triple (h, r, t), where h, t and r denote head entity, tail entity, and relation, respectively.

3.1. NOISE AWARE KNOWLEDGE GRAPH EMBEDDING MODEL:

To learn a more robust representation for noisy knowledge graph, we propose a noise-aware KGE model to eliminate the impact of noise over embedding vectors by incorporating confidence score into KGE model. It can be easily adapted to any KGE models. For example, we can follow TransE to represent entities and relations. Given a fact (h, r, t), TransE aims to learn corresponding low dimensional vectors h, r and t in the same space for h, r and t, so that the distance between h + r and t is minimized. The scoring function of TransE is then defined as

f r (h, t) = h + r -t 2 1 .

To optimize the KGE model, we use a loss function similar to the negative sampling loss in (Mikolov et al., 2013) according to (Sun et al., 2019) .

(h,r,t)∈T [(-log σ(γ -f r (h, t)) + (h ,r,t )∈N (h,r,t) 1 |N (h, r, t)| log σ(γ -f r (h , t )))]

where γ is the margin, σ is the sigmoid function, T represents the observed facts from the knowledge graph and (h , r, t ) is the negative sample for triple (h, r, t). To reduce the effects of randomness, we sample multiple negative triples for each observed fact. We denote the negative triples set of a triple (h, r, t) as N (h, r, t). Negative triples set is constructed by replacing the head or tail entity of the observed triples with an entity sampled randomly from entity set E:

N (h, r, t) = {(h , r, t)|h ∈ E} ∪ {(h, r, t )|t ∈ E}, (h, r, t) ∈ T

A vast majority of existing embedding models assume that all triple facts hold true to knowledge graph, which is inappropriate. In fact, knowledge graph contains many kinds of errors (e.g., ambiguous, conflicting, erroneous, redundant) due to the automatic construction process. To isolate the impact of noise over embedding vectors, following (Shan et al., 2018) , we adopted the concept confidence to describe whether a triple fact is noisy or not. In (Shan et al., 2018) , confidence of a triple is measured by how well the triple fits to the KGE model. A central issue with such measurement is that it is easily affected by model bias and thus lead to unreliability. Unlike (Shan et al., 2018) , we learned the confidence scores using a discriminator, which can be more impartial and promising. We will discuss how to obtain such discriminator in Section 3.2.2. With the introduction of confidence, we can eliminate the noisy data from the learning process of KGE model.

L KGE = (h,r,t)∈T C(h, r, t).[(-log σ(γ-f r (h, t))+ (h ,r,t )∈N (h,r,t) 1 |N (h, r, t)| log σ(γ-f r (h , t )))]

where C(h, r, t) is the confidence score assigned to each positive triple (h, r, t). To be specific, C(h, r, t) can be both a binary variable or a soft value from the interval [0, 1]. We denote the previous one as the hard version and the later one as the soft version.

3.2. GAN FOR NOISE IDENTIFICATION:

After introducing our noise aware KGE model, we now show how to identify the error in knowledge graph to enhance embedding quality. Typically label information about noisy triples is costly and labor intensive to obtain, which is the central challenge to the task of error detection. Without the guidance of noisy data, previous works propose to leverage ontology information to exploit reasoning for inconsistency detection. However, these ontology information can also be difficult to gain. To address this problem, inspired by recent advance of GAN, we propose a novel end-to-end adversarial learning framework to detect noise in knowledge graph. The proposed GAN cooperates with the noise aware KGE model in an interactive way. GAN utilizes the embedding learned by the noise aware KGE model to distinguish true triples and noisy triples. Meanwhile the noise-aware KGE model requires GAN to learn a confidence score so as to eliminate the impact of noise over embedding vectors.

Our adversarial learning framework consists of two components, a generator and a discriminator. Unlike traditional GAN whose ultimate goal is to train a good generator, we aim to produce a good discriminator to distinguish noisy triples from true triples. To address noisy data deficiency issue, the generator and the discriminator act as two players in a minimax game: the generator learns to continually generate "more confusing" triples and thus provides better quality noisy data for the discriminator, whereas the discriminator is trained to draw a clear distinction between the true triples and the noisy triples generated by its opponent generator. Formally, it can be formulated as follows:

max D min G V (G, D) = (h,r,t)∈T E (h,r,t)∼T [log D((h, r, t); θ D )] + E (h ,r,t )∼G(•|(h,r,t);θ G ) [log(1 -D((h , r, t ); θ D ))]

where T represents the true triples set. To get rid of the noise in knowledge graph, we construct T with top 10% triples which fit the KGE the best. We discuss the detailed implementation of the generator and discriminator as follows.

3.2.1. TRIPLE GENERATOR:

To identify the error in knowledge graph, first we have to achieve reliable examples of noisy data. Since such data is costly and labor intensive to obtain, we instead introduce a generator to produce them. The main goal of the generator is to generator high-quality fake triples that can fool discriminators, which aims at bringing a better classifier to identify error in knowledge graph. In addition, to simultaneously make KGE model aware of the existing noisy data, we also explicitly incorporate the noisy triples generated by the generator as negative samples to train the noise aware KGE model.

Note that, the generator takes embedding vectors learned by the noise-aware KGE model as input.

Given a true triples (h, r, t), the generator aims to select the most likely triples to be the noisy triples (h , r, t ) from its negative samples candidate set N (h, r, t). To achieve this goal, a two-layer fully-connected neural network is introduced to model the probability distribution over the candidate negative samples N (h, r, t). In particular, this MLP uses ReLU as the activation function for the first layer and adds Softmax to the second layer. It takes the concatenation of the embedding vectors h , r and t of triple (h , r, t ) as input and output the probability whether the triple (h , r, t ) is the most likely noisy triple. As the output of the generator is a discrete triple, training for the generator is a little tricky due to data indifferentiability issue. A common solution is to use policy gradient based reinforcement learning instead (Wang et al., 2017a) . In particular, for a generated triple, the reward from discriminator is defined as f D (h , r, t ), which is exactly the probability of the triple (h , r, t ) to be true. Thus, in order to fool the discriminator, the generator is trained to maximize the expected reward as follows:

EQUATION

At the very beginning, because of lack of guidance, the generator generates "noise" by random sampling. However, such "noise" is too easy for discriminator to distinguish and result in a low reward. By learning to maximize the reward, the generator continually learns better probability distribution of the candidate negative samples and keep generating "more confusing" triples to improve the capacity of the discriminator. Moreover, this generator can also be used to produce high quality negative samples for the noise aware KGE model.

3.2.2. DISCRIMINATOR:

Discriminator aims to distinguish the true triples from the noisy triples. Both positive and negative examples are required to train the discriminator. Generator learns to provide reliable negative examples for the discriminator while observed triples in knowledge graph can be regarded as positive examples. However, as knowledge graph is noisy, considering all observed triples as positive samples will inevitably introduce noise. We therefore utilize an interesting observation, when noisy data exist, deep learning models tend to memorize these noise in the end, which leads to the poor generalization performance (Han et al., 2018) . Specifically, we take top 10% triples which fit the KGE the best (with lowest f r (h, t)) as positive training examples. Considering discriminator is essentially a binary classifier, the objective function of the discriminator can be formulated as minimizing the following cross entropy loss:

EQUATION

where f D (h, r, t) = σ(MLP(h, r, t)) where MLP is a two-layer neural network with ReLU as activation function and σ(x) = 1/(1 + exp(-x)) is the standard sigmoid function. If we use TransE as our KGE model, the MLP takes the vector h + rt as input and output the probability of the triple (h, r, t) being true. f D (h, r, t) will later be used to define C(h, r, t) for each positive triple (h, r, t) in knowledge graph. To be specific, C(h, r, t) can be either a binary value or a soft value. When it is a binary variable, it represents the classification result regard to whether a triple is a true triple.

When it takes a soft value, it indicates the probability of the triple (h, r, t) being true. We denote the previous one as a hard version of our proposed model and the later one as the soft version.

Algorithm 1 NoiGAN Framework:

Require: Observed triples in knowledge bases T 1: Initialize C(h, r, t) as 1 for all triples. 2: Train noise aware KGE model with random negative sampling until convergence.

3: for n = 1 : N do 4:

Take top 10% triples which fit the noise aware KGE the best as positive examples.

5::

Train GAN with the selected positive examples until convergence.

6::

Update C(h, r, t) according to discriminator of GAN.

7::

Train noise aware KGE model with negative samples generated by the generator until convergence. discriminator learns a classifier to distinguish the positive triples from the negative triples. After we obtain the well trained GAN model, given the confidence score assigned by the discriminator and the negative samples generated by the generator, we retrain the noise aware KGE model and update the embedding vectors. The process repeats until convergence. The embeddings learned by the noise aware KGE model is regarded as our final representation for entities and relations.

4. EXPERIMENTS:



4.1. EXPERIMENTAL SETTINGS:

Datasets. We evaluate our NoiGAN on five benchmark datasets, including FB15K, WN18 ,FB15K-237, WN18RR and YAGO3-10. These benchmark datasets benefit from human curation that results in highly reliable facts. To simulate the real-world knowledge graphs extracted automatically from unstructured text data, we modified these benchmark datasets to include noisy triples. Since all kinds of noise might be contained while we construct knowledge graphs, our approach to introducing noise is to substitute the true head entity or tail entity with any randomly selected entity. Following this approach, we construct five KGs based on each benchmark dataset with noisy triples to be different ratio of (e.g., 40%, 70% and 100%) of true triples. All noisy datasets share the same entities, relations, validation and test sets with the original benchmark dataset, with all generated noisy triples fused into the original training set. The statistics of these knowledge graphs are summarized in Table 1 .

Baselines. NoiGAN is compared with the following state-of-the-art algorithm, including (1) KGE models (e.g., TransE (Bordes et al., 2013) ,DistMult (Yang et al., 2014) and RotateE (Sun et al., 2019) ), (2) robust KGE models ( e.g., attention based method (Nathani et al., 2019) ), (3) noise aware KGE models (e.g., CKRL (Xie et al., 2018) ) and (4) KGE models with GAN (e.g., KBGAN (Cai & Wang, 2017) ). In particular, there are three kinds of triple confidences defined in CKRL (Xie et al., 2018) . In our paper, we take CKRL with local triple confidence, called CKRL (LT), as baseline.

To fairly compare different methods, the same loss function and negative sampling strategies are employed for all models.

Experimental Setup of NoiGAN. We evaluate two versions of our NoiGAN model as mentioned in Section 3.2.2. The soft version is denoted as NoiGAN (soft) while the hard version is denoted as NoiGAN (hard). To show that our NoiGAN can be easily generalized to various KGE models, TransE (Bordes et al., 2013) and RotateE (Sun et al., 2019) are implemented as score function for NoiGAN. Adam (Kingma & Ba, 2014 ) is adopted as the optimizer. We set the parameters for all Dataset FB15K YAGO3-10 WN18 Metric AUC Spe AUC Spe AUC Spe CKRL (LT) .548 .006 .455 .018 .704 .000 .687 .008 .521 .000 .710 .000 .725 .018 .577 1.000 .725 .000 Table 

4.2. KNOWLEDGE GRAPH NOISE DETECTION:

To verify the capability of NoiGAN in distinguishing noises in knowledge graphs, we evaluate NoiGAN in terms of classification performance. To be specific, we classify the training data by determining whether a triple is being true. For NoiGAN (hard), we can directly utilize the discriminator to classify noise. Whereas, for NoiGAN (soft), the discriminator only assigns a soft score between 0 to 1 to each triple, indicating the probability of a triple being true. We thus classify the triples by regarding the triple who have C(h, r, t) > 0.5 as the true triple and the remaining as noise. The experiments are conducted on three benchmark datasets, including FB15K, WN18 and YAGO3-10 with noisy triples to be different ratio of 10%, 20% and 40% of true triples. Although FB15K and WN18RR suffer from test triple leakage in the training set (Dettmers et al., 2018) , we report the results over training data, which won't be affected by the issue. As we make similar observations on NoiGAN-TransE and NoiGAN-RotatE, we only report the experimental results w.r.t. NoiGAN-TransE to save space.

Evaluation Metric. Two classification evaluation metrics are adopted, including (1) AUC; (2) A special measurement defined as the proportion of actual noises that are correctly identified. It can be calculated as TN TN+FP , where TN represents true negative while FP represents false positive. Results. The results w.r.t. NoiGAN-TransE can be found in Table 2 . We compared against CKRL (LT) as it is the only baseline method which is able to detect noise in the training dataset. We can observe that: (1) Our model consistently achieves the best performances over all datasets in all cases, which demonstrates the capability of our models in detecting noises. (2) NoiGAN-TransE (hard) has significant improvements in noise detection compared to NoiGAN-TransE (soft) . Considering that NoiGAN-TransE (soft) merely assigns low confidence scores to noisy triples while NoiGAN-TransE (hard) completely eliminates these data, this result further validates that our method can classify noisy data accurately. (3) The baselines tend to classify all triples into the same class, which shows their inability in detecting noise.

In addition to its promising results on noise detection, our approach is also superior to existing stateof-the-art algorithms in terms of the quality of learned embedding. We conduct experiments on three benchmark datasets, including FB15K-237, WN18RR and YAGO3-10 with noisy triples to be different ratio of 40%, 70% and 100% of true triples. Evaluation Metric. We mask the head or tail entity of each test triple, and require each method to predict the masked entity. During evaluation, we use the filtered setting (Bordes et al., 2013) . The Hit@K (H@K) and Mean Reciprocal Rank (MRR) are adopted as the evaluation metrics.

Results. Results of reasoning are shown in Table 3 . In particular, as attention based method exceed the memory capacity of our machines on YAGO3-10 dataset, only the results on the FB15K-237 and WN18RR datasets are reported. Note that TransE, CKRL (LT) and NoiGAN-TransE share the same score function TransE, they are comparable with each other. Similarly, RotatE and NoiGAN-RotatE share the same score function RotatE and thus they are comparable with each other. We make the following observations: (1) NoiGAN consistently outperforms the baseline methods which share the same score function with it on noisy dataset sets. The performance gain is significant especially on datasets with 100% noise. (2) Either NoiGAN-TransE or NoiGAN-RotatE will achieve the best performance on almost all noisy datasets. In particular, hard version of NoiGAN performs better then soft version in most cases.

(3) Even though attention based method claims that they can ensure robust performance, the results show that our NoiGAN significantly outperforms it in terms of robustness. (4) If we do not introduce noise, the performance of NoiGAN models is almost the same as their variants. In addition, the improvement introduced by the NoiGAN becomes more significant as the noise rate in KGs rises. This further proves the robustness of the NoiGAN.

4.4. CASE STUDY:

To demonstrate the power of discriminator in distinguishing noisy triples, we present some triples and their confidence score in Table 4 . We conduct experiments over FB15K with 40% noise using the NoiGAN-TransE (hard) model. All hyperparameters are set as described in Section 4.1. To be clear, distance of a triple is calculated as h + rt 1 while the scores of the triples are learned by the discriminator. As shown in 4, we can see that TransE performs poorly at detecting some "triky" errors, such as logic error (e.g., (head teacher, /people/profession/people with this profession, Michael Dobson)) and grammar error (e.g. (McDonalds, /dining/restaurant/cuisine, Joe Walsh),). To our surprise, NoiGAN (hard) has the ability to detect both.

5. CONCLUSION:

In this paper, we propose a novel framework NoiGAN, to jointly combine the tasks of knowledge graph completion and error detection for noise aware knowledge graph embedding learning. It consists of two main components, a noise-aware KGE model for knowledge graph completion and an adversarial learning framework for error detection. Under the framework, the noise-aware KGE model and the adversarial learning framework can alternately and iteratively boost performance of each other. Extensive experiments show the superiority of our proposed NoiGAN both in regard to knowledge graph completion and error detection.

:



Figures and Tables:

Figure 1: An Overview of the NoiGAN Framework.

NoiGAN is trained in an iterative way, through which each component of the model can alternately and iteratively boost performance of each other. The training process is summarized in Algorithm 1. We train each component of NoiGAN alternately by fixing the parameters of the other components. We start by training the noise aware KGE model. We initiate the confidence score C(h, r, t) as 1 for all triple facts and pretrain the noise aware KGE model with random negative sampling to gain reliable embedding vector. With these embedding vectors, we start the training of GAN model from the generator. The generator learns to understand the probability distribution of the candidate negative samples so as to select the most likely noisy data. In particular, the discriminator gives it a reward as guidance. Once the generator finishes training, it can be used to prepare noisy data for the discriminator. In addition, we take top 10% triples facts which fit the noise aware KGE the best as credible triple facts. With noisy data as negative examples and triple facts as positive examples,

Table content: <table><tr><td>Dataset</td><td colspan="2">#Relations #Entities</td><td>#Train</td><td>#Valid</td><td>#Test</td></tr><tr><td>FB15K</td><td>1,345</td><td>14,951</td><td>483,142</td><td colspan="2">50,000 59,071</td></tr><tr><td>WN18</td><td>18</td><td>40,943</td><td>141,442</td><td>5,000</td><td>5,000</td></tr><tr><td>FB15K-237</td><td>237</td><td>14,541</td><td>272,115</td><td colspan="2">17,535 20,466</td></tr><tr><td>WN18RR</td><td>11</td><td>40,943</td><td>86,835</td><td>3,034</td><td>3,134</td></tr><tr><td>YAGO3-10</td><td>37</td><td colspan="3">123,182 1,079,040 5,000</td><td>5,000</td></tr><tr><td/><td/><td colspan="2">Table 1: Data Statistics</td><td/><td/></tr><tr><td>3.3 JOINT TRAINING</td><td/><td/><td/><td/><td/></tr><tr><td>8: end for</td><td/><td/><td/><td/><td/></tr></table>

2: Evaluation Results on Knowledge Graph Error Detection.methods by a grid search strategy. The range of different parameters is set as follows: embedding dimension k ∈ {250, 500, 1000}, batch size b ∈ {256, 512, 1024}, and fixed margin γ ∈ {9, 12, 24}. Afterwards, we compare the best results of different methods. Both the entity embeddings and the relation embeddings are uniformly initialized and no regularization is imposed on them. As mention in Section 3.2, we implement both discriminator and the generator as simple two-layer fully connected neural networks. The size of hidden states for each of the two networks is set to 10.

Table content: <table/>

Examples of Noisy Triples and Positive Triples in FB15K Dataset.

Table content: <table><tr><td/><td>Triple</td><td>Distance (TransE)</td><td>Distance (NoiGAN)</td><td>Score (NoiGAN)</td></tr><tr><td/><td>(McDonald's (business),</td><td/><td/><td/></tr><tr><td>Positive</td><td>/dining/restaurant/cuisine,</td><td>19.94</td><td>16.60</td><td>0.8664</td></tr><tr><td/><td>Philippine cuisine (national cuisine))</td><td/><td/><td/></tr><tr><td/><td>(McDonald's (business),</td><td/><td/><td/></tr><tr><td>Negative</td><td>/dining/restaurant/cuisine,</td><td>20.51</td><td>32.67</td><td>0.0171</td></tr><tr><td/><td>Joe Walsh (human))</td><td/><td/><td/></tr><tr><td/><td>(voice actor (filmmaking occupation),</td><td/><td/><td/></tr><tr><td>Positive</td><td>/people/profession/people with this profession,</td><td>21.58</td><td>20.28</td><td>0.8409</td></tr><tr><td/><td>Michael Dobson (human))</td><td/><td/><td/></tr><tr><td/><td>(head teacher (profession),</td><td/><td/><td/></tr><tr><td>Negative</td><td>/people/profession/people with this profession,</td><td>22.60</td><td>37.57</td><td>0.0058</td></tr><tr><td/><td>Michael Dobson (human))</td><td/><td/><td/></tr></table>

Peer review (iclr2020):
This paper proposes to provide a novel noise-aware knowledge graph embedding (NoiGAN) by combining KG completion and noise detection through the GANs framework. More specifically, NoiGAN repeatedly utilizes a GAN model to 1) approximate the confidence score for facts identifying reliable data (discriminator) and 2) generate more challenging negative samples (generator). Then, it uses this confidence score and negative samples to train a more accurate link prediction model. The authors validate the proposed model through several experiments. This paper reads well and the results appear sound. I personally find the idea of incorporating confidence score into a link prediction model to achieve a more accurate model very interesting. Furthermore, the provided experiments support their intuition and arguments outperforming considered baselines. As for the drawbacks, I find the baselines considered in this work outdated missing many SOTA and related works in link prediction and noise detection [1,2, 3, 4, 5]. Further, I believe this work needs more experimental results and an ablation study capturing different aspects of the presented method. My concerns are as follows: • Considering the existing reverse relation issue in FB15K and WN18, I suggest conducting the experiments on the FB15K-237 and WN18RR from [6] instead. • I suggest considering more recent link prediction models as baselines. • I am wondering if the only difference between NoiGAN and KBGAN [7] is incorporating the confidence score in the link prediction loss? • Considering the fact that NoiGAN repeatedly retrains GAN and link prediction model, I suggest providing a comparison of computational complexity. • I am wondering if NoiGAN can only work with pre-knowledge of noisy triples in KG? If not, why didn’t you report NoiGAN performance with 0% noise in Table 3? • I find utilizing few examples to evaluate the power of discriminator in distinguishing noisy triples (Table 4) not satisfactory at all. I suggest experimenting with more data and providing the per-relation breakdown performance of the discriminator. On overall, although I find the proposed model quite novel and interesting, the paper needs more experimental results to validate the idea. [1] Pinter, Yuval, and Jacob Eisenstein. *Predicting Semantic Relations using Global Graph Properties*. [2] Nathani, Deepak, et al. *Learning Attention-based Embeddings for Relation Prediction in Knowledge Graphs*. [3] Balaževi?, Ivana, Carl Allen, and Timothy M. Hospedales. *TuckER: Tensor Factorization for Knowledge Graph Completion*. [4] Sun, Zhiqing, et al. *Rotate: Knowledge graph embedding by relational rotation in complex space*. [5] Pezeshkpour, Pouya, Yifan Tian, and Sameer Singh. *Investigating Robustness and Interpretability of Link Prediction via Adversarial Modifications*. [6] Dettmers, Tim, et al. *Convolutional 2d knowledge graph embeddings.*, AAAI-18. [7] Liwei Cai and William Yang Wang. “Kbgan: Adversarial learning for knowledge graph embeddings”.