MergeRec: Model Merging for Data-Isolated Cross-Domain Sequential Recommendation
Not on the map. Why?
Abstract (arXiv)
Modern recommender systems trained on domain-specific data often struggle to generalize across multiple domains. Cross-domain sequential recommendation has emerged as a promising research direction to address this challenge; however, existing approaches face fundamental limitations, such as reliance on overlapping users or items across domains, or unrealistic assumptions that ignore privacy constraints. In this work, we propose a new framework, MergeRec, based on model merging under a new and realistic problem setting termed data-isolated cross-domain sequential recommendation, where raw user interaction data cannot be shared across domains. MergeRec consists of three key components: (1) merging initialization, (2) pseudo-user data construction, and (3) collaborative merging optimization. First, we initialize a merged model using training-free merging techniques. Next, we construct pseudo-user data by treating each item as a virtual sequence in each domain, enabling the synthesis of meaningful training samples without relying on real user interactions. Finally, we optimize domain-specific merging weights through a joint objective that combines a recommendation loss, which encourages the merged model to identify relevant items, and a distillation loss, which transfers collaborative filtering signals from the fine-tuned source models. Extensive experiments demonstrate that MergeRec not only preserves the strengths of the original models but also significantly enhances generalizability to unseen domains. Compared to conventional model merging methods, MergeRec consistently achieves superior performance, with average improvements of up to 17.21% in Recall@10, highlighting the potential of model merging as a scalable and effective approach for building universal recommender systems. The source code is available at https://github.com/DIALLab-SKKU/MergeRec.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 37 of its 50 references that are in the map. First posted on arXiv 5 Jan 2026.
Builds on
37 of 50 references.
References · 37
- 2018Self-Attentive Sequential Recommendationcited by 1,184
- 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 964
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
- 2020A Primer in BERTology: What we know about how BERT workscited by 815
- 2021Robust fine-tuning of zero-shot modelscited by 797
- 2015Session-based Recommendations with Recurrent Neural Networkscited by 695
- 2021Merging Models with Fisher-Weighted Averagingcited by 621
- 2023ZipIt! Merging Models from Different Tasks without Trainingcited by 179
- 2023Text Is All You Need: Learning Language Representations for Sequential Recommendationcited by 149
- 2024Task Singular Vectors: Reducing Task Interference in Model Mergingcited by 147
- 2024Localizing Task Information for Improved Model Merging and Compressioncited by 131
- 2024Twin-Merging: Dynamic Integration of Modular Expertise in Model Mergingcited by 116
25 more
- 2024EMR-Merging: Tuning-Free High-Performance Model Mergingcited by 110
- 2020Controllable Multi-Interest Framework for Recommendationcited by 93
- 2024Parameter Competition Balancing for Model Mergingcited by 72
- 2019How Does BERT Answer Questions? A Layer-Wise Analysis of Transformer Representationscited by 63
- 2024Knowledge Composition using Task Vectors with Learned Anisotropic Scalingcited by 37
- 2024Training-Free Pretrained Model Mergingcited by 32
- 2023Contrastive Cross-Domain Sequential Recommendationcited by 31
- 2023AutoMLP: Automated MLP for Sequential Recommendationscited by 25
- 2020Mixed Information Flow for Cross-domain Sequential Recommendationscited by 22
- 2022MLP4Rec: A Pure MLP Architecture for Sequential Recommendationscited by 22
- 2022Re4: Learning to Re-contrast, Re-attend, Re-construct for Multi-interest Recommendationcited by 19
- 2024A Survey on Cross-Domain Sequential Recommendationcited by 16
- 2023Mixed Attention Network for Cross-domain Sequential Recommendationcited by 15
- 2025Bridge the Domains: Large Language Models Enhanced Cross-domain Sequential Recommendationcited by 15
- 2024Fine-Tuning Attention Modules Only: Enhancing Weight Disentanglement in Task Arithmeticcited by 14
- 2024Pacer and Runner: Cooperative Learning Framework between Single- and Cross-Domain Sequential Recommendationcited by 13
- 2024Bias Vector: Mitigating Biases in Language Models with Task Arithmetic Approachcited by 12
- 2022When Multi-Level Meets Multi-Interest: A Multi-Grained Neural Model for Sequential Recommendationcited by 11
- 2024Federated Graph Learning for Cross-Domain Recommendationcited by 9
- 2023Toward a Better Understanding of Loss Functions for Collaborative Filteringcited by 8
- 2023It's Enough: Relaxing Diagonal Constraints in Linear Autoencoders for Recommendationcited by 7
- 2023Cracking the Code of Negative Transfer: A Cooperative Game Theoretic Approach for Cross-Domain Sequential Recommendationcited by 7
- 2024A Privacy-Preserving Framework with Multi-Modal Data for Cross-Domain Recommendationcited by 5
- 2025Why is Normalization Necessary for Linear Recommenders?cited by 2
- 2025LLM-Enhanced Linear Autoencoders for Recommendationcited by 1
Built on by
Not cited yet.