AI Paper Atlas

Research map / Graph learning / Knowledge and temporal graphs

Inductive knowledge graph completion

Complete knowledge graphs for unseen entities using relational semantics and GNNs.

38 accepted papers at ICML, NeurIPS, ICLR, CVPR and AAAI (2018–2026) · an approach in Knowledge and temporal graphs, keyword cluster “knowledge graph · entities · kg”

State History Benchmarks Tried Checklist Preprints Who Export

Where it stands

Leveling off Several papers from 2025–26 still report on 2 tracked benchmarks, but the best result has barely moved since 2024.

10 papers in 2023–24 and 12 in 2025–26 (at ICML, NeurIPS, ICLR, CVPR and AAAI); its share of the topic held steady, from 3.9% to 4.2%.

What looks settled

How this is decided

A benchmark is tracked when at least four papers of this approach report their own method on the same dataset and metric in at least two different years. Its record is the best number reported up to 2024 compared with the best reported in 2025–26: still improving means at least 1% better, flat means at most 0.2% better with at least two papers from 2025–26 trying. Numbers on a different scale from the rest (a fraction among percentages) and far outliers are left out. Results come from different papers with different setups, so they are signals, not head-to-head comparisons. The share of papers is counted at ICML, NeurIPS, ICLR, CVPR and AAAI.

How it got here

2016: 0162017: 0172018: 3182019: 0192020: 6202021: 3212022: 4222023: 4232024: 6242025: 9252026: 326

Most cited paper of each year

Earliest papers here

Benchmark records

The best number each year that beat every earlier one, among papers of this approach reporting their own method. Numbers are extracted by AI from each paper's text; check the paper before citing.

WN18RR · MRR (higher is better)

10 papers, 2020–2025 · flat since 2024

2020: 0.4982022: 0.4992023: 0.5082024: 0.781
20202025

FB15k-237 · MRR (higher is better)

9 papers, 2020–2025 · flat since 2024

2020: 0.522
20202025

YAGO3-10 · MRR (higher is better)

6 papers, 2020–2025 · one report since 2024, not better

2020: 0.5842022: 0.5882024: 0.617
20202025

What has been tried

32 papers here report 326 measured changes (a component added, removed or swapped, compared with a baseline): helped 71%, no clear effect 5%, hurt 22%, mixed 2%. Papers mostly publish changes that helped, so "helped" is over-represented.

Ablations in recent papers

What was changedMeasured onResultEffectPaper
Add modality interaction attention instead of traditional vector similarity matchingFB15k-237-IMG · Hits@100.538 -> 0.551HelpedLAFA: Multimodal Knowledge Graph Completion with Link Aware Fusion and Aggregation (AAAI 2024 · 30 citations)
add the mixed geometry message functionFB15k-237, YAGO3-10, WN18RR · MRR.377 -> .393; .568 -> .586; .496 -> .511HelpedMixed Geometry Message and Trainable Convolutional Attention Network for Knowledge Graph Completion (AAAI 2024 · 19 citations)
use all modalities instead of structure onlyDB15K · Hits@10.125 -> 0.282HelpedAPKGC: Noise-enhanced Multi-Modal Knowledge Graph Completion with Attention Penalty (AAAI 2025 · 12 citations)
Use APs with detailed descriptions instead of CPs only with detailed descriptionsWN18RR, FB15k-237, and NELL-995, transductive and inductive · MRRHelpedAnchoring Path for Inductive Relation Prediction in Knowledge Graphs (AAAI 2024 · 10 citations)
combine anchor-enhanced and relation-aware embeddings rather than use relation-aware embedding aloneWN18RR · MRR55.31 -> 59.74HelpedKnowledge Graph Completion with Relation-Aware Anchor Enhancement (AAAI 2025 · 8 citations)
replace connection-biased attention with vanilla attentionWN18RR v1 · Hits@1097.30 -> 92.00HurtReplacing Paths with Connection-Biased Attention for Knowledge Graph Completion (AAAI 2025 · 4 citations)
add Semantic SmoothingWN18RR (Avg.) · Hits@1078.49 -> 81.23HelpedS²DN: Learning to Denoise Unconvincing Knowledge for Inductive Knowledge Graph Completion (AAAI 2025 · 3 citations)
Add the transformation function T (log function) to CRRFB15k-237 · MRR0.414 -> 0.428HelpedKGCRR: An Effective Metric-Driven Knowledge Graph Completion Framework by Designing a Novel Upper Bound Function with Adaptive Approximation to Reciprocal Rank (AAAI 2025 · 1 citation)
Add the intermediate-output gating mechanismFB15k-237 · Hits@1HelpedSPAC: Sparse Partitioning and Adaptive Core Tensor Pruning Model for Knowledge Graph Completion (AAAI 2025 · 1 citation)
Increase RTMD depth from 2 to 3 layersWNv3 · classification accuracy0.8204 -> 0.8205No clear effectStability and Generalization Capability of Subgraph Reasoning Models for Inductive Knowledge Graph Completion (ICML 2025 · 0 citations)
Use only IVR upper bound 1 instead of full IVRWN18RR, FB15k-237, YAGO3-10 · MRR0.501 -> 0.497; 0.368 -> 0.366; 0.581 -> 0.576HurtKnowledge Graph Completion by Intermediate Variables Regularization (NeurIPS 2024 · 0 citations)
replace relation-weighted aggregation with mean aggregationFB-100 and NL-100 · MRR0.244 vs 0.253; 0.279 vs 0.314HurtTowards Global-Topology Relation Graph for Inductive Knowledge Graph Completion (AAAI 2025)

What reviewers will expect

Datasets and baselines named in the 9 papers of this approach from 2025–2026 that have a full-text summary. Leaving out the common ones is a frequent review question.

Datasets

  • FB15k-237 · 6 of 9 papers
  • WN18RR · 5 of 9 papers
  • NELL995 · 3 of 9 papers

Baselines

  • GraIL · 4 of 9 papers
  • TransE · 3 of 9 papers
  • DistMult · 3 of 9 papers
  • RotatE · 3 of 9 papers
  • NeuralLP · 3 of 9 papers
  • DRUM · 3 of 9 papers
  • CoMPILE · 3 of 9 papers
  • NBFNet · 3 of 9 papers

Recent preprints

Loading recent arXiv preprints…

    Who publishes on it

    Institutions on the most papers of this approach since 2023 (of 22 papers; from OpenAlex and the papers' affiliations).

    Use it

    Download BibTeX of 34 key papersOpen the topic in the interactive map

    Get alerts. Describe your idea in scime atlas and save it (free scime account): you get a weekly email when new preprints land close to it.

    Same keyword cluster

    Elsewhere in the topic

    Benchmark numbers, ablations and baseline numbers are extracted by AI from each paper's full text and can be wrong; the paper is the authority. Data: results index of 2026-11-02, citation counts from OpenAlex (2026-10-09).

    Get the next scime Dispatch and a monthly field update

    Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy