mlsanityData to 7 Oct 2026

On the Equivalence of Holographic and Complex Embeddings for Link Prediction

arXiv 1702.05563 ↗First posted 18 Feb 2017cs.LGcited by 13

Not on the map. Why?

Abstract (arXiv)

We show the equivalence of two state-of-the-art link prediction/knowledge graph completion methods: Nickel et al's holographic embedding and Trouillon et al.'s complex embedding. We first consider a spectral version of the holographic embedding, exploiting the frequency domain in the Fourier transform for efficient computation. The analysis of the resulting method reveals that it can be viewed as an instance of the complex embedding with certain constraints cast on the initial vectors upon training. Conversely, any complex embedding can be converted to an equivalent holographic embedding.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 18 Feb 2017.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 4; 2022: 3; 2023: 2; 2024: 4.

13 papers.

Sort: