Simulation-Based Benchmarking of Reinforcement Learning Agents for Personalized Retail Promotions
Yu Xia, Sriram Narayanamoorthy, Zhengyuan Zhou, Joshua Mabry
TL;DR
This work tackles benchmarking reinforcement learning agents for personalized coupon targeting in retail, addressing the challenge of sparse purchase events that hinder learning. It advances by integrating a RetailSynth-based simulation with offline training and evaluation pipelines to compare contextual bandits and deep RL against static baselines. Key findings show that contextual bandits and PPO outperform static policies, with PPO achieving the best revenue and lower discounting, while NB and DQN struggle under sparse rewards; the results also indicate that simpler models can be competitive with modest data. By offering a reusable, open benchmarking blueprint for simulation-based retail AI, the work invites broader development of simulation tools and guided deployment decisions, pointing to future directions like richer customer modeling and scalable action spaces.
Abstract
The development of open benchmarking platforms could greatly accelerate the adoption of AI agents in retail. This paper presents comprehensive simulations of customer shopping behaviors for the purpose of benchmarking reinforcement learning (RL) agents that optimize coupon targeting. The difficulty of this learning problem is largely driven by the sparsity of customer purchase events. We trained agents using offline batch data comprising summarized customer purchase histories to help mitigate this effect. Our experiments revealed that contextual bandit and deep RL methods that are less prone to over-fitting the sparse reward distributions significantly outperform static policies. This study offers a practical framework for simulating AI agents that optimize the entire retail customer journey. It aims to inspire the further development of simulation tools for retail AI systems.
