mlsanityData to 7 Oct 2026

MSN: A Memory-based Sparse Activation Scaling Framework for Large-scale Industrial Recommendation

arXiv 2602.07526 ↗First posted 7 Feb 2026cs.IRcited by 1

Not on the map. Why?

Abstract (arXiv)

Scaling deep learning recommendation models is an effective way to improve model expressiveness. Existing approaches often incur substantial computational overhead, making them difficult to deploy in large-scale industrial systems under strict latency constraints. Recent sparse activation scaling methods, such as Sparse Mixture-of-Experts, reduce computation by activating only a subset of parameters, but still suffer from high memory access costs and limited personalization capacity due to the large size and small number of experts. To address these challenges, we propose MSN, a memory-based sparse activation scaling framework for recommendation models. MSN dynamically retrieves personalized representations from a large parameterized memory and integrates them into downstream feature interaction modules via a memory gating mechanism, enabling fine-grained personalization with low computational overhead. To enable further expansion of the memory capacity while keeping both computational and memory access costs under control, MSN adopts a Product-Key Memory (PKM) mechanism, which factorizes the memory retrieval complexity from linear time to sub-linear complexity. In addition, normalization and over-parameterization techniques are introduced to maintain balanced memory utilization and prevent memory retrieval collapse. We further design customized Sparse-Gather operator and adopt the AirTopK operator to improve training and inference efficiency in industrial settings. Extensive experiments demonstrate that MSN consistently improves recommendation performance while maintaining high efficiency. Moreover, MSN has been successfully deployed in the Douyin Search Ranking System, achieving significant gains over deployed state-of-the-art models in both offline evaluation metrics and large-scale online A/B test.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 7 Feb 2026.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026SMES: Towards Scalable Multi-Task Recommendation via Expert Sparsity
  2. 2025RankMixer: Scaling Up Ranking Models in Industrial Recommenders
  3. 2026Inherit4Rec: Parameter Inheritance for Efficient Scaling of Recommendation Models ↗
  4. 2026TokenMixer-Large: Scaling Up Large Ranking Models in Industrial Recommenders
  5. 2025Exploring Test-time Scaling via Prediction Merging on Large-Scale Recommendation
  6. 2025MTmixAtt: Integrating Mixture-of-Experts with Multi-Mix Attention for Large-Scale Recommendation
  7. 2025MR.Rec: Synergizing Memory and Reasoning for Personalized Recommendation Assistant with LLMs
  8. 2026OneTrans-V2: Unifying Retrieval, Pre-rank, and Fine-rank with One Transformer in Industrial Recommender