mlsanityData to 7 Oct 2026

Deep Uncertainty-Based Explore for Index Construction and Retrieval in Recommendation System

arXiv 2408.00799 ↗First posted 22 Jul 2024cs.IR cs.LG stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

In recommendation systems, the relevance and novelty of the final results are selected through a cascade system of Matching -> Ranking -> Strategy. The matching model serves as the starting point of the pipeline and determines the upper bound of the subsequent stages. Balancing the relevance and novelty of matching results is a crucial step in the design and optimization of recommendation systems, contributing significantly to improving recommendation quality. However, the typical matching algorithms have not simultaneously addressed the relevance and novelty perfectly. One main reason is that deep matching algorithms exhibit significant uncertainty when estimating items in the long tail (e.g., due to insufficient training samples) items.The uncertainty not only affects the training of the models but also influences the confidence in the index construction and beam search retrieval process of these models. This paper proposes the UICR (Uncertainty-based explore for Index Construction and Retrieval) algorithm, which introduces the concept of uncertainty modeling in the matching stage and achieves multi-task modeling of model uncertainty and index uncertainty. The final matching results are obtained by combining the relevance score and uncertainty score infered by the model. Experimental results demonstrate that the UICR improves novelty without sacrificing relevance on realworld industrial productive environments and multiple open-source datasets. Remarkably, online A/B test results of display advertising in Shopee demonstrates the effectiveness of the proposed algorithm.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 34 references that are in the map. First posted on arXiv 22 Jul 2024.

Builds on

21 of 34 references.

References · 21

  1. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,888
  2. 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
  3. 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 853
  4. 2018Evidential Deep Learning to Quantify Classification Uncertaintycited by 728
  5. 2020Long-tail learning via logit adjustmentcited by 605
  6. 2021Deep Long-Tailed Learning: A Surveycited by 416
  7. 2020Long-tailed Recognition by Routing Diverse Distribution-Aware Expertscited by 270
  8. 2020Embedding-based Retrieval in Facebook Searchcited by 155
  9. 2019Multi-Interest Network with Dynamic Routing for Recommendation at Tmallcited by 113
  10. 2018Billion-scale Commodity Embedding for E-commerce Recommendation in Alibabacited by 105
  11. 2018Learning Tree-based Deep Model for Recommender Systemscited by 99
  12. 2020Controllable Multi-Interest Framework for Recommendationcited by 92
9 more
  1. 2021Distributional Robustness Loss for Long-tail Learningcited by 84
  2. 2019Joint Optimization of Tree-based Index and Deep Model for Recommender Systemscited by 37
  3. 2021Sparse-Interest Network for Sequential Recommendationcited by 37
  4. 2020Large Scale Product Graph Construction for Recommendation in E-commercecited by 28
  5. 2020Learning Optimal Tree Models Under Beam Searchcited by 26
  6. 2022Approximate Nearest Neighbor Search under Neural Similarity Metric for Large-Scale Recommendationcited by 14
  7. 2020Exploration in Online Advertising Systems with Deep Uncertainty-Aware Learningcited by 12
  8. 2023STAN: Stage-Adaptive Network for Multi-Task Recommendation by Learning User Lifecycle-Based Representationcited by 6
  9. 2023Attention Weighted Mixture of Experts with Contrastive Learning for Personalized Ranking in E-commercecited by 3

Built on by

Not cited yet.