Learning Dense Representations for Entity Retrieval

By D. Gillick, Sayali Kulkarni, Larry Lansing, Alessandro Presta, Jason Baldridge, Eugene Ie, Diego Garcia-Olano. 2019

230 citations recorded by the source corpus.

We show that it is feasible to perform entity linking by training a dual encoder (two-tower) model that encodes mentions and entities in the same dense vector space, where candidate entities are retrieved by approximate nearest neighbor search. Unlike prior work, this setup does not rely on an alias table followed by a re-ranker, and is thus the first fully learned entity retrieval model. We show that our dual encoder, trained using only anchor-text links in Wikipedia, outperforms discrete alias table and BM25 baselines, and is competitive with the best comparable results on the standard TACKBP-2010 dataset. In addition, it can retrieve candidates extremely fast, and generalizes well to a new dataset derived from Wikinews. On the modeling side, we demonstrate the dramatic value of an unsupervised negative mining algorithm for this task.

Subfields: Artificial Intelligence, Information Retrieval & Search, Representation & Self-Supervised Learning

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. Luke S. Zettlemoyer
  2. Hannaneh Hajishirzi
  3. Mohit Bansal
  4. Jianfeng Gao
  5. Sebastian Riedel
  6. Percy Liang
  7. Yejin Choi
  8. Ji-rong Wen

In Information Retrieval & Search

  1. Sebastian Riedel
  2. Hannaneh Hajishirzi
  3. Danqi Chen
  4. Fabio Petroni
  5. Jing Liu
  6. Ruiyang Ren
  7. Akari Asai
  8. Ji-rong Wen

In Representation & Self-Supervised Learning

  1. Sebastian Riedel
  2. Jingjing Liu
  3. Linjie Li
  4. Hannaneh Hajishirzi
  5. Luke S. Zettlemoyer
  6. Akari Asai
  7. Kristina Toutanova
  8. Danqi Chen

Citations in the corpus