Hierarchical Reinforcement Learning for Temporal Abstraction of Listwise Recommendation
Not on the map. Why?
Abstract (arXiv)
Modern listwise recommendation systems need to consider both long-term user perceptions and short-term interest shifts. Reinforcement learning can be applied on recommendation to study such a problem but is also subject to large search space, sparse user feedback and long interactive latency. Motivated by recent progress in hierarchical reinforcement learning, we propose a novel framework called mccHRL to provide different levels of temporal abstraction on listwise recommendation. Within the hierarchical framework, the high-level agent studies the evolution of user perception, while the low-level agent produces the item selection policy by modeling the process as a sequential decision-making problem. We argue that such framework has a well-defined decomposition of the outra-session context and the intra-session context, which are encoded by the high-level and low-level agents, respectively. To verify this argument, we implement both a simulator-based environment and an industrial dataset-based experiment. Results observe significant performance improvement by our method, compared with several well-known baselines. Data and codes have been made public.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 38 references that are in the map. First posted on arXiv 11 Sep 2024.
Builds on
22 of 38 references.
References · 22
- 2015Continuous control with deep reinforcement learningcited by 3,279
- 2020Conservative Q-Learning for Offline Reinforcement Learningcited by 1,777
- 2017Deep Interest Network for Click-Through Rate Predictioncited by 541
- 2018Data-Efficient Hierarchical Reinforcement Learningcited by 436
- 2016The Option-Critic Architecturecited by 433
- 2016Hierarchical Deep Reinforcement Learning: Integrating Temporal Abstraction and Intrinsic Motivationcited by 282
- 2019Edge Intelligence: Paving the Last Mile of Artificial Intelligence with Edge Computingcited by 225
- 2018Top-K Off-Policy Correction for a REINFORCE Recommender Systemcited by 181
- 2019Planning with Goal-Conditioned Policiescited by 144
- 2017Stochastic Neural Networks for Hierarchical Reinforcement Learningcited by 124
- 2021STAN: Spatio-Temporal Attention Network for Next Location Recommendationcited by 102
- 2018Deep Reinforcement Learning for Page-wise Recommendationscited by 99
10 more
- 2019Reinforcement Learning to Optimize Long-term User Engagement in Recommender Systemscited by 90
- 2021Towards Long-term Fairness in Recommendationcited by 77
- 2021Edge-Cloud Polarization and Collaboration: A Comprehensive Survey for AIcited by 38
- 2021Fast and Slow Learning of Recurrent Independent Mechanismscited by 36
- 2017Deep Reinforcement Learning for List-wise Recommendationscited by 35
- 2021Device-Cloud Collaborative Learning for Recommendationcited by 34
- 2021FeedRec: News Feed Recommendation with Various User Feedbackscited by 23
- 2019Exact-K Recommendation via Maximal Clique Optimizationcited by 14
- 2019Aggregating E-commerce Search Results from Heterogeneous Sources via Hierarchical Reinforcement Learningcited by 5
- 2021MC2-SF: Slow-Fast Learning for Mobile-Cloud Collaborative Recommendationcited by 5
Built on by
Citing papers per year: 2026: 1.
1 paper.