Deep Exploration for Recommendation Systems
Not on the map. Why?
Abstract (arXiv)
Modern recommendation systems ought to benefit by probing for and learning from delayed feedback. Research has tended to focus on learning from a user's response to a single recommendation. Such work, which leverages methods of supervised and bandit learning, forgoes learning from the user's subsequent behavior. Where past work has aimed to learn from subsequent behavior, there has been a lack of effective methods for probing to elicit informative delayed feedback. Effective exploration through probing for delayed feedback becomes particularly challenging when rewards are sparse. To address this, we develop deep exploration methods for recommendation systems. In particular, we formulate recommendation as a sequential decision problem and demonstrate benefits of deep exploration over single-step exploration. Our experiments are carried out with high-fidelity industrial-grade simulators and establish large improvements over existing algorithms.
Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). Builds on 24 of its 80 references that are in the map. First posted on arXiv 26 Sep 2021.
Builds on
24 of 80 references.
References · 24
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 2019Mastering Atari, Go, Chess and Shogi by Planning with a Learned Modelcited by 1,353
- 2016Wide & Deep Learning for Recommender Systemscited by 747
- 2017Spectrally-normalized margin bounds for neural networkscited by 686
- 2016Deep Exploration via Bootstrapped DQNcited by 527
- 2017A Tutorial on Thompson Samplingcited by 433
- 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 338
- 2018Randomized Prior Functions for Deep Reinforcement Learningcited by 219
- 2020Fairness in Machine Learningcited by 194
- 2018Top-K Off-Policy Correction for a REINFORCE Recommender Systemcited by 182
- 2014Learning to Optimize via Information-Directed Samplingcited by 168
- 2017Deep Exploration via Randomized Value Functionscited by 156
12 more
- 2013Online Learning under Delayed Feedbackcited by 141
- 2018The Frontiers of Fairness in Machine Learningcited by 141
- 2020Neural Thompson Samplingcited by 128
- 2021Epistemic Neural Networkscited by 120
- 2018Multi-Agent Generative Adversarial Imitation Learningcited by 100
- 2018Virtual-Taobao: Virtualizing Real-world Online Retail Environment for Reinforcement Learningcited by 80
- 2020Neural Contextual Bandits with Deep Representation and Shallow Explorationcited by 71
- 2018RecoGym: A Reinforcement Learning Environment for the problem of Product Recommendation in Online Advertisingcited by 65
- 2017Ensemble Samplingcited by 62
- 2018Outer Product-based Neural Collaborative Filteringcited by 41
- 2019Addressing Delayed Feedback for Continuous Training with Neural Networks in CTR predictioncited by 25
- 2019Recommendation System-based Upper Confidence Bound for Online Advertisingcited by 7
Built on by
Citing papers per year: 2022: 1; 2023: 6; 2024: 2; 2025: 3; 2026: 2.
14 papers.
Sort:
By area:
- 2023TorchRL: A data-driven decision-making library for PyTorchcited by 60
- 2022An Analysis of Ensemble Samplingcited by 24
- 2023Scalable Neural Contextual Bandit for Recommender Systemscited by 12
- 2023Evaluating Online Bandit Exploration In Large-Scale Recommender Systemcited by 7
- 2023Ensemble sampling for linear bandits: small ensembles sufficecited by 7
- 2023Optimizing Long-term Value for Auction-Based Recommender Systems via On-Policy Reinforcement Learningcited by 6
- 2024Improved Regret of Linear Ensemble Samplingcited by 6
- 2024UOEP: User-Oriented Exploration Policy for Enhancing Long-Term User Experiences in Recommender Systemscited by 2
- 2025Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Banditscited by 2
- 2023Non-Stationary Contextual Bandit Learning via Neural Predictive Ensemble Samplingcited by 1
- 2026Sharp analysis of linear ensemble samplingcited by 1
- 2025Counterfactual Inference under Thompson Samplingcited by 0
- 2026Linear Ensemble Sampling with Smaller Ensembles12 Sep 2026
- 2026Sharp analysis of linear ensemble sampling8 Feb 2026
- 2025Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits12 Oct 2025
- 2025Exploitation Over Exploration: Unmasking the Bias in Linear Bandit Recommender Offline Evaluation24 Jul 2025
- 2025Counterfactual Inference under Thompson Sampling3 Apr 2025
- 2024Improved Regret of Linear Ensemble Sampling6 Nov 2024
- 2024UOEP: User-Oriented Exploration Policy for Enhancing Long-Term User Experiences in Recommender Systems17 Jan 2024
- 2023Ensemble sampling for linear bandits: small ensembles suffice14 Nov 2023
- 2023Non-Stationary Contextual Bandit Learning via Neural Predictive Ensemble Sampling11 Oct 2023
- 2023Scalable Neural Contextual Bandit for Recommender Systems26 Jun 2023
- 2023TorchRL: A data-driven decision-making library for PyTorch1 Jun 2023
- 2023Optimizing Long-term Value for Auction-Based Recommender Systems via On-Policy Reinforcement Learning23 May 2023
2 more
- 2023Evaluating Online Bandit Exploration In Large-Scale Recommender System5 Apr 2023
- 2022An Analysis of Ensemble Sampling2 Mar 2022
- 2023TorchRL: A data-driven decision-making library for PyTorchcited by 60
- 2022An Analysis of Ensemble Samplingcited by 24
- 2023Scalable Neural Contextual Bandit for Recommender Systemscited by 12
- 2023Evaluating Online Bandit Exploration In Large-Scale Recommender Systemcited by 7
- 2023Ensemble sampling for linear bandits: small ensembles sufficecited by 7
- 2023Optimizing Long-term Value for Auction-Based Recommender Systems via On-Policy Reinforcement Learningcited by 6
- 2024Improved Regret of Linear Ensemble Samplingcited by 6
- 2025Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Banditscited by 2
- 2023Non-Stationary Contextual Bandit Learning via Neural Predictive Ensemble Samplingcited by 1
- 2026Sharp analysis of linear ensemble samplingcited by 1
- 2025Counterfactual Inference under Thompson Samplingcited by 0
- 2025Exploitation Over Exploration: Unmasking the Bias in Linear Bandit Recommender Offline Evaluationcited by 0
12 most cited of 13 All 13 (JSON)
- 2026Linear Ensemble Sampling with Smaller Ensembles12 Sep 2026
- 2026Sharp analysis of linear ensemble sampling8 Feb 2026
- 2025Provable Anytime Ensemble Sampling Algorithms in Nonlinear Contextual Bandits12 Oct 2025
- 2025Exploitation Over Exploration: Unmasking the Bias in Linear Bandit Recommender Offline Evaluation24 Jul 2025
- 2025Counterfactual Inference under Thompson Sampling3 Apr 2025
- 2024Improved Regret of Linear Ensemble Sampling6 Nov 2024
- 2023Ensemble sampling for linear bandits: small ensembles suffice14 Nov 2023
- 2023Non-Stationary Contextual Bandit Learning via Neural Predictive Ensemble Sampling11 Oct 2023
- 2023Scalable Neural Contextual Bandit for Recommender Systems26 Jun 2023
- 2023TorchRL: A data-driven decision-making library for PyTorch1 Jun 2023
- 2023Optimizing Long-term Value for Auction-Based Recommender Systems via On-Policy Reinforcement Learning23 May 2023
- 2023Evaluating Online Bandit Exploration In Large-Scale Recommender System5 Apr 2023
12 newest of 13 All 13 (JSON)