mlsanityData to 7 Oct 2026

Mutual Wasserstein Discrepancy Minimization for Sequential Recommendation

arXiv 2301.12197 ↗First posted 28 Jan 2023cs.LG cs.AI cs.IRcited by 3

Not on the map. Why?

Abstract (arXiv)

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 asymmetrical estimation, 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 limitations. To this end, we propose a novel self-supervised learning framework based on 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 or items with significant uncertainty. The source code is at https://github.com/zfan20/MStein.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 40 of its 63 references that are in the map. First posted on arXiv 28 Jan 2023.

Builds on

40 of 63 references.

References · 40

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  2. 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
  3. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
  4. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
  5. 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
  6. 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,393
  7. 2020Graph Contrastive Learning with Augmentationscited by 1,203
  8. 2018Self-Attentive Sequential Recommendationcited by 1,169
  9. 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 952
  10. 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
  11. 2018Personalized Top-N Sequential Recommendation via Convolutional Sequence Embeddingcited by 473
  12. 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 332
28 more
  1. 2020S^3-Rec: Self-Supervised Learning for Sequential Recommendation with Mutual Information Maximizationcited by 311
  2. 2018Formal Limitations on the Measurement of Mutual Informationcited by 189
  3. 2020The Lipschitz Constant of Self-Attentioncited by 171
  4. 2016Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendationcited by 152
  5. 2021COCO-LM: Correcting and Contrasting Text Sequences for Language Model Pretrainingcited by 126
  6. 2021Contrastive Learning for Representation Degeneration Problem in Sequential Recommendationcited by 121
  7. 2018A Simple Convolutional Generative Network for Next Item Recommendationcited by 120
  8. 2020Graph Optimal Transport for Cross-Domain Alignmentcited by 103
  9. 2019Hierarchical Gating Networks for Sequential Recommendationcited by 101
  10. 2014Word Representations via Gaussian Embeddingcited by 96
  11. 2022Intent Contrastive Learning for Sequential Recommendationcited by 90
  12. 2017Personalizing Session-based Recommendations with Hierarchical Recurrent Neural Networkscited by 84
  13. 2017On Sampling Strategies for Neural Network-based Collaborative Filteringcited by 71
  14. 2019Wasserstein Dependency Measure for Representation Learningcited by 69
  15. 2021Continuous-Time Sequential Recommendation with Temporal Graph Collaborative Transformercited by 69
  16. 2021SimpleX: A Simple and Strong Baseline for Collaborative Filteringcited by 65
  17. 2021Contrastive Self-supervised Sequential Recommendation with Robust Augmentationcited by 56
  18. 2021Augmenting Sequential Recommendation with Pseudo-Prior Items via Reversely Pre-training Transformercited by 45
  19. 2019CosRec: 2D Convolutional Neural Networks for Sequential Recommendationcited by 37
  20. 2022Sequential Recommendation via Stochastic Self-Attentioncited by 37
  21. 2021Modeling Sequences as Distributions with Uncertainty for Sequential Recommendationcited by 22
  22. 2021Probabilistic Metric Learning with Adaptive Margin for Top-K Recommendationcited by 11
  23. 2022Explanation Guided Contrastive Learning for Sequential Recommendationcited by 11
  24. 2022Rethinking Missing Data: Aleatoric Uncertainty-Aware Recommendationcited by 6
  25. 2020M2: Mixed Models with Preferences, Popularities and Transitions for Next-Basket Recommendationcited by 5
  26. 2018Gaussian Word Embedding with a Wasserstein Distance Losscited by 4
  27. 2022Sequential Recommendation with Auxiliary Item Relationships via Multi-Relational Transformercited by 3
  28. 2023Episodes Discovery Recommendation with Multi-Source Augmentationscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 0; 2025: 0; 2026: 1.

3 papers.