arXiv AI
Jun 2
On the Theoretical Limitations of Embedding-based Link Prediction
arXiv:2506. 22271v3 Announce Type: replace Abstract: Neural networks often map low-dimensional embeddings to high-dimensional output spaces.
Link Prediction or Perdition: the Seeds of Instability in Knowledge Graph Embeddings
arXiv:2606. 03365v1 Announce Type: new Abstract: Embedding models (KGEMs) constitute the main link prediction approach to complete knowledge graphs.
Related stories
arXiv AI
Jun 16
Model Graph Inductive Learning for Knowledge Graph Completion
arXiv:2606. 16509v1 Announce Type: new Abstract: Link prediction in knowledge graphs fundamentally depends on the quality of learned embeddings for entities and relations.
arXiv Machine Learning
Jul 1
The Impact of Dimensionality on the Stability of Node Embeddings
arXiv:2604. 08492v2 Announce Type: replace Abstract: Previous work has shown that node embedding methods can produce different representations and downstream predictions across repeated training runs, even when trained on the same data with identical hyperparameters.
arXiv Machine Learning
Jun 17
Half a Link can Be Enough to Predict a Whole Link: Understanding Generalization in Knowledge Graph Foundation Models
arXiv:2606. 18001v1 Announce Type: new Abstract: Knowledge graph (KG) foundation models (KGFMs) are zero-shot generalizers: trained once, they can predict links on unseen graphs without retraining.
Hugging Face Trending Papers
Jun 29
Beyond Triplet Plausibility: Relation Set Completion in Knowledge Graphs
Knowledge graphs (KGs) organize real-world knowledge as triplets and underpin many downstream applications. Due to their inherent incompleteness, knowledge graph completion (KGC) is widely studied and is typically formulated as triplet prediction, with link prediction as the dominant paradigm.
arXiv AI
Jun 30
Beyond Triplet Plausibility: Relation Set Completion in Knowledge Graphs
arXiv:2606. 29860v1 Announce Type: new Abstract: Knowledge graphs (KGs) organize real-world knowledge as triplets and underpin many downstream applications.
arXiv Machine Learning
Jun 9
Generalized Rank-based Evaluation for Knowledge Graph Completion: Perspectives, Framework, and Analyses
arXiv:2606. 08921v1 Announce Type: new Abstract: Knowledge graph completion (KGC) aims to predict missing facts from an observed knowledge graph (KG), playing a crucial role in a wide range of real-world applications such as drug discovery, recommender systems, and retrieval-augmented generation (RAG).
arXiv AI
Jul 21
RADD: Retrieval-Augmented Discrete Diffusion for Multi-Modal Knowledge Graph Completion
arXiv:2604. 25693v2 Announce Type: replace Abstract: Most multi-modal knowledge graph completion (MMKGC) models use one embedding scorer to conduct both retrieval over the full entity set and final link prediction.
arXiv AI
Jul 7
Conditional Diffusion Guided Knowledge Transfer for Multi-Domain Knowledge Graph Completion
arXiv:2607. 03154v1 Announce Type: cross Abstract: Multi-domain knowledge graph completion (MKGC) aims to improve missing triple prediction in a target KG by transferring knowledge from other support KGs.
arXiv AI
Jun 3
ReaLM: Residual Quantization Bridging Knowledge Graph Embeddings and Large Language Models
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.
arXiv AI
Jun 2
Consistent and Distinctive: LLM Benchmark Efficiency via Maximum Independent Set Prompt Selection on Similarity Graphs
arXiv:2606. 01400v1 Announce Type: cross Abstract: Evaluating large language models (LLMs) across comprehensive benchmarks is expensive and time-consuming.
arXiv AI
Jun 29
RelBall: Relation Ball with Quaternion Rotation for Knowledge Graph Completion
arXiv:2606. 27967v1 Announce Type: new Abstract: Real-world knowledge graphs are often incomplete, lacking many valid facts.