$k$NN-Adapter: Efficient Domain Adaptation for Black-Box Language Models (2302.10879v1)
Abstract: Fine-tuning a LLM on a new domain is standard practice for domain adaptation. However, it can be infeasible when it comes to modern large-scale LLMs such as GPT-3, which can only be accessed through APIs, making it difficult to access the internal parameters of the model. In this paper, we propose $k$NN-Adapter, a method to effectively adapt these black-box LLMs to a new domain. The $k$NN-Adapter builds on top of the retrieval-augmented LLM, and adaptively learns to interpolate the output of the LLM with retrieval results from a datastore consisting of the target domain data. Our experiments on four different domains demonstrate that $k$NN-Adapter significantly improves perplexity, and works particularly well in settings with limited access to LLMs. Additionally, we show that $k$NN-Adapter is more effective than fine-tuning when the amount of training data is limited. We also release a dataset to encourage further study.
- Yangsibo Huang (40 papers)
- Daogao Liu (34 papers)
- Zexuan Zhong (17 papers)
- Weijia Shi (55 papers)
- Yin Tat Lee (102 papers)