{"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/e4srec-an-elegant-effective-efficient","title":"E4SRec: An Elegant Effective Efficient Extensible Solution of Large Language Models for Sequential Recommendation","arxiv_id":"2312.02443","date":"2023-12-05","proceeding":null,"authors":["Xinhang Li","Chong Chen","Xiangyu Zhao","Yong Zhang","Chunxiao Xing"],"abstract":"The recent advancements in Large Language Models (LLMs) have sparked interest in harnessing their potential within recommender systems. Since LLMs are designed for natural language tasks, existing recommendation approaches have predominantly transformed recommendation tasks into open-domain natural language generation tasks. However, this approach necessitates items to possess rich semantic information, often generates out-of-range results, and suffers from notably low efficiency and limited extensibility. Furthermore, practical ID-based recommendation strategies, reliant on a huge number of unique identities (IDs) to represent users and items, have gained prominence in real-world recommender systems due to their effectiveness and efficiency. Nevertheless, the incapacity of LLMs to model IDs presents a formidable challenge when seeking to leverage LLMs for personalized recommendations. In this paper, we introduce an Elegant Effective Efficient Extensible solution for large language models for Sequential Recommendation (E4SRec), which seamlessly integrates LLMs with traditional recommender systems that exclusively utilize IDs to represent items. Specifically, E4SRec takes ID sequences as inputs, ensuring that the generated outputs fall within the candidate lists. Furthermore, E4SRec possesses the capability to generate the entire ranking list in a single forward process, and demands only a minimal set of pluggable parameters, which are trained for each dataset while keeping the entire LLM frozen. We substantiate the effectiveness, efficiency, and extensibility of our proposed E4SRec through comprehensive experiments conducted on four widely-used real-world datasets. The implementation code is accessible at https://github.com/HestiaSky/E4SRec/.","url_abs":"https://arxiv.org/abs/2312.02443v1","url_pdf":"https://arxiv.org/pdf/2312.02443v1.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":"e4srec-an-elegant-effective-efficient","repo_url":"https://github.com/hestiasky/e4srec","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"e4srec-an-elegant-effective-efficient","repo_url":"https://github.com/pko89403/llm-for-recsys-shadow/tree/main/E4SRec","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"},{"task_slug":"sequential-recommendation","task_name":"Sequential Recommendation"},{"task_slug":"text-generation","task_name":"Text Generation"}],"methods":[{"method_slug":"set","method_name":"SET"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2312.02443","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.02443"}},"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/pko89403/llm-for-recsys-shadow/tree/main/E4SRec","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/hestiasky/e4srec","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":4,"unverified":2},"by_repo_kind":{"official":{"samples":6,"ran":4,"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":0,"samples":[{"code_sha256_prefix":"33e43c0f3680591c","entry":"MAP_atK","repo":"hestiasky/e4srec","repo_kind":"official","path":"baseline/eval_utils.py","file_url":"https://github.com/hestiasky/e4srec/blob/HEAD/baseline/eval_utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"33e43c0f3680591c"}},{"code_sha256_prefix":"a0f6a1ad87709d01","entry":"MRR_atK","repo":"hestiasky/e4srec","repo_kind":"official","path":"baseline/eval_utils.py","file_url":"https://github.com/hestiasky/e4srec/blob/HEAD/baseline/eval_utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"a0f6a1ad87709d01"}},{"code_sha256_prefix":"77a392b61b9f5e4f","entry":"RecallPrecision_atK","repo":"hestiasky/e4srec","repo_kind":"official","path":"baseline/eval_utils.py","file_url":"https://github.com/hestiasky/e4srec/blob/HEAD/baseline/eval_utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"77a392b61b9f5e4f"}},{"code_sha256_prefix":"30f6fe477016db7a","entry":"Yelp","repo":"hestiasky/e4srec","repo_kind":"official","path":"datasets/code/data_process.py","file_url":"https://github.com/hestiasky/e4srec/blob/HEAD/datasets/code/data_process.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"30f6fe477016db7a"}},{"code_sha256_prefix":"1ce557ccbb42a62f","entry":"Amazon","repo":"hestiasky/e4srec","repo_kind":"official","path":"datasets/code/data_process.py","file_url":"https://github.com/hestiasky/e4srec/blob/HEAD/datasets/code/data_process.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"1ce557ccbb42a62f"}},{"code_sha256_prefix":"cefdf494535d8de6","entry":"Amazon_meta","repo":"hestiasky/e4srec","repo_kind":"official","path":"datasets/code/data_process.py","file_url":"https://github.com/hestiasky/e4srec/blob/HEAD/datasets/code/data_process.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"cefdf494535d8de6"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}