Adaptation Approaches for Nearest Neighbor Language Models

0Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

Semi-parametric Nearest Neighbor Language Models (kNN-LMs) have produced impressive gains over purely parametric LMs, by leveraging large-scale neighborhood retrieval over external memory datastores. However, there has been little investigation into adapting such models for new domains. This work attempts to fill that gap and suggests the following approaches for adapting kNN-LMs - 1) adapting the underlying LM (using Adapters), 2) expanding neighborhood retrieval over an additional adaptation datastore, and 3) adapting the weights (scores) of retrieved neighbors using a learned Rescorer module. We study each adaptation strategy separately, as well as the combined performance improvement through ablation experiments and an extensive set of evaluations run over seven adaptation domains. Our combined adaptation approach consistently outperforms purely parametric adaptation and zero-shot (kNN-LM) baselines that construct datastores from the adaptation data. On average, we see perplexity improvements of 17.1% and 16% for these respective baselines, across domains.

Cite

CITATION STYLE

APA

Bhardwaj, R., Polovets, G., & Sunkara, M. (2023). Adaptation Approaches for Nearest Neighbor Language Models. In Proceedings of the Annual Meeting of the Association for Computational Linguistics (pp. 1135–1146). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2023.findings-acl.73

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free