Investigating Task Arithmetic for Zero-Shot Information Retrieval
Investigating Task Arithmetic for Zero-Shot Information Retrieval
Large Language Models (LLMs) have shown impressive zero-shot performance across a variety of Natural Language Processing tasks, including document re-ranking. However, their effectiveness degrades on unseen tasks and domains, largely due to shifts in vocabulary and word distributions. In this paper, we investigate Task Arithmetic, a technique that combines the weights of LLMs pre-trained on different tasks or domains via simple mathematical operations, such as addition or subtraction, to adapt retrieval models without requiring additional fine-tuning. Our method is able to synthesize diverse tasks and domain knowledge into a single model, enabling effective zero-shot adaptation in different retrieval contexts. Extensive experiments on publicly available scientific, biomedical, and multilingual datasets show that our method improves state-of-the-art re-ranking performance by up to 18% in NDCG@10 and 15% in P@10. In addition to these empirical gains, our analysis provides insights into the strengths and limitations of Task Arithmetic as a practical strategy for zero-shot learning and model adaptation. We make our code publicly available at https://github.com/DetectiveMB/Task-Arithmetic-for-ZS-IR.
Marco Braga、Pranav Kasela、Alessandro Raganato、Gabriella Pasi
计算技术、计算机技术
Marco Braga,Pranav Kasela,Alessandro Raganato,Gabriella Pasi.Investigating Task Arithmetic for Zero-Shot Information Retrieval[EB/OL].(2025-05-01)[2025-06-03].https://arxiv.org/abs/2505.00649.点此复制
评论