Pith. sign in

REVIEW 3 cited by

Reinforcement learning based recommender systems: A survey

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2101.06286 v2 pith:TET7VSU4 submitted 2021-01-15 cs.IR

classification cs.IR
keywords learningproblemrecommendationreinforcementalgorithmsfieldrecommendersurvey
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Recommender systems (RSs) have become an inseparable part of our everyday lives. They help us find our favorite items to purchase, our friends on social networks, and our favorite movies to watch. Traditionally, the recommendation problem was considered to be a classification or prediction problem, but it is now widely agreed that formulating it as a sequential decision problem can better reflect the user-system interaction. Therefore, it can be formulated as a Markov decision process (MDP) and be solved by reinforcement learning (RL) algorithms. Unlike traditional recommendation methods, including collaborative filtering and content-based filtering, RL is able to handle the sequential, dynamic user-system interaction and to take into account the long-term user engagement. Although the idea of using RL for recommendation is not new and has been around for about two decades, it was not very practical, mainly because of scalability problems of traditional RL algorithms. However, a new trend has emerged in the field since the introduction of deep reinforcement learning (DRL), which made it possible to apply RL to the recommendation problem with large state and action spaces. In this paper, a survey on reinforcement learning based recommender systems (RLRSs) is presented. Our aim is to present an outlook on the field and to provide the reader with a fairly complete knowledge of key concepts of the field. We first recognize and illustrate that RLRSs can be generally classified into RL- and DRL-based methods. Then, we propose an RLRS framework with four components, i.e., state representation, policy optimization, reward formulation, and environment building, and survey RLRS algorithms accordingly. We highlight emerging topics and depict important trends using various graphs and tables. Finally, we discuss important aspects and challenges that can be addressed in the future.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Self-Evolving Recommendation System: End-To-End Autonomous Model Optimization With LLM Agents

    cs.LG 2026-02 conditional novelty 6.0 of 10

    LLM agents acting as ML engineers autonomously generated optimizer, architecture, and reward changes that produced small live metric gains at YouTube when deployed through a dual offline/online loop.

  2. PPO-Q: Proximal Policy Optimization with Parametrized Quantum Policies or Values

    quant-ph 2025-01 conditional novelty 6.0 of 10

    PPO-Q combines a small parameterized quantum circuit with pre-encoding and post-processing neural networks inside the PPO algorithm, matching classical performance on eight tasks with fewer parameters and solving Bipe...

  3. Defining the scope of AI regulations

    cs.CY 2019-08 conditional novelty 6.0 of 10

    Regulators should define AI regulation scope by specific risk sources (technical approaches, applications, capabilities) rather than by the vague term AI.

Pith tools