Papers › Multi-Relational Contrastive Learning for Recommendation

Multi-Relational Contrastive Learning for Recommendation

3 Sep 2023arXiv:2309.01103archive 2025-07-28

Wei Wei, Lianghao Xia, Chao Huang

Personalized recommender systems play a crucial role in capturing users' evolving preferences over time to provide accurate and effective recommendations on various online platforms. However, many recommendation models rely on a single type of behavior learning, which limits their ability to represent the complex relationships between users and items in real-life scenarios. In such situations, users interact with items in multiple ways, including clicking, tagging as favorite, reviewing, and purchasing. To address this issue, we propose the Relation-aware Contrastive Learning (RCL) framework, which effectively models dynamic interaction heterogeneity. The RCL model incorporates a multi-relational graph encoder that captures short-term preference heterogeneity while preserving the dedicated relation semantics for different types of user-item interactions. Moreover, we design a dynamic cross-relational memory network that enables the RCL model to capture users' long-term multi-behavior preferences and the underlying evolving cross-type behavior dependencies over time. To obtain robust and informative user representations with both commonality and diversity across multi-behavior interactions, we introduce a multi-relational contrastive learning paradigm with heterogeneous short- and long-term interest modeling. Our extensive experimental studies on several real-world datasets demonstrate the superiority of the RCL recommender system over various state-of-the-art baselines in terms of recommendation accuracy and effectiveness.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2309.01103")

Code

Syntology Ran 3 of 8 code samples harvested from 1 repository linked to this paper; 5 have no recorded run. Of those that ran: 3 ran with no contract checked.

By repository: official repository: 8 samples from 1 repository, 3 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

HKUDS/RCL officialmentioned in paperpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

8 samples harvested; 3 ran; 0 honoured the contract we drafted; 5 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

3ran
5unverified

Licence: 8 of the 8 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from HKUDS/RCL. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

generate_G_from_H HKUDS/RCL/hypergraph_utils.py official repository ran no licence file found · pointer only · e0e7a767dc1f60ec · report
hit HKUDS/RCL/evaluate.py official repository ran fingerprinted no licence file found · pointer only · be5c206a816aad41 · report
ndcg HKUDS/RCL/evaluate.py official repository ran no licence file found · pointer only · 334fbf3e8871bb11 · report
SpentTime HKUDS/RCL/Utils/TimeLogger.py official repository unverified no licence file found · pointer only · 43a9c38f5238b37e · report
SpentTooLong HKUDS/RCL/Utils/TimeLogger.py official repository unverified no licence file found · pointer only · b120bac4f27370e0 · report
getParam HKUDS/RCL/Utils/NNLayers.py official repository unverified no licence file found · pointer only · e6fc27a1c10c5476 · report
matrix_to_tensor HKUDS/RCL/hypergraph_utils.py official repository unverified no licence file found · pointer only · a2a74363aa00a906 · report
metrics HKUDS/RCL/evaluate.py official repository unverified no licence file found · pointer only · 3b7c5f93a9103398 · report

Tasks

Contrastive LearningRecommendation Systems

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Contrastive LearningMemory Network

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections