ER: Equivariance Regularizer for Knowledge Graph Completion
This addresses overfitting in knowledge graph completion for AI applications, but it is incremental as it builds on existing regularizers.
The paper tackles overfitting in knowledge graph completion models by introducing the Equivariance Regularizer (ER), which leverages semantic equivariance between head and tail entities, resulting in substantial improvements over state-of-the-art methods.
Tensor factorization and distanced based models play important roles in knowledge graph completion (KGC). However, the relational matrices in KGC methods often induce a high model complexity, bearing a high risk of overfitting. As a remedy, researchers propose a variety of different regularizers such as the tensor nuclear norm regularizer. Our motivation is based on the observation that the previous work only focuses on the "size" of the parametric space, while leaving the implicit semantic information widely untouched. To address this issue, we propose a new regularizer, namely, Equivariance Regularizer (ER), which can suppress overfitting by leveraging the implicit semantic information. Specifically, ER can enhance the generalization ability of the model by employing the semantic equivariance between the head and tail entities. Moreover, it is a generic solution for both distance based models and tensor factorization based models. The experimental results indicate a clear and substantial improvement over the state-of-the-art relation prediction methods.