{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/future-impact-decomposition-in-request-level","title":"Future Impact Decomposition in Request-level Recommendations","arxiv_id":"2401.16108","date":"2024-01-29","proceeding":null,"authors":["Xiaobei Wang","Shuchang Liu","Xueliang Wang","Qingpeng Cai","Lantao Hu","Han Li","Peng Jiang","Kun Gai","Guangming Xie"],"abstract":"In recommender systems, reinforcement learning solutions have shown promising results in optimizing the interaction sequence between users and the system over the long-term performance. For practical reasons, the policy's actions are typically designed as recommending a list of items to handle users' frequent and continuous browsing requests more efficiently. In this list-wise recommendation scenario, the user state is updated upon every request in the corresponding MDP formulation. However, this request-level formulation is essentially inconsistent with the user's item-level behavior. In this study, we demonstrate that an item-level optimization approach can better utilize item characteristics and optimize the policy's performance even under the request-level MDP. We support this claim by comparing the performance of standard request-level methods with the proposed item-level actor-critic framework in both simulation and online experiments. Furthermore, we show that a reward-based future decomposition strategy can better express the item-wise future impact and improve the recommendation accuracy in the long term. To achieve a more thorough understanding of the decomposition strategy, we propose a model-based re-weighting framework with adversarial learning that further boost the performance and investigate its correlation with the reward-based strategy.","url_abs":"https://arxiv.org/abs/2401.16108v5","url_pdf":"https://arxiv.org/pdf/2401.16108v5.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"future-impact-decomposition-in-request-level","repo_url":"https://github.com/wangxiaobei565/itemdecomposition","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2401.16108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.16108"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/wangxiaobei565/itemdecomposition","reach":{"status":"ok"}}],"summary":{"ran":3},"by_repo_kind":{"official":{"samples":3,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"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"},"n_pointer_only_for_licence":3,"samples":[{"code_sha256_prefix":"45b46ab38b9745cc","entry":"dot_scorer","repo":"wangxiaobei565/itemdecomposition","repo_kind":"official","path":"model/score_func.py","file_url":"https://github.com/wangxiaobei565/itemdecomposition/blob/HEAD/model/score_func.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"45b46ab38b9745cc"}},{"code_sha256_prefix":"4cc3922a7108033d","entry":"linear_scorer","repo":"wangxiaobei565/itemdecomposition","repo_kind":"official","path":"model/score_func.py","file_url":"https://github.com/wangxiaobei565/itemdecomposition/blob/HEAD/model/score_func.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"4cc3922a7108033d"}},{"code_sha256_prefix":"8c19396be7b460b1","entry":"two_layer_mlp_scorer","repo":"wangxiaobei565/itemdecomposition","repo_kind":"official","path":"model/score_func.py","file_url":"https://github.com/wangxiaobei565/itemdecomposition/blob/HEAD/model/score_func.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"8c19396be7b460b1"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}