Towards the D-Optimal Online Experiment Design for Recommender Selection
Not on the map. Why?
Abstract (arXiv)
Selecting the optimal recommender via online exploration-exploitation is catching increasing attention where the traditional A/B testing can be slow and costly, and offline evaluations are prone to the bias of history data. Finding the optimal online experiment is nontrivial since both the users and displayed recommendations carry contextual features that are informative to the reward. While the problem can be formalized via the lens of multi-armed bandits, the existing solutions are found less satisfactorily because the general methodologies do not account for the case-specific structures, particularly for the e-commerce recommendation we study. To fill in the gap, we leverage the D-optimal design from the classical statistics literature to achieve the maximum information gain during exploration, and reveal how it fits seamlessly with the modern infrastructure of online inference. To demonstrate the effectiveness of the optimal designs, we provide semi-synthetic simulation studies with published code and data for reproducibility purposes. We then use our deployment example on Walmart.com to fully illustrate the practical insights and effectiveness of the proposed methods.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 58 references that are in the map. First posted on arXiv 23 Oct 2021.
Builds on
13 of 58 references.
References · 13
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,474
- 2020Inductive Representation Learning on Temporal Graphscited by 462
- 2017A Tutorial on Thompson Samplingcited by 433
- 2020Bias and Debias in Recommender System: A Survey and Future Directionscited by 240
- 2014Taming the Monster: A Fast and Simple Algorithm for Contextual Banditscited by 201
- 2014An Information-Theoretic Analysis of Thompson Samplingcited by 178
- 2018Offline A/B testing for Recommender Systemscited by 96
- 2017Efficient Contextual Bandits in Non-stationary Worldscited by 62
- 2016An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial banditscited by 47
- 2019Product Knowledge Graph Embedding for E-commercecited by 36
- 2013Volumetric Spanners: an Efficient Exploration Basis for Learningcited by 24
- 2020Adversarial Counterfactual Learning and Evaluation for Recommender Systemcited by 16
Built on by
Not cited yet.