MDDL: A Framework for Reinforcement Learning-based Position Allocation in Multi-Channel Feed
Not on the map. Why?
Abstract (arXiv)
Nowadays, the mainstream approach in position allocation system is to utilize a reinforcement learning model to allocate appropriate locations for items in various channels and then mix them into the feed. There are two types of data employed to train reinforcement learning (RL) model for position allocation, named strategy data and random data. Strategy data is collected from the current online model, it suffers from an imbalanced distribution of state-action pairs, resulting in severe overestimation problems during training. On the other hand, random data offers a more uniform distribution of state-action pairs, but is challenging to obtain in industrial scenarios as it could negatively impact platform revenue and user experience due to random exploration. As the two types of data have different distributions, designing an effective strategy to leverage both types of data to enhance the efficacy of the RL model training has become a highly challenging problem. In this study, we propose a framework named Multi-Distribution Data Learning (MDDL) to address the challenge of effectively utilizing both strategy and random data for training RL models on mixed multi-distribution data. Specifically, MDDL incorporates a novel imitation learning signal to mitigate overestimation problems in strategy data and maximizes the RL signal for random data to facilitate effective learning. In our experiments, we evaluated the proposed MDDL framework in a real-world position allocation system and demonstrated its superior performance compared to the previous baseline. MDDL has been fully deployed on the Meituan food delivery platform and currently serves over 300 million users.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 15 of its 24 references that are in the map. First posted on arXiv 17 Apr 2023.
Builds on
15 of 24 references.
References · 15
- 2020Conservative Q-Learning for Offline Reinforcement Learningcited by 1,777
- 2015Deep Reinforcement Learning with Double Q-learningcited by 1,704
- 2016Generative Adversarial Imitation Learningcited by 1,576
- 2018An Algorithmic Perspective on Imitation Learningcited by 455
- 2021Randomized Ensembled Double Q-Learning: Learning Fast Without a Modelcited by 278
- 2020Maxmin Q-learning: Controlling the Estimation Bias of Q-learningcited by 117
- 2019DEAR: Deep Reinforcement Learning for Online Advertising Impression in Recommender Systemscited by 44
- 2020MiNet: Mixed Interest Network for Cross-Domain Click-Through Rate Predictioncited by 30
- 2020Jointly Learning to Recommend and Advertisecited by 27
- 2021Cross DQN: Cross Deep Q Network for Ads Allocation in Feedcited by 18
- 2020The Effect of Multi-step Methods on Overestimation in Deep Reinforcement Learningcited by 14
- 2022Deep Page-Level Interest Network in Reinforcement Learning for Ads Allocationcited by 8
Built on by
Citing papers per year: 2024: 1.
1 paper.
Similar, not cited
Close in wording, no citation either way
- 2024Putting Data at the Centre of Offline Multi-Agent Reinforcement Learning
- 2021Conservative Data Sharing for Multi-Task Offline Reinforcement Learning
- 2022Data-Efficient Pipeline for Offline Reinforcement Learning with Limited Data
- 2026Reinforcement Learning: From Algorithms To Foundation Models
- 2024Towards Sample-Efficiency and Generalization of Transfer and Inverse Reinforcement Learning: A Comprehensive Literature Review
- 2023Understanding Reinforcement Learning Algorithms: The Progress from Basic Q-learning to Proximal Policy Optimization
- 2025Statistical and Algorithmic Foundations of Reinforcement Learning
- 2026Modularized Reinforcement Learning on LLMs: From MDP Creation to Exploration and Learning