During the past few decades, knowledge bases (KBs) have experienced rapid growth. Nevertheless, most KBs still suffer from serious incompletion. Researchers proposed many tasks such as knowledge base completion and relation prediction to help build the representation of KBs. However, there are some issues unsettled towards enriching the KBs. Knowledge base completion and relation prediction assume that we know two elements of the fact triples and we are going to predict the missing one. This assumption is too restricted in practice and prevents it from discovering new facts directly. To address this issue, we propose a new task, namely, fact discovery from knowledge base. This task only requires that we know the head entity and the goal is to discover facts associated with the head entity. To tackle this new problem, we propose a novel framework that decomposes the discovery problem into several facet discovery components. We also propose a novel auto-encoder based facet component to estimate some facets of the fact. Besides, we propose a feedback learning component to share the information between each facet. We evaluate our framework using a benchmark dataset and the experimental results show that our framework achieves promising results. We also conduct extensive analysis of our framework in discovering different kinds of facts. The source code of this paper can be obtained from https: //github.com/thunlp/FFD . Recent years have witnessed the emergence and growth of many large-scale knowledge bases (KBs) such as Freebase (Bollacker et al., 2008), DBpedia (Lehmann et al., 2015), YAGO (Suchanek et al., 2007) and Wikidata (Vrandecic and Krotzsch, 2014) to store facts of the real world. Most KBs typically organize the complex structured information about facts in the form of triples ( head entity , relation , tail entity ), e.g., ( Bill Gates , CEOof , Microsoft Inc. ). These KBs have been widely used in many AI and NLP tasks such as text analysis (Berant et al., 2013), question answering (Bordes et al., 2014a), and information retrieval (Hoffmann et al., 2011). The construction of these KBs is always an ongoing process due to the endless growth of real-world facts. Hence, many tasks such as knowledge base completion (KBC) and relation prediction (RP) are proposed to enrich KBs. The KBC task usually assumes that one entity and the relation r are given, and another entity is missing and required to be predicted. In general, we wish to predict the missing entity in ( h, r, ?) or (? , r, t ) , where h and t denote a head and tail entity respectively. Similarly, the RP task predicts the missing relation given the head and tail entities and their evidence sentences, i.e. filling ( h, ? , t ) . Nevertheless, the assumption of knowing two parts of the triple is too strong and is usually restricted in practice. In many cases, we only know the entity of interest, and are required to predict both its attributive relations and the corresponding entities. As shown in Figure 1, the task is to predict the fact triples when given only the head entity, i.e. filling ( h, ? , ?) . Since any entity can serve as the head entity for identifying its possible fact triples, this task should be more practical for real-world settings. This task is non-trivial since less information is provided for prediction. We name the task as Fact Discovery from Knowledge Base (FDKB). Some existing methods such as knowledge base representation (KBR) can be applied to tackle the FDKB task with simple modifications. KBR models typically embed the semantics of both entities and relations into low-dimensional semantic space, i.e., embeddings. For example, TransE (Bordes et al., 2013) learns low-dimensional and real-valued embeddings for both entities and relations by regarding the relation of each triple fact as a translation from its head entity to the tail entity. TransE can thus compute the valid score for each triple by measuring how well the relation can play a translation between the head and tail entities. Many methods have been proposed to extend TransE to deal with various characteristics of KBs (Ji et al., 2015, 2016; He et al., 2015; Lin et al., 2015a). To solve the FDKB task using KBR, one feasible way is to exhaustively calculate the scores of all ( r, t ) combinations for the given head entity h . Afterwards, the highly-scored facts are returned as results. However, this idea has some drawbacks: (1) It takes all relations to calculate ranking scores for each head entity, ignoring the nature of the head entity. The combination of all possible relations and tail entities will lead to huge amount of computations. (2) A large set of candidate triples immerses the correct triples into a lot of noisy triples. Although the probability of invalid facts getting a high score is small, with the large size of the candidate set, the total number of invalid facts with high score is non-negligible. To address the above issues, we propose a new framework named as fact facet decomposition (FFD). The framework follows human being's common practice to identify unknown facts: One typically firstly investigates which relation that a head may have, and then predicts the tail entity based on the predicted relation. This procedure actually utilizes information from several perspectives. Similarly, FFD decomposes fact discovery into several facets, i.e., head-relation facet, tail-relation facet, and tail inference facet, and model each facet respectively. The candidate fact is considered to be correct when all of the facets are trustworthy. We propose a novel auto-encoder based entity-relation component to discover the relatedness between entities and relations. Besides, we also propose a feedback learning component to share the information between each facet. We have conducted extensive experiments using a benchmark dataset to show that our framework achieves promising results. We also conduct an extensive analysis of the framework in discovering different kinds of facts. The contributions of this paper can be summarized as follows: (1) We introduce a new task of fact discovery from knowledge base, which is more practical. (2) We propose a new framework based on the facet decomposition which achieves promising results. In recent years, many tasks (Wang et al., 2017) have been proposed to help represent and enrich KBs. Tasks such as knowledge base completion (KBC) (Bordes et al., 2013; Wang et al., 2014; Ji et al., 2015, 2016; Wang et al., 2017) and relation prediction (RP) (Mintz et al., 2009; Lin et al., 2015a; Xie et al., 2016) are widely studied and many models are proposed to improve the performance on these tasks. However, the intention of these tasks is to test the performance of models in representing KBs and thus they cannot be used directly to discover new facts of KBs. Moreover, our FDKB task is not a simple combination of the KBC and RP task since both of these two tasks require to know two of the triples while we assume we only know the head entity. A common approach to solving these tasks is to build a knowledge base representation (KBR) model with different kinds of representations. Typically, one element of the triples is unknown. Then, all entities are iterated on the unknown element and the scores of all combinations of the triples are calculated and then sorted. Many works focusing on KBR attempt to encode both entities and relations into a low-dimensional semantic space. KBR models can be divided into two major categories, namely translation-based models and semantic matching models (Wang et al., 2017). Translation-based models such as TransE (Bor-des et al., 2013) achieves promising performance in KBC with good computational effi-ciency. TransE regards the relation in a triple as a translation between the embedding of head and tail entities. It means that TransE enforces that the head entity vector plus the relation vector approximates the tail entity vector to obtain entity and relation embeddings. However, TransE suffers from problems when dealing with 1-to-N, N-to-1 and N-to-N relations. To address this issue, TransH (Wang et al., 2014) enables an entity to have distinct embeddings when involving in different relations. TransR (Lin et al., 2015b) models entities in entity space and uses transform matrices to map entities into different relation spaces when involving different relations. Then it performs translations in relation spaces. In addition, many other KBR models have also been proposed to deal with various characteristics of KBs, such as TransD (Ji et al., 2015), KG2E (He et al., 2015), PTransE (Lin et al., 2015a), TranSparse (Ji et al., 2016). Semantic matching models such as RESCAL (Nickel et al., 2011), DistMult(Yang et al., 2014), Complex (Trouillon et al., 2016), HolE (Nickel et al., 2016) and ANALOGY (Liu et al., 2017) model the score of triples by the semantic similarity. RESCAL simply models the score as a bilinear projection of head and tail entities. The bilinear projection is defined with a matrix for each relation. However, the huge amount of parameters makes the model prone to overfitting. To alleviate the issue of huge parameter space, DistMult is proposed to restrict the relation matrix to be diagonal. However, DistMult cannot handle the asymmetric relations. To tackle this problem, Complex is proposed assuming that the embeddings of entities and relations lie in the space of complex numbers. This model can handle the asymmetric relations. Later, Analogy is proposed by imposing restrictions on the matrix rather than building the matrix with vector. It achieves the state-of-the-art performance. Besides, (Bordes et al., 2011; Socher et al., 2013; Chen et al., 2013; Bor-des et al., 2014b; Dong et al., 2014; Liu et al., 2016) conduct the semantic matching with neural networks. An energy function is used to jointly embed relations and entities. We denote E as the set of all entities in KBs, R is the set containing all relations. |E| and |R| stand for the size of each set respectively. A fact is a triple ( h, r, t ) in which h, t  E and r  R . T is the set of all true facts. When a head entity set H is given, a new fact set is to be discovered based on these head entities. The discovered fact set is denoted as T d = { ( h, r, t ) | h  H} . Our goal is to find a fact set T d that maximize the number of correct discovered facts: max T d |T d  T | s.t. |T d | = K, (1) in which K is a user-specified size. Problem (1) is intractable since the set T is unknown. We tackle this problem by estimating a fact confidence score function c ( h, r, t ) for each fact in T d and maximize the total score. The problem is then formulated as: max T d (cid:88) ( h,r,t ) T d c ( h, r, t ) s.t. |T d | = K. (2) To integrate the information from various facets of the fact, our framework, known as Fact Facet Decomposition (FFD) framework, decomposes the fact discovery problem into several facet-oriented detection tasks. A fact is likely to be correct if all facets provide supportive evidence. The facets are as follows: 1. Head-relation facet: A fact is likely true, if the head entity has a high probability of containing the relation. This is denoted as f h ( r ) ; 2. Tail-relation facet: A fact is likely true, if the tail entity has a high probability of containing the relation. This is denoted as f t ( r ) ; 3. Tail inference facet: A fact is likely true, if the score of the tail entity is high with respect to the given head and relation. This is denoted as f h,r ( t ) . Therefore, the facet confidence score can be expressed as: c ( h, r, t ) =  1 f h ( r ) +  2 f t ( r ) +  3 f h,r ( t ) , (3) where  1 ,  2 ,  3 are weight parameters. The head-relation facet and the tail-relation facet can be both KBs Train Predict L ( y e ,  y e )  p ( r | e )  y e  y e y 0 e y e x x e, r 1 , t 1 e, r 2 , t 2 e, r 3 , t 3 e, r 4 , t 4 e, r 5 , t 5 Figure 2: The structure of the entity-relation component. modeled with an entity-relation facet component. The tail inference facet can be modeled by a KBR component. The entity-relation component estimates the probability of a relation given an entity. The structure is shown in Figure 2. It is modeled as the log of the estimated conditional probability: f e ( r ) = log  p ( r | e ) , (4) where e = h or t . p ( r | e ) aims at measuring the probability of a relation that this entity may have. In order to estimate this probability, the existing relations of a head or tail entity is used to infer other related relations. For example, if a head entity has an existing fact in which the relation is BirthPlace, we may infer that this head entity may be a person and some relations such as Gen-der, Language may have a high probability of association with this head entity. Therefore, the problem is transformed into a problem that estimates the relatedness between relations. To infer the probability of each relation based on existing relations, we employ a denoising auto-encoder (Vincent et al., 2008) which can recover almost the same representation for partially destroyed inputs. Firstly, facts related to an entity is extracted from the KBs. Then, this entity is encoded by the existing relations. Let y e  R |R| be the 0-1 representation of relations that e has. y ei indicates whether the entity e has the relation i or not. During the training phase, non-zero elements in y e is randomly set to zero and the auto-encoder is trained to recover the corrupted elements. The corrupted vector is denoted as y (cid:48) e . Formally, our structure encoder first maps the corrupted one-hot vector y (cid:48) e to a hidden representation x  R d 1 of the entity through a fully connected layer: x = tanh( W f y (cid:48) e + b f ) , (5) where W f  R d 1 |R| is the translation matrix and b f  R d 1 is the bias vector. x is the vector representation of the entities in a hidden semantic space. In this space, similar entities are close to each other while entities of different types are far from each other. If some relations are missing, the fully connected layer will also map the entity into a nearby position. Afterwards, x is used to recover the probability distribution for all relations through a fully connected layer and a sigmoid layer:  y e = sigmoid ( W g x + b g ) , (6) where W g  R |R| d 1 and b g  R |R| is the weight matrix and bias vector of the reverse mapping respectively. y e is the recovered probability distribution of each relation (therefore, the sum of each element in  y e does not necessarily equal to 1). This layer will map the entity representation in the semantic space into a probability vector over all relations. Since similar entities are located in the adjacent area, they are likely to have a similar relation probability. Therefore, the probability of missing relations will also be high though the relations are unknown. We use the original one-hot representation of the relations and the recovered relation probability to calculate a loss function: L ( y e ,  y e ) =  |E| (cid:88) e =1 |R| (cid:88) i =1 { y ei log( y ei ) + (1  y ei ) log(1   y ei ) } . (7) The loss function forces the output  y ei to be consistent with y ei which makes it capable to discover all related relations from known relations. It can be optimized with an Adam (Kingma and Ba, 2015) based optimizer. When predicting new facts, the one-hot representation y e is sent into the auto-encoder directly instead of using the corrupted representation. The result  y e is the estimated probability of each relation, i.e.  p ( r = i | e ) =  y ei . (8) This probability will be high if relation i is closely related to the existing relations of the entity e . We use a KBR component to model the tail inference facet f h,r ( t ) . Three KBR models are investigated namely DistMult, Complex, and Analogy. The DistMult model defines the score function as f r ( h, t ) = h T diag ( r ) t , in which h , r , t are vector representation of the head, relation and tail respectively. The learning objective is to maximize the margin between true facts and false facts. It can decrease the score of the wrong facts and increase the the score of the true facts at the same time. The Complex model employs complex number as the KBR embedding. Therefore, the score function is defined as f r ( h, t ) = Re ( h T diag ( r ) t ) , in which h , r , t are complex vectors and  t stands for the conjugate of t . The Analogy model does not restrict the relation matrix to be diagonal. Therefore, the score function is f r ( h, t ) = h TM r t , in which M r is the matrix corresponding to the relation r . Since many relations satisfy normality and commutativity requirements, the constraints can thus be set as W r W Tr = W Tr W r ,  r  R and W r W r (cid:48) = W r (cid:48) W r ,  r, r (cid:48)  R . Solving such a problem is equivalent to optimizing the same objective function with the matrix constrained to almost-diagonal matrices(Liu et al., 2017). After the score function is calculated, the tail inference facet f h,r ( t ) is modeled by a softmax function: f h,r ( t ) = log  p ( t | h, r ) = log e f r ( h,t ) (cid:80) t (cid:48) E e f r ( h,t (cid:48) ) . It should be noted that the normalizing step is only conducted on the tail entities since the head and relation are the input of the model. We only use these three models due to the limited space. Other models can be embedded into our framework easily in the same way. As mentioned above, we need to calculate f h ( r ) , f t ( r ) and f h,r ( t ) . f h ( r ) and f t ( r ) are computed by the entity-relation component while f h,r ( t ) is computed by the tail inference component. Recall that a fact is likely to be true when all the facets exhibit strong support. In other words, we can prune away the fact if one of the facets is low and stop calculating other facets. Based on this strategy, we design two additional constraints on Problem (2). Therefore, this method can be viewed as a shrink of the constraint space of the optimization problem. The new problem can be expressed as: max T d (cid:88) ( h,r,t ) T d {  1 f h ( r ) +  2 f t ( r ) +  3 f h,r ( t ) } s.t. h  H ; |T d | = K f h ( r ) >  h ; (cid:88) r 1 ( f h ( r ) >  h ) = n h f t ( r ) >  t ; (cid:88) r 1 ( f t ( r ) >  t ) = n t , (10) where 1 A ( x ) is an indicator function. 1 A ( x ) = 1 if x  A and 1 A ( x ) = 0 otherwise. n h and n t are the user-specified parameters indicating topn h or topn t relations are considered. 1 ,  2 and  3 are fixed hyperparameters. Problem (10) is actually a mixed integer linear programming problem. We start to solve this problem from the constraints. Since f t ( r ) is indepen-dent of the given H , it can be preprocessed and can be reused for other queries. When a head entity h is given, we firstly calculate f h ( r ) and get topn h relations ranked by f h ( r ) . Then, for each relation, f t ( r ) is used to get the topn t entities. Afterwards, the tail inference facet f h,r ( t ) will be calculated for all remaining relations and entities and topn f triples will be cached. Finally, top K facts ranked by the facet confidence score c ( h, r, t ) is returned as the new facts discovered for the entity h , where  K = K/ |H| stands for the average fact number for each head entity. The three facets depict the characteristics of the KBs from different perspectives. For example, the head-relation facet indicates which relation the head entity may have. The tail-relation facet can be interpreted in a similar manner. We propose a feedback learning (FL) component for the facets to share the information in different perspective with each other. FL feeds the predicted facts back to the training set to enhance the training procedure and iterates predicting and training several times. In the iteration, the information from different perspectives is shared with each facet via the newly added facts. Specifically, after predicting the topn h facts for each head entity, we select topn fb ( n fb < n h ) most probable facts according to the score of each triple and then feed them into the existing knowledge base for re-training the FFD model. We repeat the above updating operation several rounds. We evaluate our framework by re-splitting a widely used dataset FB15k (Bordes et al., 2013), which is sampled from Freebase. It contains 1 , 345 relations and 14 , 951 entities. In FB15k, some of the testing set's head entities do not appear in the training set as head. To evaluate our framework, we construct the new dataset. We re-split FB15k into training ( T train ), validation ( T valid ) and testing ( T test ) set, and make sure that there is no overlap between the three sets. For all head entities in H , a relation ratio R % is used to assign the facts into training and testing set. R % relations of a head entity are in the training set while the other 1  R % are in the testing set. In order to evaluate the task, we require that the head entities in H is the same as the testing head entity and is a subset of the training head set, i.e. H = { h | ( h, r, t )  T test ,  r, t  E}  { h | ( h, r, t )  T train ,  r, t  E} . We set R = 50 . After the splitting, the training, testing and validation set size is 509 , 339 , 41 , 861 and 41 , 013 respectively. MF models firstly count the frequency of all relation-tail pairs. Some low-frequency relation-tail pairs are ignored to save computational time. Afterwards, we build a (head, relation-tail) co-occurrence matrix MC  R |E| p , in which p is the size of the relation-tail pair set. Each element M Cij in the matrix represents whether the head entity i has the relation-tail pair j or not. Then, the matrix will be decomposed by the product of two matrices, i.e. MC  W H, (11) in which W  R |E| k , H  R k  p . k is the hidden category number of the head and relation-tail pairs. The decomposition can be achieved in several ways with different assumptions. Two kinds of matrix decomposition models are used namely SVD (Halko et al., 2011) and NMF (Lee and Se-ung, 1999). In the prediction stage, a new matrix is constructed by M (cid:48) C = W H . For each row in M (cid:48) C , we record top K relation-tail pairs and their scores. The MF models always suffer from the sparsity problem since a lot of relation-tail pairs are ignored. The most straightforward method of estimating the fact confidence score c ( h, r, t ) is to use KBR model directly to evaluate each triples' score. We exhaustively score all possible combinations of relations and tails and use the highly-scored facts to make up the set T d . We select some state-of-the-art models including DistMult (Yang et al., 2014), Complex (Trouillon et al., 2016) and Analogy (Liu et al., 2017). We denote them as DistMult+, Complex+ and Analogy+. After a KBR model learns a score function f r ( h, t ) , the probability of each ( r, t ) pair with respect to a given head entity can be estimated by a softmax function:  p ( r, t | h ) = e f r ( h,t ) (cid:80) r (cid:48) R (cid:80) t (cid:48) E e f r (cid:48) ( h,t (cid:48) ) . There are 2,000 head entities in the testing set. Therefore, we predict the corresponding relation and tail entity with respect to these 2,000 head entities. In MF models, only relation-tail pairs that occur more than 3 times in the training set are considered (24,615 pairs in total). For each head entity, we set  K = 50 . In KBR+, we also set  K = 50 . For our framework, we set n h = n t = 30 , n f = 10 ,  K = 50 ,  1 = 1 . 0 ,  2 = 1 . 0 ,  3 = 0 . 5 . The auto-encoder iterates for 1,000 epochs and the learning rate for Adam is 0.005. For the feedback learning component, we set n fb = 20 , 000 . With this setting, each model returns 100,000 facts. We use four evaluation metrics, including precision, recall MAP, and F1 in relation prediction. Precision is defined as the ratio of the true positive candidates' count over the number of all the retrieved candidates' count. Recall is defined as the ratio of the true positive candidates' count over all the positive facts' count in the testing set. MAP (Manning et al., 2008) is a common evaluation method in information retrieval tasks. F1 is defined as the harmonic mean of the precision and recall. the experiment result, we observe that: 1. FFD based model outperforms other models in all metrics. It illustrates the advantage of our decomposition design. Moreover, in FFD, using Analogy to predict c ( h, r, t ) outperforms Complex. One reason is that the discovery algorithm harness the relatively large parameter space of Analogy and avoids some occasionally emerging wrong facts; 2. The relation of the head entity can be correctly predicted. This is because, in training, we remove some relations and the auto-encoder is trained to learn to recover the missing relations based on the remaining relations. 3. The MF based models (i.e. SVD and NMF) perform not as good as KBR+ models and FFD. The reason is partially due to the sparsity problem in MF models. A lot of relation-10 0 10 1 10 2 10 3 Average head per tail (hpt) 0.00 0.25 0.50 0.75 1.00 P r e c i s i o n SVD Analogy+ FFD(Analogy) 10 0 10 1 10 2 Average tail per head (tph) Figure 3: Precision on each relation. tail pairs have not been used as the feature and thus cannot be predicted; 4. Different from the traditional KBC task, Complex performs slightly better than Analogy. One reason is that Analogy's constraint is looser than Complex. Therefore, it may easily predict wrong facts due to error propagation; 5. The ablation experiment shows that the feedback learning can improve the performance effectively. To illustrate the capability of handling different kinds of relations, we plot the accuracy with respect to different kinds of relations. We use heads per tail (hpt) and tails per head (tph) index to represent the difficulty of each relation. If the rela-tion's index is high, it means that each head of the relation may have more tails or vice versa. These relations are more difficult to predict. This is the similar problem of 1-N, N-1 and N-N relation in KBC task. The plot is shown in Figure 3. From the figure, we can observe that: 1. FFD can be adapted to all kinds of relations with different hpt and tph; 2. MF, KBR+, FFD models can handle relations with relatively high hpt but fail with high tph. This is because our goal is to predict relation and tail based on the head. Therefore, the choice may be harder to make with high tph; 3. As the hpt grows, the precision of SVD model also grows. The reason is that as hpt grows, the sparsity problem is alleviated. Therefore, the performance of SVD grows. training set. We examine the training set and observe that 97.46% relation-tail pairs does not appear and 0.34% relation-tail pairs appear for only one time. These pairs can hardly provide any information for the MF models either. To test whether our framework is capable of dealing with the data sparsity problem. We remove training facts which contains head entities in H according to a specific ratio. We decrease the relation ratio R % from 50% to 10% to explore the effectiveness of our framework in discovering new facts. The dataset statistics is shown in Table 2. We apply FFD (Analogy) on each dataset. As shown in Table 3, precision, F1 and recall decrease since the data becomes more and more sparse. MAP increase slightly since it is averaged on all extracted facts. When the extracted facts number decreases, some facts rank at the tail with low scores are excluded. We provide a case study to demonstrate the characteristics of different models and show that our FFD can utilize more information. We choose the head entity Stanford Law School (Freebase ID: /m/021s9n). The predicted facts of SVD, Analogy+ and FFD (Analogy) are shown in Table 4. From the table, we can observe that: 1. FFD (Analogy) can predict facts such as (Located In, Stanford) and (Mail Address City, Stanford) while other methods fail to. It implies that this model can predict some relation with multiple possible tails; 2. Analogy+ outperforms SVD in general while fails to exceed FFD (Analogy). The reason is Relation Tail InRTpair SVD Ana-log+ FFD(Anal-ogy) Located In USA    Located In California    Located In Stanford  EducationalInstitution Stanford Law School   GraduatesDegree Law Degree     GraduatesDegree Juris Doctor     Mail AddressState California    Mail AddressCity Stanford  Parent Institution StanfordUniversity   Tuition Measurement US Dollar    WebpageCategory WebPage    Table 4: Predicted facts by SVD, FFD+ and FFD (Analogy). that it fails to predict some general facts like (Located In, USA) or (Tuition Measure-ment, US Dollar). This may due to the high scores given to some wrong facts; 3. The SVD model can only predict those facts whose relation and tail belong to the selected relation-tail pairs while Analogy+ and FFD (Analogy) can predict more facts; 4. SVD model prefers to predict some basic facts such as Located In and Tuition Mea-surement. This is because those relations appear a lot of times in the training set and have limited possible tail entities. Therefore, it is easy for SVD model to make such prediction. In this paper, we introduce a new task of fact discovery from knowledge base, which is quite important for enriching KBs. It is challenging due to the limited information available about the given entities for prediction. We propose an effective framework for this task. Experimental results on real-world datasets show that our model can effectively predict new relational facts. We also demonstrate that the feedback learning approach is useful for alleviating the issue of data sparsity for the head entities with few facts. Facts discovery from knowledge base is essential for enriching KBs in the real world. Despite the fact that our work shows some promising results, there still remains some challenges: (1) There exists much more internal information such as relational paths and external information such as text, figures and videos on the web, which can be used to further improve the performance. (2) The feedback learning approach in this paper is to simply utilize those confident predicted relational facts to enhance the model. Reinforcement learning may help us dynamically select those informative and confident relational facts. The work described in this paper is partially supported by grants from the Research Grant Council of the Hong Kong Special Administrative Region, China (Project Codes: 14203414) and the Direct Grant of the Faculty of Engineering, CUHK (Project Code: 4055093). Liu and Lin are supported by the National Key Research and Development Program of China (No. 2018YFB1004503) and the National Natural Science Foundation of China (NSFC No. 61572273, 61661146007).
abstain abstain abstain abstain method abstain objective objective objective objective objective result method other abstain abstain abstain abstain abstain abstain abstain method abstain abstain method abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain objective abstain abstain abstain abstain objective objective result method objective objective other other other method other other other other other other other other other other other other other other other other other other other other other other other other other abstain abstain abstain abstain abstain abstain abstain abstain method method abstain abstain abstain abstain abstain abstain abstain other abstain abstain abstain abstain abstain abstain abstain abstain abstain method abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain method abstain abstain abstain abstain abstain method abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain method method abstain abstain abstain abstain method abstain other abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain method method abstain abstain abstain abstain abstain abstain abstain other abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain other abstain method abstain method method method abstain abstain abstain abstain method abstain method abstain abstain abstain abstain result abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain result abstain abstain abstain abstain abstain abstain abstain abstain result abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain result abstain abstain abstain abstain abstain abstain abstain abstain abstain abstain objective abstain objective objective objective abstain result method abstain other other