English

RADD: Retrieval-Augmented Discrete Diffusion for Multi-Modal Knowledge Graph Completion

Artificial Intelligence 2026-04-29 v1

Abstract

Most multi-modal knowledge graph completion (MMKGC) models use one embedding scorer to do both retrieval over the full entity set and final decision making. We argue that this coupling is a core bottleneck: global high-recall search and local fine-grained disambiguation require different inductive biases. Therefore, we propose a Retrieval-Augmented Discrete Diffusion (RADD) framework to decouple retrieve and reranking for MMKGC. A relation-aware multimodal KGE retriever serves as both global retriever and distillation teacher, while a conditional discrete denoiser performs shortlist-level entity-identity generation for reranking. Training combines KGE supervision, denoising cross-entropy, and temperature-scaled distillation from the retriever to the denoiser. At inference, the designed Diff-Rerank first forms a top-KK shortlist with the retriever and then reranks it with the denoiser, ensuring that recall is a strict prerequisite for precision. Experiments on three MMKGC benchmarks show that RADD achieves the best performance and consistent gains over strong unimodal, multimodal, and LLM-based baselines, while ablations further verify the contribution of each component.

Keywords

Cite

@article{arxiv.2604.25693,
  title  = {RADD: Retrieval-Augmented Discrete Diffusion for Multi-Modal Knowledge Graph Completion},
  author = {Guanglin Niu and Bo Li},
  journal= {arXiv preprint arXiv:2604.25693},
  year   = {2026}
}

Comments

12 pages, 3 figures, 6 tables

R2 v1 2026-07-01T12:39:21.716Z