June 18, 2018
Canonical Tensor Decomposition for Knowledge Base Completion
International Conference on Machine Learning (ICML)
The problem of Knowledge Base Completion can be framed as a 3rd-order binary tensor completion problem. In this light, the Canonical Tensor Decomposition (CP) (Hitchcock, 1927) seems like a natural solution. However, current implementations of CP on standard Knowledge Base Completion benchmarks are lagging behind their competitors. In this work, we attempt to understand the limits of CP for knowledge base completion.
By: Timothée Lacroix, Nicolas Usunier, Guillaume Obozinski