paper-with-me

Papers

ER: Equivariance Regularizer for Knowledge Graph Completion

2022-06-24 · Zongsheng Cao, Qianqian Xu, Zhiyong Yang, Qingming Huang

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.

📄 PDF Abstract BibTeX arXiv:2206.12142

Code (1)

lion-zs/er 공식 구현

Tasks

Knowledge Graph CompletionRelation Prediction

Similar Papers 제목 키워드 기반

Temporal Knowledge Graph Completion using a Linear Temporal Regularizer and Multivector Embeddings

2021-06-01 · NAACL 2021 4 · Chengjin Xu, Yung-Yu Chen, Mojtaba Nayyeri, Jens Lehmann

Representation learning approaches for knowledge graphs have been mostly designed for static data. However, many knowledge graphs involve evolving data, e.g., the fact (The President of the United States is Barack Obama)…

Knowledge Graph CompletionKnowledge GraphsLink PredictionRepresentation Learning+2

Duality-Induced Regularizer for Tensor Factorization Based Knowledge Graph Completion

2020-11-11 · NeurIPS 2020 12 · Zhanqiu Zhang, Jianyu Cai, Jie Wang

Tensor factorization based models have shown great power in knowledge graph completion (KGC). However, their performance usually suffers from the overfitting problem seriously. This motivates various regularizers -- such…

Knowledge Graph CompletionLink Prediction

Canonical Tensor Decomposition for Knowledge Base Completion

2018-06-19 · ICML 2018 7 · Timothée Lacroix, Nicolas Usunier, Guillaume Obozinski

The problem of Knowledge Base Completion can be framed as a 3rd-order binary tensor completion problem. In this light, the Canonical Tensor Decomposition (CP) (Hitchcock, 1927) seems like a natural solution; however, cur…

Dynamic Link PredictionKnowledge Base CompletionLink PredictionTensor Decomposition

Inter-domain Multi-relational Link Prediction

2021-06-11 · Luu Huu Phuc, Koh Takeuchi, Seiji Okajima, Arseny Tolmachev 외

Multi-relational graph is a ubiquitous and important data structure, allowing flexible representation of multiple types of interactions and relations between entities. Similar to other graph-structured data, link predict…

Link PredictionPrediction

Learning Generalizable Shape Completion with SIM(3) Equivariance

2025-09-30 · Yuqing Wang, Zhaiyu Chen, Xiao Xiang Zhu arxiv

3D shape completion methods typically assume scans are pre-aligned to a canonical frame. This leaks pose and scale cues that networks may exploit to memorize absolute positions rather than inferring intrinsic geometry. W…