Timezone: »

 
Poster
Why do Nearest Neighbor Language Models Work?
Frank Xu · Uri Alon · Graham Neubig

Tue Jul 25 02:00 PM -- 04:30 PM (PDT) @ Exhibit Hall 1 #302
in Poster Session 1 »

Language models (LMs) compute the probability of a text by sequentially computing a representation of an already-seen context and using this representation to predict the next word. Currently, most LMs calculate these representations through a neural network consuming the immediate previous context. However recently, retrieval-augmented LMs have shown to improve over standard neural LMs, by accessing information retrieved from a large datastore, in addition to their standard, parametric, next-word prediction. In this paper, we set out to understand why retrieval-augmented language models, and specifically why k-nearest neighbor language models (kNN-LMs) perform better than standard parametric LMs, even when the k-nearest neighbor component retrieves examples from the same training set that the LM was originally trained on. To this end, we perform analysis of various dimensions over which kNN-LM diverges from standard LMs, and investigate these dimensions one by one. Empirically, we identify three main reasons why kNN-LM performs better than standard LMs: using a different input representation for predicting the next tokens, approximate kNN search, and the importance of softmax temperature for the kNN distribution. Further, we incorporate some insights into the standard parametric LM, improving performance without the need for an explicit retrieval component. The code is available at https://github.com/frankxu2004/knnlm-why.

[ PDF] 

Author Information

Frank Xu (Carnegie Mellon University)
Uri Alon (Carnegie Mellon University)
Graham Neubig (Carnegie Mellon University)

More from the Same Authors