{"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/hybrid-recommender-system-based-on","title":"Hybrid Recommender System based on Autoencoders","arxiv_id":"1606.07659","date":"2016-06-24","proceeding":null,"authors":["Florian Strub","Romaric Gaudel","Jérémie Mary"],"abstract":"A standard model for Recommender Systems is the Matrix Completion setting:\ngiven partially known matrix of ratings given by users (rows) to items\n(columns), infer the unknown ratings. In the last decades, few attempts where\ndone to handle that objective with Neural Networks, but recently an\narchitecture based on Autoencoders proved to be a promising approach. In\ncurrent paper, we enhanced that architecture (i) by using a loss function\nadapted to input data with missing values, and (ii) by incorporating side\ninformation. The experiments demonstrate that while side information only\nslightly improve the test error averaged on all users/items, it has more impact\non cold users/items.","url_abs":"http://arxiv.org/abs/1606.07659v3","url_pdf":"http://arxiv.org/pdf/1606.07659v3.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":"hybrid-recommender-system-based-on","repo_url":"https://github.com/fstrub95/Autoencoders_cf","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"torch","reach":null},{"paper_slug":"hybrid-recommender-system-based-on","repo_url":"https://github.com/Recvani/benchmark","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"hybrid-recommender-system-based-on","repo_url":"https://github.com/SJD1882/Big-Data-Recommender-Systems","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"hybrid-recommender-system-based-on","repo_url":"https://github.com/jowoojun/collaborative_filtering_keras","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"collaborative-filtering","task_name":"Collaborative Filtering"},{"task_slug":"matrix-completion","task_name":"Matrix Completion"},{"task_slug":"missing-values","task_name":"Missing Values"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/collaborative-filtering-on-douban","task":"Recommendation Systems","dataset":"Douban","model":"I-CFN","rank_in_archive_order":1,"of":7,"metrics":{"RMSE":"0.6911"},"uses_additional_data":false},{"leaderboard":"/sota/collaborative-filtering-on-douban","task":"Recommendation Systems","dataset":"Douban","model":"U-CFN","rank_in_archive_order":2,"of":7,"metrics":{"RMSE":"0.7049"},"uses_additional_data":false},{"leaderboard":"/sota/collaborative-filtering-on-movielens-10m","task":"Recommendation Systems","dataset":"MovieLens 10M","model":"I-CFN","rank_in_archive_order":8,"of":17,"metrics":{"RMSE":"0.7767"},"uses_additional_data":false},{"leaderboard":"/sota/collaborative-filtering-on-movielens-10m","task":"Recommendation Systems","dataset":"MovieLens 10M","model":"U-CFN","rank_in_archive_order":12,"of":17,"metrics":{"RMSE":"0.7954"},"uses_additional_data":false},{"leaderboard":"/sota/collaborative-filtering-on-movielens-1m","task":"Recommendation Systems","dataset":"MovieLens 1M","model":"I-CFN","rank_in_archive_order":7,"of":31,"metrics":{"RMSE":"0.8321"},"uses_additional_data":false},{"leaderboard":"/sota/collaborative-filtering-on-movielens-1m","task":"Recommendation Systems","dataset":"MovieLens 1M","model":"U-CFN","rank_in_archive_order":14,"of":31,"metrics":{"RMSE":"0.8574"},"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":"fstrub95/Autoencoders_cf","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Recvani/benchmark","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"SJD1882/Big-Data-Recommender-Systems","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jowoojun/collaborative_filtering_keras","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":"84452941b2295cd185934bbbd652a8fb72683b40562b2468618141fcf5c1ed91","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}