K-ON stacks K prediction heads onto an LLM to generate entity tokens in one step and uses entity-level contrastive learning, achieving new state-of-the-art results on two knowledge graph completion benchmarks.
Distributed Representations of Entities in Open-World Knowledge Graphs
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Graph neural network (GNN)-based methods have demonstrated remarkable performance in various knowledge graph (KG) tasks. However, most existing approaches rely on observing all entities during training, posing a challenge in real-world knowledge graphs where new entities emerge frequently. To address this limitation, we introduce Decentralized Attention Network (DAN). DAN leverages neighbor context as the query vector to score the neighbors of an entity, thereby distributing the entity semantics only among its neighbor embeddings. To effectively train a DAN, we introduce self-distillation, a technique that guides the network in generating desired representations. Theoretical analysis validates the effectiveness of our approach. We implement an end-to-end framework and conduct extensive experiments to evaluate our method, showcasing competitive performance on conventional entity alignment and entity prediction tasks. Furthermore, our method significantly outperforms existing methods in open-world settings.
fields
cs.CL 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
K-ON: Stacking Knowledge On the Head Layer of Large Language Model
K-ON stacks K prediction heads onto an LLM to generate entity tokens in one step and uses entity-level contrastive learning, achieving new state-of-the-art results on two knowledge graph completion benchmarks.