mlsanityData to 7 Oct 2026

Ensure Timeliness and Accuracy: A Novel Sliding Window Data Stream Paradigm for Live Streaming Recommendation

arXiv 2402.14399 ↗First posted 22 Feb 2024cs.IR cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Live streaming recommender system is specifically designed to recommend real-time live streaming of interest to users. Due to the dynamic changes of live content, improving the timeliness of the live streaming recommender system is a critical problem. Intuitively, the timeliness of the data determines the upper bound of the timeliness that models can learn. However, none of the previous works addresses the timeliness problem of the live streaming recommender system from the perspective of data stream design. Employing the conventional fixed window data stream paradigm introduces a trade-off dilemma between labeling accuracy and timeliness. In this paper, we propose a new data stream design paradigm, dubbed Sliver, that addresses the timeliness and accuracy problem of labels by reducing the window size and implementing a sliding window correspondingly. Meanwhile, we propose a time-sensitive re-reco strategy reducing the latency between request and impression to improve the timeliness of the recommendation service and features by periodically requesting the recommendation service. To demonstrate the effectiveness of our approach, we conduct offline experiments on a multi-task live streaming dataset with labeling timestamps collected from the Kuaishou live streaming platform. Experimental results demonstrate that Sliver outperforms two fixed-window data streams with varying window sizes across all targets in four typical multi-task recommendation models. Furthermore, we deployed Sliver on the Kuaishou live streaming platform. Results of the online A/B test show a significant improvement in click-through rate (CTR), and new follow number (NFN), further validating the effectiveness of Sliver.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 17 of its 36 references that are in the map. First posted on arXiv 22 Feb 2024.

Builds on

17 of 36 references.

References · 17

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2017An Overview of Multi-Task Learning in Deep Neural Networkscited by 791
  3. 2016Wide & Deep Learning for Recommender Systemscited by 745
  4. 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 336
  5. 2020Search-based User Interest Modeling with Lifelong Sequential Behavior Data for Click-Through Rate Predictioncited by 176
  6. 2018Entire Space Multi-Task Model: An Effective Approach for Estimating Post-Click Conversion Ratecited by 172
  7. 2013Online Learning under Delayed Feedbackcited by 137
  8. 2018Billion-scale Commodity Embedding for E-commerce Recommendation in Alibabacited by 105
  9. 2020Streaming Graph Neural Networks via Continual Learningcited by 63
  10. 2023PEPNet: Parameter and Embedding Personalized Network for Infusing with Personalized Prior Informationcited by 60
  11. 2023Dynamically Expandable Graph Convolution for Streaming Recommendationcited by 26
  12. 2021Real Negatives Matter: Continuous Training with Real Negatives for Delayed Feedback Modelingcited by 20
5 more
  1. 2018A Nonparametric Delayed Feedback Model for Conversion Rate Predictioncited by 19
  2. 2022Asymptotically Unbiased Estimation for Delayed Feedback Modeling via Label Correctioncited by 15
  3. 2015Dynamic Matrix Factorization with Priors on Unknown Valuescited by 11
  4. 2021Leveraging Tripartite Interaction Information from Live Stream E-Commerce for Improving Product Recommendationcited by 7
  5. 2023Streaming CTR Prediction: Rethinking Recommendation Task for Real-World Streaming Datacited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 2; 2026: 1.

4 papers.