Papers › Alleviating Matthew Effect of Offline Reinforcement Learning in Interactive Recommendation

Alleviating Matthew Effect of Offline Reinforcement Learning in Interactive Recommendation

10 Jul 2023arXiv:2307.04571archive 2025-07-28

Chongming Gao, Kexin Huang, Jiawei Chen, Yuan Zhang, Biao Li, Peng Jiang, Shiqi Wang, Zhong Zhang, Xiangnan He

Offline reinforcement learning (RL), a technology that offline learns a policy from logged data without the need to interact with online environments, has become a favorable choice in decision-making processes like interactive recommendation. Offline RL faces the value overestimation problem. To address it, existing methods employ conservatism, e.g., by constraining the learned policy to be close to behavior policies or punishing the rarely visited state-action pairs. However, when applying such offline RL to recommendation, it will cause a severe Matthew effect, i.e., the rich get richer and the poor get poorer, by promoting popular items or categories while suppressing the less popular ones. It is a notorious issue that needs to be addressed in practical recommender systems. In this paper, we aim to alleviate the Matthew effect in offline RL-based recommendation. Through theoretical analyses, we find that the conservatism of existing methods fails in pursuing users' long-term satisfaction. It inspires us to add a penalty term to relax the pessimism on states with high entropy of the logging policy and indirectly penalizes actions leading to less diverse states. This leads to the main technical contribution of the work: Debiased model-based Offline RL (DORL) method. Experiments show that DORL not only captures user interests well but also alleviates the Matthew effect. The implementation is available via https://github.com/chongminggao/DORL-codes.

PaperPDFCodeCode Syntology ran

In Syntology View this paper on Syntology: its repositories, every harvested function with whether it ran, its licence and the call to fetch it.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2307.04571")

Code

Syntology Ran 7 of 9 code samples harvested from 2 repositories linked to this paper; 2 have no recorded run. Of those that ran: 7 ran with no contract checked.

By repository: official repository: 3 samples from 1 repository, 3 ran; community (archive-listed): 6 samples from 1 repository, 4 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

chongminggao/dorl-codes officialmentioned in papermentioned on GitHubpytorchMIT report
ArronDZhang/ROLeR mentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested; 7 ran; 0 honoured the contract we drafted; 2 have no recorded run. Read from Syntology's graph 2026-09-25; that is when this build read the record, not when the samples ran.

7ran
2unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

get_args_dataset_specific chongminggao/dorl-codes/run_worldModel_ensemble.py official repository ran MIT (permissive) · d1dad67b0318c176 · report
loss_pointwise_Standard chongminggao/dorl-codes/run_epsilongreedy.py official repository ran MIT (permissive) · e46acb9bd88e6bc4 · report
loss_pointwise_negative_Standard chongminggao/dorl-codes/run_epsilongreedy.py official repository ran MIT (permissive) · 53f2132cb23cf159 · report
load_mat_kuairand ArronDZhang/ROLeR/rew_reshape.py community (archive-listed) ran MIT (permissive) · 3aab5f921e8397ba · report
load_mat_kuairec ArronDZhang/ROLeR/rew_reshape.py community (archive-listed) ran MIT (permissive) · f4afe07dc9c350bd · report
loaddata ArronDZhang/ROLeR/results_for_paper/visual_main_figure_ROLeR.py community (archive-listed) ran MIT (permissive) · 01e8a73f13b28644 · report
walk_paths ArronDZhang/ROLeR/results_for_paper/visual_main_figure_ROLeR.py community (archive-listed) ran fingerprinted MIT (permissive) · ae869ef797c1eab6 · report
ew_min ArronDZhang/ROLeR/rew_reshape.py community (archive-listed) unverified MIT (permissive) · 2240d8f36743ff55 · report
organize_df ArronDZhang/ROLeR/results_for_paper/visual_main_figure_ROLeR.py community (archive-listed) unverified MIT (permissive) · 04883cfc46098d5f · report

Tasks

Decision MakingInteractive RecommendationOffline RLRecommendation SystemsReinforcement LearningReinforcement Learning (RL)reinforcement-learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections