paper-with-me

홈 › Papers

Efficient Graph based Recommender System with Weighted Averaging of Messages

2022-09-30 · Faizan Ahemad

We showcase a novel solution to a recommendation system problem where we face a perpetual soft item cold start issue. Our system aims to recommend demanded products to prospective sellers for listing in Amazon stores. These products always have only few interactions thereby giving rise to a perpetual soft item cold start situation. Modern collaborative filtering methods solve cold start using content attributes and exploit the existing implicit signals from warm start items. This approach fails in our use-case since our entire item set faces cold start issue always. Our Product Graph has over 500 Million nodes and over 5 Billion edges which makes training and inference using modern graph algorithms very compute intensive. To overcome these challenges we propose a system which reduces the dataset size and employs an improved modelling technique to reduce storage and compute without loss in performance. Particularly, we reduce our graph size using a filtering technique and then exploit this reduced product graph using Weighted Averaging of Messages over Layers (WAML) algorithm. WAML simplifies training on large graphs and improves over previous methods by reducing compute time to 1/7 of LightGCN and 1/26 of Graph Attention Network (GAT) and increasing recall$@100$ by 66% over LightGCN and 2.3x over GAT.

📄 PDF Abstract BibTeX arXiv:2209.15238

Code (0)

등록된 구현이 없습니다.

Tasks

Collaborative FilteringGraph AttentionRecommendation Systems

Methods 이 논문이 사용한 방법론

GAT A Graph Attention Network (GAT) is a neural network architecture that operates on graph-structured data, leveraging masked self-attentional layers to address the shortcomings…
LightGCN LightGCN is a type of graph convolutional neural network (GCN), including only the most essential component in GCN (neighborhood…

Similar Papers 제목 키워드 기반

Distributed Stochastic Multi-Task Learning with Graph Regularization

2018-02-11 · Weiran Wang, Jialei Wang, Mladen Kolar, Nathan Srebro

We propose methods for distributed graph-based multi-task learning that are based on weighted averaging of messages from other machines. Uniform averaging or diminishing stepsize in these methods would yield consensus (s…

Multi-Task Learning

Distributed linear regression by averaging

2018-09-30 · Edgar Dobriban, Yue Sheng

Distributed statistical learning problems arise commonly when dealing with large datasets. In this setup, datasets are partitioned over machines, which compute locally, and communicate short messages. Communication is of…

regression

Can we aggregate human intelligence? an approach for human centric aggregation using ordered weighted averaging operators

2021-05-01 · Shahab Saquib Sohail, Jamshed Siddiqui, Rashid Ali, S. Hamid Hasan 외

The primary objective of this paper is to present an approach for recommender systems that can assimilate ranking to the voters or rankers so that recommendation can be made by giving priority to experts suggestion over …

Decision MakingRecommendation Systems

Contrastive Learning for Recommender System

2021-01-05 · Zhuang Liu, Yunpu Ma, Yuanxin Ouyang, Zhang Xiong

Recommender systems, which analyze users' preference patterns to suggest potential targets, are indispensable in today's society. Collaborative Filtering (CF) is the most popular recommendation model. Specifically, Graph…

Collaborative FilteringContrastive LearningGraph Neural NetworkRecommendation Systems+1

The Environmental Impact of Ensemble Techniques in Recommender Systems

2025-11-10 · Jannik Nitschke arxiv

Ensemble techniques in recommender systems have demonstrated accuracy improvements of 10-30%, yet their environmental impact remains unmeasured. While deep learning recommendation algorithms can generate up to 3,297 kg C…