Hierarchical Density Order Embeddings

Ben Athiwaratkun, Andrew Gordon Wilson

Feb 15, 2018 (modified: Feb 24, 2018) ICLR 2018 Conference Blind Submission readers: everyone Show Bibtex
  • Abstract: By representing words with probability densities rather than point vectors, proba- bilistic word embeddings can capture rich and interpretable semantic information and uncertainty (Vilnis & McCallum, 2014; Athiwaratkun & Wilson, 2017). The uncertainty information can be particularly meaningful in capturing entailment relationships – whereby general words such as “entity” correspond to broad distributions that encompass more specific words such as “animal” or “instrument”. We introduce density order embeddings, which learn hierarchical representations through encapsulation of probability distributions. In particular, we propose simple yet effective loss functions and distance metrics, as well as graph-based schemes to select negative samples to better learn hierarchical probabilistic representations. Our approach provides state-of-the-art performance on the WordNet hypernym relationship prediction task and the challenging HyperLex lexical entailment dataset – while retaining a rich and interpretable probabilistic representation.
  • Keywords: embeddings, word embeddings, probabilistic embeddings, hierarchical representation, probabilistic representation, order embeddings, wordnet, hyperlex