mlsanityData to 7 Oct 2026

Improving Multi-Interest Network with Stable Learning

arXiv 2207.07910 ↗First posted 14 Jul 2022cs.IR cs.AI cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Modeling users' dynamic preferences from historical behaviors lies at the core of modern recommender systems. Due to the diverse nature of user interests, recent advances propose the multi-interest networks to encode historical behaviors into multiple interest vectors. In real scenarios, the corresponding items of captured interests are usually retrieved together to get exposure and collected into training data, which produces dependencies among interests. Unfortunately, multi-interest networks may incorrectly concentrate on subtle dependencies among captured interests. Misled by these dependencies, the spurious correlations between irrelevant interests and targets are captured, resulting in the instability of prediction results when training and test distributions do not match. In this paper, we introduce the widely used Hilbert-Schmidt Independence Criterion (HSIC) to measure the degree of independence among captured interests and empirically show that the continuous increase of HSIC may harm model performance. Based on this, we propose a novel multi-interest network, named DEep Stable Multi-Interest Learning (DESMIL), which tries to eliminate the influence of subtle dependencies among captured interests via learning weights for training samples and make model concentrate more on underlying true causation. We conduct extensive experiments on public recommendation datasets, a large-scale industrial dataset and the synthetic datasets which simulate the out-of-distribution data. Experimental results demonstrate that our proposed DESMIL outperforms state-of-the-art models by a significant margin. Besides, we also conduct comprehensive model analysis to reveal the reason why DESMIL works to a certain extent.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 35 of its 56 references that are in the map. First posted on arXiv 14 Jul 2022.

Builds on

35 of 56 references.

References · 35

  1. 2017Attention Is All You Needcited by 59,932
  2. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  3. 2017Billion-scale similarity search with GPUscited by 2,477
  4. 2018Self-Attentive Sequential Recommendationcited by 1,169
  5. 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 952
  6. 2015Image-based Recommendations on Styles and Substitutescited by 702
  7. 2017Dynamic Routing Between Capsulescited by 689
  8. 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 517
  9. 2018Personalized Top-N Sequential Recommendation via Convolutional Sequence Embeddingcited by 473
  10. 2021Towards Out-Of-Distribution Generalization: A Surveycited by 431
  11. 2017A Structured Self-attentive Sentence Embeddingcited by 318
  12. 2020S^3-Rec: Self-Supervised Learning for Sequential Recommendation with Mutual Information Maximizationcited by 311
23 more
  1. 2019Learning De-biased Representations with Biased Representationscited by 199
  2. 2018Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Ratecited by 172
  3. 2021Deep Stable Learning for Out-Of-Distribution Generalizationcited by 153
  4. 2016Fusing Similarity Models with Markov Chains for Sparse Sequential Recommendationcited by 152
  5. 2019Multi-Interest Network with Dynamic Routing for Recommendation at Tmallcited by 113
  6. 2019Learning Disentangled Representations for Recommendationcited by 110
  7. 2021STAN: Spatio-Temporal Attention Network for Next Location Recommendationcited by 102
  8. 2020Controllable Multi-Interest Framework for Recommendationcited by 92
  9. 2014On Using Very Large Target Vocabulary for Neural Machine Translationcited by 80
  10. 2020Denoising Implicit Feedback for Recommendationcited by 80
  11. 2017Translation-based Recommendationcited by 70
  12. 2019Stable Learning via Sample Reweightingcited by 70
  13. 2021Generalizing Graph Neural Networks on Out-Of-Distribution Graphscited by 69
  14. 2020Stable Prediction with Model Misspecification and Agnostic Distribution Shiftcited by 62
  15. 2021Contrastive Self-supervised Sequential Recommendation with Robust Augmentationcited by 56
  16. 2018Stable Prediction across Unknown Environmentscited by 55
  17. 2021CauseRec: Counterfactual User Sequence Synthesis for Sequential Recommendationcited by 46
  18. 2020Contrastive Learning for Debiased Candidate Generation in Large-Scale Recommender Systemscited by 38
  19. 2021Sparse-Interest Network for Sequential Recommendationcited by 37
  20. 2020ESAM: Discriminative Domain Adaptation with Non-Displayed Items to Improve Long-Tail Performancecited by 30
  21. 2019Is a Single Vector Enough? Exploring Node Polysemy for Network Embeddingcited by 29
  22. 2019Improving End-to-End Sequential Recommendations with Intent-aware Diversificationcited by 12
  23. 2014General factorization framework for context-aware recommendationscited by 5

Built on by

Not cited yet.