Rethinking Generalization in Knowledge Graph Embedding: An Empirical Study and Sparse Peak Regularization
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
The Flow has not summarised this story yet — read it at arXiv Machine Learning.
arXiv:2609. 03487v1 Announce Type: cross Abstract: Knowledge graph embedding (KGE) demonstrates its effectiveness for predicting missing links in knowledge graphs (KGs) by projecting entities and relations into a low-dimensional vector space.
arXiv:2510. 09711v2 Announce Type: replace-cross Abstract: Large Language Models (LLMs) have recently emerged as a powerful paradigm for Knowledge Graph Completion (KGC), offering strong reasoning and generalization capabilities beyond traditional embedding-based approaches.
The paper introduces Kernel-Anticipated Unlearning (KAU), a method for approximate unlearning of knowledge-graph embeddings that accounts for relearning during continued training. KAU uses the tangent kernel to model how forgotten facts’ scores change, expressing this response in closed form and guiding edits to minimize future leakage. Experiments show KAU reduces leakage by 46‑63% on FB15k-237 and 50‑82% on CoDEx-L compared to the strongest existing unlearner, while preserving higher utility.
arXiv:2506.05626v3 Announce Type: replace Abstract: Real-world knowledge can take various forms, including structured, semi-structured, and unstructured data. Among these, Knowledge Graphs (KGs) are...
arXiv:2512. 10092v2 Announce Type: replace Abstract: Analyzing large-scale text corpora is a core challenge in machine learning, crucial for tasks like identifying undesirable model behaviors or biases in training data.
arXiv:2606. 03365v1 Announce Type: new Abstract: Embedding models (KGEMs) constitute the main link prediction approach to complete knowledge graphs.