Learning Adaptive Display Exposure for Real-Time Advertising
arXiv:1809.03149
Abstract
In E-commerce advertising, where product recommendations and product ads are presented to users simultaneously, the traditional setting is to display ads at fixed positions. However, under such a setting, the advertising system loses the flexibility to control the number and positions of ads, resulting in sub-optimal platform revenue and user experience. Consequently, major e-commerce platforms (e.g., Taobao.com) have begun to consider more flexible ways to display ads. In this paper, we investigate the problem of advertising with adaptive exposure: can we dynamically determine the number and positions of ads for each user visit under certain business constraints so that the platform revenue can be increased? More specifically, we consider two types of constraints: request-level constraint ensures user experience for each user visit, and platform-level constraint controls the overall platform monetization rate. We model this problem as a Constrained Markov Decision Process with per-state constraint (psCMDP) and propose a constrained two-level reinforcement learning approach to decompose the original problem into two relatively independent sub-problems. To accelerate policy learning, we also devise a constrained hindsight experience replay mechanism. Experimental evaluations on industry-scale real-world datasets demonstrate the merits of our approach in both obtaining higher revenue under the constraints and the effectiveness of the constrained hindsight experience replay mechanism.
arXiv commentaccepted by CIKM2019
References in corpus (12)
- Continuous control with deep reinforcement learning
- Trust Region Policy Optimization
- High-Dimensional Continuous Control Using Generalized Advantage Estimation
- Hierarchical Deep Reinforcement Learning: Integrating Temporal Abstraction and Intrinsic Motivation
- Hindsight Experience Replay
- Reward Constrained Policy Optimization
- Real-Time Bidding with Multi-Agent Reinforcement Learning in Display Advertising
- Constrained Policy Optimization
- Algorithms with Logarithmic or Sublinear Regret for Constrained Contextual Bandits
- An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives
- Safe Policy Search for Lifelong Reinforcement Learning with Sublinear Regret
- Learning to Collaborate: Multi-Scenario Ranking via Multi-Agent Reinforcement Learning