Refining Contrastive Learning and Homography Relations for Multi-Modal Recommendation
Shouxing Ma, Yawen Zeng, Shiqing Wu, Guandong Xu
Abstract
Multi-modal recommender system focuses on utilizing rich modal information ( i.e., images and textual descriptions) of items to improve recommendation performance. The current methods have achieved remarkable success with the powerful structure modeling capability of graph neural networks. However, these methods are often hindered by sparse data in real-world scenarios. Although contrastive learning and homography ( i.e., homogeneous graphs) are employed to address the data sparsity challenge, existing methods still suffer two main limitations: 1) Simple multi-modal feature contrasts fail to produce effective representations, causing noisy modal-shared features and loss of valuable information in modal-unique features; 2) The lack of exploration of the homograph relations between user interests and item co-occurrence results in incomplete mining of user-item interplay. To address the above limitations, we propose a novel framework for R****Efining multi-modAl contRastive learning and hoMography relations (REARM). Specifically, we complement multi-modal contrastive learning by employing meta-network and orthogonal constraint strategies, which filter out noise in modal-shared features and retain recommendation-relevant information in modal-unique features. To mine homogeneous relationships effectively, we integrate a newly constructed user interest graph and an item co-occurrence graph with the existing user co-occurrence and item semantic graphs for graph learning. The extensive experiments on three real-world datasets demonstrate the superiority of REARM to various state-of-the-art baselines. Our visualization further shows an improvement made by REARM in distinguishing between modal-shared and modal-unique features. Code is available here.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 0d1df396-165d-463a-b655-87aedfdd2c7cCited by top-tier papers1
Ask how each one uses itBuilds on24
- A Simple Framework for Contrastive Learning of Visual RepresentationsTing Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey E. HintonICML 2020 · 24,064 citations
- ALBERT: A Lite BERT for Self-supervised Learning of Language RepresentationsZhenzhong Lan, Mingda Chen, Sebastian Goodman, Kevin Gimpel et al.ICLR 2020 · 7,418 citations
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li et al.SIGIR 2020 · 4,448 citations
- What Makes for Good Views for Contrastive Learning?Yonglong Tian, Chen Sun, Ben Poole, Dilip Krishnan et al.NeurIPS 2020 · 1,631 citations
- Self-supervised Graph Learning for RecommendationJiancan Wu, Xiang Wang, Fuli Feng, Xiangnan He et al.SIGIR 2021 · 1,476 citations
Related papers
- STARLINE: Contrastive Learning with Modality-Aware Graph Refinement for Effective Multimedia RecommendationTaeri Kim, Sohee Ban, Hyunjoon Kim, Sang-Wook KimKDD 2025 · 1 citation
- DiffMM: Multi-Modal Diffusion Model for RecommendationYangqin Jiang, Lianghao Xia, Wei Wei, Da Luo et al.ACM MM 2024 · 92 citations
- Multi-graph Fusion Cross-model Contrastive Learning for RecommendationShengjun Ma, Yuhai Zhao, Fenglong Ma, Baoyin Liu et al.AAAI 2026
- Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive LearningZihan Lin, Changxin Tian, Yupeng Hou, Wayne Xin ZhaoWWW 2022 · 606 citations
- Graph Disentangled Contrastive Learning with Personalized Transfer for Cross-Domain RecommendationJing Liu, Lele Sun, Weizhi Nie, Peiguang Jing et al.AAAI 2024 · 32 citations
