Mutual Wasserstein Discrepancy Minimization for Sequential Recommendation
Ziwei Fan, Zhiwei Liu, Hao Peng, Philip S. Yu
Abstract
Self-supervised sequential recommendation significantly improves recommendation performance by maximizing mutual information with well-designed data augmentations. However, the mutual information estimation is based on the calculation of Kullback-Leibler divergence with several limitations, including the exponential need of the sample size and training instability. Also, existing data augmentations are mostly stochastic and can potentially break sequential correlations with random modifications. These two issues motivate us to investigate an alternative robust mutual information measurement capable of modeling uncertainty and alleviating KL divergence's limitations. To this end, we propose a novel self-supervised learning framework based on the Mutual WasserStein discrepancy minimization (MStein) for the sequential recommendation. We propose the Wasserstein Discrepancy Measurement to measure the mutual information between augmented sequences. Wasserstein Discrepancy Measurement builds upon the 2-Wasserstein distance, which is more robust, more efficient in small batch sizes, and able to model the uncertainty of stochastic augmentation processes. We also propose a novel contrastive learning loss based on Wasserstein Discrepancy Measurement. Extensive experiments on four benchmark datasets demonstrate the effectiveness of MStein over baselines. More quantitative analyses show the robustness against perturbations and training efficiency in batch size. Finally, improvements analysis indicates better representations of popular users/items with significant uncertainty. The source code is in https://github.com/zfan20/MStein . CCS CONCEPTS • Information systems → Recommender systems.
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 e071ae79-e22d-46b0-8dd7-83b9d46e32e9Cited by top-tier papers3
- Temporal Graph Contrastive Learning for Sequential RecommendationShengzhe Zhang, Liyi Chen, Chao Wang, Shuangli Li et al.AAAI 2024 · 74 citations
- Bridging the Gap: Teacher-Assisted Wasserstein Knowledge Distillation for Efficient Multi-Modal RecommendationZiyi Zhuang, Hanwen Du, Hui Han, Youhua Li et al.WWW 2025
- Optimal Transport Enhanced Cross-City Site RecommendationXinhang Li, Xiangyu Zhao, Zihao Wang, Yang Duan et al.SIGIR 2024
Builds on17
- A Simple Framework for Contrastive Learning of Visual RepresentationsTing Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey E. HintonICML 2020 · 24,064 citations
- Bootstrap Your Own Latent - A New Approach to Self-Supervised LearningJean-Bastien Grill, Florian Strub, Florent Altché, Corentin Tallec et al.NeurIPS 2020 · 9,171 citations
- Graph Contrastive Learning with AugmentationsYuning You, Tianlong Chen, Yongduo Sui, Ting Chen et al.NeurIPS 2020 · 3,042 citations
- SimCSE: Simple Contrastive Learning of Sentence EmbeddingsTianyu Gao, Xingcheng Yao, Danqi ChenEMNLP 2021 · 2,496 citations
- Understanding Contrastive Representation Learning through Alignment and Uniformity on the HypersphereTongzhou Wang, Phillip IsolaICML 2020 · 2,360 citations
Related papers
- AsarRec: Adaptive Sequential Augmentation for Robust Self-supervised Sequential RecommendationKaike Zhang, Qi Cao, Fei Sun, Xinran Liu et al.SIGIR 2026
- Graph Masked Autoencoder for Sequential RecommendationYaowen Ye, Lianghao Xia, Chao HuangSIGIR 2023 · 63 citations
- Leave No One Behind: Online Self-Supervised Self-Distillation for Sequential RecommendationShaowei Wei, Zhengwei Wu, Xin Li, Qintong Wu et al.WWW 2024 · 10 citations
- Interest Entropy: Rethinking Contrastive Learning for Sequential Recommendation with Interest UncertaintyBinquan Wu, Kun Zeng, Yicheng Luo, Junhao Zheng et al.KDD 2026
- Adaptive Contrastive Learning in Sequential Recommendation based on Perturbation and Restoration NetworksYanbo Zhou, Bin Lü, Xu-Hua Yang, Xin-Li Xu et al.WWW 2026
