Parameter-Efficient Single Collaborative Branch for Recommendation

• URL: http://arxiv.org/abs/2508.03518v1
• Date: Tue, 05 Aug 2025 14:46:06 GMT
• Title: Parameter-Efficient Single Collaborative Branch for Recommendation
• Authors: Marta Moscati, Shah Nawaz, Markus Schedl,
• Abstract summary: We propose a novel RS that leverages weight sharing between the user and item NN modules used to obtain latent representations in the shared embedding space.<n>The proposed framework consists of a single Collaborative Branch for Recommendation (CoBraR)
• Score: 11.572384740537016
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Recommender Systems (RS) often rely on representations of users and items in a joint embedding space and on a similarity metric to compute relevance scores. In modern RS, the modules to obtain user and item representations consist of two distinct and separate neural networks (NN). In multimodal representation learning, weight sharing has been proven effective in reducing the distance between multiple modalities of a same item. Inspired by these approaches, we propose a novel RS that leverages weight sharing between the user and item NN modules used to obtain the latent representations in the shared embedding space. The proposed framework consists of a single Collaborative Branch for Recommendation (CoBraR). We evaluate CoBraR by means of quantitative experiments on e-commerce and movie recommendation. Our experiments show that by reducing the number of parameters and improving beyond-accuracy aspects without compromising accuracy, CoBraR has the potential to be applied and extended for real-world scenarios.

Related papers

• Single-Branch Network Architectures to Close the Modality Gap in Multimodal Recommendation [10.048652639214275]
  We use single-branch neural networks equipped with weight sharing, modality sampling, and contrastive loss to provide accurate recommendations.<n>We compare these networks with multi-branch alternatives and conduct extensive experiments on three datasets.<n>Our results show that single-branch networks achieve competitive performance in warm-start scenarios and are significantly better in missing modality settings.
  arXiv  Detail & Related papers  (2025-09-23T08:58:53Z)
• SCoRE: Streamlined Corpus-based Relation Extraction using Multi-Label Contrastive Learning and Bayesian kNN [0.2812395851874055]
  We introduce SCoRE, a modular and cost-effective sentence-level relation extraction system.<n>SCoRE enables easy PLM switching, requires no finetuning, and adapts smoothly to diverse corpora and KGs.<n>We show that SCoRE matches or surpasses state-of-the-art methods while significantly reducing energy consumption.
  arXiv  Detail & Related papers  (2025-07-09T14:33:07Z)
• Multiview graph dual-attention deep learning and contrastive learning for multi-criteria recommender systems [0.8575004906002217]
  We present a novel representation for Multi-Criteria Recommender Systems based on a multi-edge bipartite graph, where each edge represents one criterion rating of items by users.<n>We employ local and global contrastive learning to distinguish between positive and negative samples across each view and the entire graph.<n>We evaluate our method on two real-world datasets and assess its performance based on item rating predictions.
  arXiv  Detail & Related papers  (2025-02-26T16:25:58Z)
• Online Clustering of Dueling Bandits [59.09590979404303]
  We introduce the first "clustering of dueling bandit algorithms" to enable collaborative decision-making based on preference feedback.<n>We propose two novel algorithms: (1) Clustering of Linear Dueling Bandits (COLDB) which models the user reward functions as linear functions of the context vectors, and (2) Clustering of Neural Dueling Bandits (CONDB) which uses a neural network to model complex, non-linear user reward functions.
  arXiv  Detail & Related papers  (2025-02-04T07:55:41Z)
• Lightweight yet Fine-grained: A Graph Capsule Convolutional Network with Subspace Alignment for Shared-account Sequential Recommendation [13.270603718501732]
  We propose a Lightweight Graph Capsule Convolutional Network with subspace alignment for shared-account sequential recommendation, named LightGC$2$N.<n>It facilitates the fine-grained matching between interactions and latent users by attentively propagating messages on the capsule graphs.<n>The experimental results on four real-world datasets indicate that LightGC$2$N outperforms nine state-of-the-art methods in accuracy and efficiency.
  arXiv  Detail & Related papers  (2024-12-18T00:56:16Z)
• LLM-based Bi-level Multi-interest Learning Framework for Sequential Recommendation [54.396000434574454]
  We propose a novel multi-interest SR framework combining implicit behavioral and explicit semantic perspectives.<n>It includes two modules: the Implicit Behavioral Interest Module and the Explicit Semantic Interest Module.<n>Experiments on four real-world datasets validate the framework's effectiveness and practicality.
  arXiv  Detail & Related papers  (2024-11-14T13:00:23Z)
• A Multimodal Single-Branch Embedding Network for Recommendation in Cold-Start and Missing Modality Scenarios [10.593268426317609]
  We propose a novel technique for multimodal recommendation, relying on a multimodal Single-Branch embedding network for Recommendation (SiBraR) SiBraR encodes interaction data as well as multimodal side information using the same single-branch embedding network on different modalities. We show that SiBraR's recommendations are accurate in missing modality scenarios, and that the model is able to map different modalities to the same region of the shared embedding space.
  arXiv  Detail & Related papers  (2024-09-26T14:12:23Z)
• Improved Diversity-Promoting Collaborative Metric Learning for Recommendation [127.08043409083687]
  Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems. This paper focuses on a challenging scenario where a user has multiple categories of interests. We propose a novel method called textitDiversity-Promoting Collaborative Metric Learning (DPCML)
  arXiv  Detail & Related papers  (2024-09-02T07:44:48Z)
• The Minority Matters: A Diversity-Promoting Collaborative Metric Learning Algorithm [154.47590401735323]
  Collaborative Metric Learning (CML) has recently emerged as a popular method in recommendation systems. This paper focuses on a challenging scenario where a user has multiple categories of interests. We propose a novel method called textitDiversity-Promoting Collaborative Metric Learning (DPCML)
  arXiv  Detail & Related papers  (2022-09-30T08:02:18Z)
• Choosing the Best of Both Worlds: Diverse and Novel Recommendations through Multi-Objective Reinforcement Learning [68.45370492516531]
  We introduce Scalarized Multi-Objective Reinforcement Learning (SMORL) for the Recommender Systems (RS) setting. SMORL agent augments standard recommendation models with additional RL layers that enforce it to simultaneously satisfy three principal objectives: accuracy, diversity, and novelty of recommendations. Our experimental results on two real-world datasets reveal a substantial increase in aggregate diversity, a moderate increase in accuracy, reduced repetitiveness of recommendations, and demonstrate the importance of reinforcing diversity and novelty as complementary objectives.
  arXiv  Detail & Related papers  (2021-10-28T13:22:45Z)
• Dual Metric Learning for Effective and Efficient Cross-Domain Recommendations [85.6250759280292]
  Cross domain recommender systems have been increasingly valuable for helping consumers identify useful items in different applications. Existing cross-domain models typically require large number of overlap users, which can be difficult to obtain in some applications. We propose a novel cross-domain recommendation model based on dual learning that transfers information between two related domains in an iterative manner.
  arXiv  Detail & Related papers  (2021-04-17T09:18:59Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.