{"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/everyone-s-a-winner-on-hyperparameter-tuning","title":"Everyone's a Winner! On Hyperparameter Tuning of Recommendation Models","arxiv_id":null,"date":"2023-09-23","proceeding":"Conference 2023 9","authors":["Faisal Shehzad","Dietmar Jannach"],"abstract":"The performance of a recommender system algorithm in terms of common offline accuracy measures often strongly depends on the\r\nchosen hyperparameters. Therefore, when comparing algorithms in offline experiments, we can obtain reliable insights regarding the\r\neffectiveness of a newly proposed algorithm only if we compare it to a number of state-of-the-art baselines that are carefully tuned for\r\neach of the considered datasets. While this fundamental principle of any area of applied machine learning is undisputed, we find that the tuning process for the baselines in the current literature is barely documented in much of today’s published research. Ultimately, in\r\ncase the baselines are actually not carefully tuned, progress may remain unclear. In this paper, we exemplify through a computational\r\nexperiment involving seven recent deep learning models how every method in such an unsound comparison can be reported to be\r\noutperforming the state-of-the-art. Finally, we iterate appropriate research practices to avoid unreliable algorithm comparisons in the\r\nfuture.","url_abs":"https://dl.acm.org/doi/pdf/10.1145/3604915.3609488","url_pdf":"https://dl.acm.org/doi/pdf/10.1145/3604915.3609488","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":"everyone-s-a-winner-on-hyperparameter-tuning","repo_url":"https://github.com/Faisalse/RecSys2023_hyperparameter_tuning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"multi-domain-recommender-systems","task_name":"Multi-Domain Recommender Systems"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"Faisalse/RecSys2023_hyperparameter_tuning","kind":"listed","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":"01117752165e91fcfa130d41c4f27c2c49848a8fd3f9a32f39b8c99b8ff65cdd","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}