Fisher-Weighted Merge of Contrastive Learning Models in Sequential Recommendation
Not on the map. Why?
Abstract (arXiv)
Along with the exponential growth of online platforms and services, recommendation systems have become essential for identifying relevant items based on user preferences. The domain of sequential recommendation aims to capture evolving user preferences over time. To address dynamic preference, various contrastive learning methods have been proposed to target data sparsity, a challenge in recommendation systems due to the limited user-item interactions. In this paper, we are the first to apply the Fisher-Merging method to Sequential Recommendation, addressing and resolving practical challenges associated with it. This approach ensures robust fine-tuning by merging the parameters of multiple models, resulting in improved overall performance. Through extensive experiments, we demonstrate the effectiveness of our proposed methods, highlighting their potential to advance the state-of-the-art in sequential learning and recommendation systems.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 18 of its 28 references that are in the map. First posted on arXiv 5 Jul 2023.
Builds on
18 of 28 references.
References · 18
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2019Parameter-Efficient Transfer Learning for NLPcited by 4,195
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,393
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
- 2019Can You Trust Your Model's Uncertainty? Evaluating Predictive Uncertainty Under Dataset Shiftcited by 1,274
- 2018Self-Attentive Sequential Recommendationcited by 1,169
- 2017Neural Collaborative Filteringcited by 1,108
- 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 952
- 2021Laplace Redux -- Effortless Bayesian Deep Learningcited by 359
- 2015Understanding Neural Networks Through Deep Visualizationcited by 332
- 2021Ensemble deep learning: A reviewcited by 283
6 more
- 2020Hyperparameter Ensembles for Robustness and Uncertainty Quantificationcited by 149
- 2021Contrastive Learning for Representation Degeneration Problem in Sequential Recommendationcited by 121
- 2020Beyond accuracy: quantifying trial-by-trial behaviour of CNNs and humans by measuring error consistencycited by 77
- 2021No One Representation to Rule Them All: Overlapping Features of Training Methodscited by 57
- 2020Neural Ensemble Search for Uncertainty Estimation and Dataset Shiftcited by 56
- 2020Deep Ensembles for Low-Data Transfer Learningcited by 19
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.