Sharing Parameter by Conjugation for Knowledge Graph Embeddings in Complex Space
Xincan Feng, Zhi Qu, Yuchang Cheng, Taro Watanabe, Nobuhiro Yugami

TL;DR
This paper introduces a parameter-sharing technique using conjugate parameters for complex-valued knowledge graph embeddings, significantly reducing memory usage while maintaining performance and training efficiency across multiple models and datasets.
Contribution
It proposes a novel conjugate parameter-sharing method that enhances memory efficiency and training speed in complex space KGE models without sacrificing accuracy.
Findings
Memory usage reduced by 2x in relation embeddings
Achieved comparable performance to state-of-the-art models
Demonstrated generalizability on multiple datasets and models
Abstract
A Knowledge Graph (KG) is the directed graphical representation of entities and relations in the real world. KG can be applied in diverse Natural Language Processing (NLP) tasks where knowledge is required. The need to scale up and complete KG automatically yields Knowledge Graph Embedding (KGE), a shallow machine learning model that is suffering from memory and training time consumption issues. To mitigate the computational load, we propose a parameter-sharing method, i.e., using conjugate parameters for complex numbers employed in KGE models. Our method improves memory efficiency by 2x in relation embedding while achieving comparable performance to the state-of-the-art non-conjugate models, with faster, or at least comparable, training time. We demonstrated the generalizability of our method on two best-performing KGE models and on five…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks
