mlsanityData to 14 Oct 2026

SPARC: Soft Probabilistic Adaptive multi-interest Retrieval Model via Codebooks for recommender system

arXiv 2508.09090 ↗First posted 12 Aug 2025cs.IR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Modeling multi-interests has arisen as a core problem in real-world RS. Current multi-interest retrieval methods pose three major challenges: 1) Interests, typically extracted from predefined external knowledge, are invariant. Failed to dynamically evolve with users' real-time consumption preferences. 2) Online inference typically employs an over-exploited strategy, mainly matching users' existing interests, lacking proactive exploration and discovery of novel and long-tail interests. To address these challenges, we propose a novel retrieval framework named SPARC(Soft Probabilistic Adaptive Retrieval Model via Codebooks). Our contribution is two folds. First, the framework utilizes Residual Quantized Variational Autoencoder (RQ-VAE) to construct a discretized interest space. It achieves joint training of the RQ-VAE with the industrial large scale recommendation model, mining behavior-aware interests that can perceive user feedback and evolve dynamically. Secondly, a probabilistic interest module that predicts the probability distribution over the entire dynamic and discrete interest space. This facilitates an efficient "soft-search" strategy during online inference, revolutionizing the retrieval paradigm from "passive matching" to "proactive exploration" and thereby effectively promoting interest discovery. Online A/B tests on an industrial platform with tens of millions daily active users, have achieved substantial gains in business metrics: +0.9% increase in user view duration, +0.4% increase in user page views (PV), and a +22.7% improvement in PV500(new content reaching 500 PVs in 24 hours). Offline evaluations are conducted on open-source Amazon Product datasets. Metrics, such as Recall@K and Normalized Discounted Cumulative Gain@K(NDCG@K), also showed consistent improvement. Both online and offline experiments validate the efficacy and practical value of the proposed method.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 34 references that are in the map. First posted on arXiv 12 Aug 2025.

Builds on

19 of 34 references.

References · 19

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  3. 2017Neural Discrete Representation Learningcited by 4,712
  4. 2017Billion-scale similarity search with GPUscited by 2,497
  5. 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 861
  6. 2022Autoregressive Image Generation using Residual Quantizationcited by 722
  7. 2015Image-based Recommendations on Styles and Substitutescited by 706
  8. 2017Dynamic Routing Between Capsulescited by 689
  9. 2017Deep Interest Network for Click-Through Rate Predictioncited by 544
  10. 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 520
  11. 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 338
  12. 2020S^3-Rec: Self-Supervised Learning for Sequential Recommendation with Mutual Information Maximizationcited by 311
7 more
  1. 2020Self-supervised Graph Learning for Recommendationcited by 305
  2. 2020Controllable Multi-Interest Framework for Recommendationcited by 93
  3. 2017ATRank: An Attention-Based User Behavior Modeling Framework for Recommendationcited by 45
  4. 2024Generative Recommender with End-to-End Learnable Item Tokenizationcited by 34
  5. 2024Residual Quantization with Implicit Neural Codebookscited by 25
  6. 2021Sliding Spectrum Decomposition for Diversified Recommendationcited by 15
  7. 2024Trinity: Syncretizing Multi-/Long-tail/Long-term Interests All in Onecited by 7

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025GemiRec: Interest Quantization and Generation for Multi-Interest Recommendation
  2. 2026R3-REC: Reasoning-Driven Recommendation via Retrieval-Augmented LLMs over Multi-Granular Interest Signals
  3. 2024SEMINAR: Search Enhanced Multi-modal Interest Network and Approximate Retrieval for Lifelong Sequential Recommendation
  4. 2025Diffusion Model for Interest Refinement in Multi-Interest Recommendation
  5. 2026SA-RSQ: A Versatile Sparse Representation Framework for Multi-modal Recommender Systems
  6. 2026Domain-Adaptive and Scalable Dense Retrieval for Content-Based Recommendation
  7. 2026Multimodal Graph Retrieval-Augmented Sequential Recommendation via Collaborative Filtering Paths
  8. 2026RRCM: Ranking-Driven Retrieval over Collaborative and Meta Memories for LLM Recommendation