RecFlow: An Industrial Full Flow Recommendation Dataset
Not on the map. Why?
Abstract (arXiv)
Industrial recommendation systems (RS) rely on the multi-stage pipeline to balance effectiveness and efficiency when delivering items from a vast corpus to users. Existing RS benchmark datasets primarily focus on the exposure space, where novel RS algorithms are trained and evaluated. However, when these algorithms transition to real world industrial RS, they face a critical challenge of handling unexposed items which are a significantly larger space than the exposed one. This discrepancy profoundly impacts their practical performance. Additionally, these algorithms often overlook the intricate interplay between multiple RS stages, resulting in suboptimal overall system performance. To address this issue, we introduce RecFlow, an industrial full flow recommendation dataset designed to bridge the gap between offline RS benchmarks and the real online environment. Unlike existing datasets, RecFlow includes samples not only from the exposure space but also unexposed items filtered at each stage of the RS funnel. Our dataset comprises 38M interactions from 42K users across nearly 9M items with additional 1.9B stage samples collected from 9.3M online requests over 37 days and spanning 6 stages. Leveraging the RecFlow dataset, we conduct courageous exploration experiments, showcasing its potential in designing new algorithms to enhance effectiveness by incorporating stage-specific samples. Some of these algorithms have already been deployed online, consistently yielding significant gains. We propose RecFlow as the first comprehensive benchmark dataset for the RS community, supporting research on designing algorithms at any stage, study of selection bias, debiased algorithms, multi-stage consistency and optimality, multi-task recommendation, and user behavior modeling. The RecFlow dataset, along with the corresponding source code, is available at https://github.com/RecFlow-ICLR/RecFlow.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Oct 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 5; 2026: 2.
7 papers.
- 2025TBGRecall: A Generative Retrieval Model for E-commerce Recommendation Scenarioscited by 5
- 2025SessionRec: Next Session Prediction Paradigm For Generative Sequential Recommendationcited by 2
- 2025Learning Cascade Ranking as One Networkcited by 2
- 2025Differentiable Fast Top-K Selection for Large-Scale Recommendationcited by 2
- 2025Generative Multi-Target Cross-Domain Recommendationcited by 0
- 2026SOLAR: SVD-Optimized Lifelong Attention for Recommendationcited by 0
- 2026FlashEvaluator: Expanding Search Space with Parallel Sequence-Level Evaluationcited by 0
- 2026FlashEvaluator: Expanding Search Space with Parallel Sequence-Level Evaluation3 Mar 2026
- 2026SOLAR: SVD-Optimized Lifelong Attention for Recommendation3 Mar 2026
- 2025Differentiable Fast Top-K Selection for Large-Scale Recommendation13 Oct 2025
- 2025TBGRecall: A Generative Retrieval Model for E-commerce Recommendation Scenarios16 Aug 2025
- 2025Generative Multi-Target Cross-Domain Recommendation17 Jul 2025
- 2025Learning Cascade Ranking as One Network12 Mar 2025
- 2025SessionRec: Next Session Prediction Paradigm For Generative Sequential Recommendation14 Feb 2025