about
Learning Dense Representations for Entity Retrieval (arxiv.org)
3 points by sel1 on Sep 25, 2019 | hide | past | pdf | discuss on HN

In plain words: Two encoders turn each name mention and each entity into a vector, then pick the closest entity directly, skipping the usual name-list lookup plus reranking step. Trained on Wikipedia links, it beat those lookup and keyword baselines while retrieving candidates much faster.

Abstract

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.

Daniel Gillick, Sayali Kulkarni, Larry Lansing, Alessandro Presta, Jason Baldridge, Eugene Ie, Diego Garcia-Olano
arXiv:1909.10506 · cs.CL, cs.IR, cs.LG · submitted Sep 23, 2019
abstract · pdf · html · CoNLL 2019

add comment on HN