GemiRec: Interest Quantization and Generation for Multi-Interest Recommendation
Not on the map. Why?
Abstract (arXiv)
Multi-interest recommendation has gained attention, especially in industrial retrieval stage. Unlike classical dual-tower methods, it generates multiple user representations instead of a single one to model comprehensive user interests. However, prior studies have identified two underlying limitations: the first is interest collapse, where multiple representations homogenize. The second is insufficient modeling of interest evolution, as they struggle to capture latent interests absent from a user's historical behavior. We begin with a thorough review of existing works in tackling these limitations. Then, we attempt to tackle these limitations from a new perspective. Specifically, we propose a framework-level refinement for multi-interest recommendation, named GemiRec. The proposed framework leverages interest quantization to enforce a structural interest separation and interest generation to learn the evolving dynamics of user interests explicitly. It comprises three modules: (a) Interest Dictionary Maintenance Module (IDMM) maintains a shared quantized interest dictionary. (b) Multi-Interest Posterior Distribution Module (MIPDM) employs a generative model to capture the distribution of user future interests. (c) Multi-Interest Retrieval Module (MIRM) retrieves items using multiple user-interest representations. Both theoretical and empirical analyses, as well as extensive experiments, demonstrate its advantages and effectiveness. Moreover, it has been deployed in production since March 2025, showing its practical value in industrial applications.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 23 of its 53 references that are in the map. First posted on arXiv 16 Oct 2025.
Builds on
23 of 53 references.
References · 23
- 2017Neural Discrete Representation Learningcited by 4,650
- 2017Billion-scale similarity search with GPUscited by 2,477
- 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,031
- 2021SoundStream: An End-to-End Neural Audio Codeccited by 756
- 2022Autoregressive Image Generation using Residual Quantizationcited by 706
- 2019Multi-Interest Network with Dynamic Routing for Recommendation at Tmallcited by 113
- 2025On the Theoretical Limitations of Embedding-Based Retrievalcited by 98
- 2020Controllable Multi-Interest Framework for Recommendationcited by 92
- 2022Efficiently Leveraging Multi-level User Intent for Session-based Recommendation via Atten-Mixer Networkcited by 38
- 2021Sparse-Interest Network for Sequential Recommendationcited by 37
- 2014Stacked Quantizers for Compositional Vector Compressioncited by 30
- 2022Decoupled Side Information Fusion for Sequential Recommendationcited by 30
11 more
- 2020Learning Multi-granular Quantized Embeddings for Large-Vocab Categorical Features in Recommender Systemscited by 24
- 2018Lipschitz regularized Deep Neural Networks generalize and are adversarially robustcited by 19
- 2022Re4: Learning to Re-contrast, Re-attend, Re-construct for Multi-interest Recommendationcited by 19
- 2022Equivariant Contrastive Learning for Sequential Recommendationcited by 13
- 2022When Multi-Level Meets Multi-Interest: A Multi-Grained Neural Model for Sequential Recommendationcited by 11
- 2023Rethinking Multi-Interest Learning for Candidate Matching in Recommender Systemscited by 11
- 2021Exploring Periodicity and Interactivity in Multi-Interest Framework for Sequential Recommendationcited by 8
- 2023Curse of "Low" Dimensionality in Recommender Systemscited by 7
- 2022Diverse Preference Augmentation with Multiple Domains for Cold-start Recommendationscited by 6
- 2022Improving Micro-video Recommendation via Contrastive Multiple Interestscited by 4
- 2023Attribute Simulation for Item Embedding Enhancement in Multi-interest Recommendationcited by 1
Built on by
Not cited yet.