Traversing Knowledge Graphs in Vector Space

By Kelvin Guu, John Miller, Percy Liang. 2015

367 citations recorded by the source corpus.

Path queries on a knowledge graph can be used to answer compositional questions such as "What languages are spoken by people living in Lisbon?". However, knowledge graphs often have missing facts (edges) which disrupts path queries. Recent models for knowledge base completion impute missing facts by embedding knowledge graphs in vector spaces. We show that these models can be recursively applied to answer path queries, but that they suffer from cascading errors. This motivates a new "compositional" training objective, which dramatically improves all models' ability to answer path queries, in some cases more than doubling accuracy. On a standard knowledge base completion task, we also demonstrate that compositional training acts as a novel form of structural regularization, reliably improving performance across all base models (reducing errors by up to 43%) and achieving new state-of-the-art results.

Subfields: Artificial Intelligence, Knowledge Graphs & Representation

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Mohit Bansal
  2. Percy Liang
  3. Yoshua Bengio
  4. Jianfeng Gao
  5. Luke S. Zettlemoyer
  6. Quoc V. Le
  7. Yejin Choi
  8. Kyunghyun Cho

In Knowledge Graphs & Representation

  1. Sebastian Riedel
  2. Timothée Lacroix
  3. Zhiyuan Liu
  4. Maosong Sun
  5. Tim Rocktaschel
  6. Nicolas Usunier
  7. Guillaume Obozinski
  8. William Yang Wang

Citations in the corpus