{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/scalable-cross-entropy-loss-for-sequential","title":"Scalable Cross-Entropy Loss for Sequential Recommendations with Large Item Catalogs","arxiv_id":"2409.18721","date":"2024-09-27","proceeding":null,"authors":["Gleb Mezentsev","Danil Gusak","Ivan Oseledets","Evgeny Frolov"],"abstract":"Scalability issue plays a crucial role in productionizing modern recommender systems. Even lightweight architectures may suffer from high computational overload due to intermediate calculations, limiting their practicality in real-world applications. Specifically, applying full Cross-Entropy (CE) loss often yields state-of-the-art performance in terms of recommendations quality. Still, it suffers from excessive GPU memory utilization when dealing with large item catalogs. This paper introduces a novel Scalable Cross-Entropy (SCE) loss function in the sequential learning setup. It approximates the CE loss for datasets with large-size catalogs, enhancing both time efficiency and memory usage without compromising recommendations quality. Unlike traditional negative sampling methods, our approach utilizes a selective GPU-efficient computation strategy, focusing on the most informative elements of the catalog, particularly those most likely to be false positives. This is achieved by approximating the softmax distribution over a subset of the model outputs through the maximum inner product search. Experimental results on multiple datasets demonstrate the effectiveness of SCE in reducing peak memory usage by a factor of up to 100 compared to the alternatives, retaining or even exceeding their metrics values. The proposed approach also opens new perspectives for large-scale developments in different domains, such as large language models.","url_abs":"https://arxiv.org/abs/2409.18721v2","url_pdf":"https://arxiv.org/pdf/2409.18721v2.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":"scalable-cross-entropy-loss-for-sequential","repo_url":"https://github.com/AIRI-Institute/Scalable-SASRec","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":null,"task_name":"GPU"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"},{"task_slug":"sequential-recommendation","task_name":"Sequential Recommendation"}],"methods":[{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/sequential-recommendation-on-amazon-beauty-1","task":"Sequential Recommendation","dataset":"Amazon Beauty","model":"SASRec-SCE","rank_in_archive_order":1,"of":1,"metrics":{"HR@10":"0.0935","NDCG@10":"0.0544"},"uses_additional_data":false},{"leaderboard":"/sota/sequential-recommendation-on-behance","task":"Sequential Recommendation","dataset":"Behance","model":"SASRec-SCE","rank_in_archive_order":1,"of":1,"metrics":{"COV@1":"0.0393","COV@10":"0.25","COV@5":"15.3","HR@10":"0.113","HR@5":"0.0853","NDCG@1":"0.0277","NDCG@10":"0.0663","NDCG@5":"0.0572"},"uses_additional_data":false},{"leaderboard":"/sota/sequential-recommendation-on-gowalla","task":"Sequential Recommendation","dataset":"Gowalla","model":"SASRec-SCE","rank_in_archive_order":1,"of":1,"metrics":{"COV@1":"0.0304","COV@10":"0.2190","COV@5":"0.126","HR@10":"0.0831","HR@5":"0.0574","NDCG@1":"0.0207","NDCG@10":"0.0476","NDCG@5":"0.0393"},"uses_additional_data":false}],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"AIRI-Institute/Scalable-SASRec","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"fb7382ceb7779d061a26828ca0d1dac5ea9362f654c87ddb05285546c454112c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}