Skip to content
Book Open access

From Continuous Pretraining to Domain-Adaptive Reranking via Task Vector Adaptation

Jul 2026 · Annual International ACM SIGIR Conference on Research and Development in Information Retrieval · 0 citations · 21 references
Computer Science

TL;DR

This work proposes a fine-grained task vector adaptation method that learns parameter-wise scaling coefficients for the task vector that are optimized using a language modeling objective while keeping all model parameters fixed, enabling effective integration of domain-specific knowledge without degrading reranking capabilities.

Abstract

Large language model (LLM)-based rerankers have demonstrated strong performance in information retrieval tasks, but adapting them to specialized domains remains challenging due to the substantial cost and effort required to construct high-quality domain-specific training datasets. To address this limitation, we leverage task vectors derived from continuous pretraining as a mechanism for transferring domain knowledge. However, existing task vector integration methods are highly sensitive to scaling factors and can lead to unstable performance across domains and model scales. In this work, we propose a fine-grained task vector adaptation method that learns parameter-wise scaling coefficients for the task vector. These coefficients are optimized using a language modeling objective while keeping all model parameters fixed, enabling effective integration of domain-specific knowledge without degrading reranking capabilities. Experiments on a general-domain benchmark and five specialized domains across two model scales demonstrate that our method provides stable improvements across most domains and avoids the degradation observed with fixed task vector scaling.

Read PDF

Similar papers

Book Open access Jul 2026

Domain-Specific Reranking: When is Adaptation Worth the Cost?

It is found that when pretraining data is limited, task-specific fine-tuning—using only a few hundred labeled examples in the domain—can match or surpass the gains of domain-adaptive pretraining, suggesting that domain-adaptive pretraining may not always be necessary for strong domain performance.

Tuukka Karvonen, Alessio Staffini, Kenichi Maeda et al. · 0 citations
Aug 2026

DR-EFT: Exploring and reloading domain-representative experts for the memory-constrained fine-tuning of MoE large models.

An algorithm framework named DR-EFT (Domain-Representative Experts for Fine-Tuning), which explores and loads the domain-representative experts for subsequent retraining and reincorporation and demonstrates robustness through validations on popular MoE LLMs, including Qwen, DeepSeek, and Ernie.

Zhaomeng Cheng, Zhong Ji, Yan Zhang et al. · 0 citations
Jul 2026

TopoTuner: Topological Finetuning of Large Language Models

TopoTuner is competitive with full fine-tuning while training only 1-2% of the model parameters, and outperforms LoRA in 7 out of 9 model-dataset settings, which can change up to 39.57% of the projection parameters.

Abdulkadir Erol, Yash Mahajan, Vepaul Hariprashad et al. · 0 citations
Book Open access Jul 2026

Set-Based Cross-Domain Recommendation

Because SetCDR operates directly on sets of user history records, it provides a natural way to examine how histories influence user representations, and adapts immediately to new interactions without additional retraining, enabling on-the-fly performance improvement.

Kyunglim Kim, James Geraci · 0 citations
Preprint Jul 2026

UMoE:Unlocking Every Expert in Domain-Specific Training

A simple, budget-preserving pipeline is proposed that realigns the expert pool to the target domain before fine-tuning, and turns this redundant capacity into useful domain capacity and achieves lower training loss, with gains spanning all difficulty levels in downstream evaluation.

Xuefeng Li, Pengfei Liu · 0 citations
Conference 2026

SuRe-EM: Subspace-Routing and Residual-Corrected Expert Model for Domain-Adaptive Retrieval

SuRe-EM (Subspace-routing & Residual-corrected Expert Model) enhances Cross-Domain representation by integrating fine-grained subspace routing with non-linear residual correction and resolves the issues of domain specialization and Cross-Domain generalization in domain-adaptive retrieval.

Xi-Fang Liu · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.