Large Language Model Enhanced Graph Invariant Contrastive Learning for Out-of-Distribution Recommendation
Jiahao Liang, Haoran Yang, Xiangyu Zhao, Zhiwen Yu, Mianjie Li, Chuan Shi, Kaixiang Yang

TL;DR
This paper introduces InvGCLLM, a novel framework that combines invariant graph contrastive learning with large language models to improve out-of-distribution recommendation by refining graph structures and learning more robust representations.
Contribution
It proposes a new causal learning framework integrating LLMs with invariant graph contrastive learning for OOD recommendation, addressing spurious correlations.
Findings
Significant OOD recommendation performance improvements
Outperforms state-of-the-art baselines on four datasets
Effective graph refinement guided by LLMs
Abstract
Out-of-distribution (OOD) generalization has emerged as a significant challenge in graph recommender systems. Traditional graph neural network algorithms often fail because they learn spurious environmental correlations instead of stable causal relationships, leading to substantial performance degradation under distribution shifts. While recent advancements in Large Language Models (LLMs) offer a promising avenue due to their vast world knowledge and reasoning capabilities, effectively integrating this knowledge with the fine-grained topology of specific graphs to solve the OOD problem remains a significant challenge. To address these issues, we propose {ariant raph ontrastive Learning with s for Out-of-Distribution Recommendation (InvGCLLM)}, an innovative causal learning framework that synergistically integrates the strengths of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRecommender Systems and Techniques · Advanced Graph Neural Networks · Machine Learning in Healthcare
