{"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-approximate-nonsymmetric-autoencoder","title":"Scalable Approximate NonSymmetric Autoencoder for Collaborative Filtering","arxiv_id":null,"date":"2023-09-14","proceeding":"ACM Conference on Recommender Systems 2023 9","authors":["Martin Spišák","Radek Bartyzal","Antonín Hoskovec","Ladislav Peška","Miroslav Tůma"],"abstract":"In the field of recommender systems, shallow autoencoders have recently gained significant attention. One of the most highly acclaimed shallow autoencoders is EASE, favored for its competitive recommendation accuracy and simultaneous simplicity. However, the poor scalability of EASE (both in time and especially in memory) severely restricts its use in production environments with vast item sets. In this paper, we propose a hyperefficient factorization technique for sparse approximate inversion of the data-Gram matrix used in EASE. The resulting autoencoder, SANSA, is an end-to-end sparse solution with prescribable density and almost arbitrarily low memory requirements — even for training. As such, SANSA allows us to effortlessly scale the concept of EASE to millions of items and beyond.","url_abs":"https://dl.acm.org/doi/10.1145/3604915.3608827","url_pdf":"https://dl.acm.org/doi/pdf/10.1145/3604915.3608827","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-approximate-nonsymmetric-autoencoder","repo_url":"https://github.com/glami/sansa","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"collaborative-filtering","task_name":"Collaborative Filtering"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/collaborative-filtering-on-amazon-book","task":"Collaborative Filtering","dataset":"Amazon-Book","model":"SANSA","rank_in_archive_order":1,"of":6,"metrics":{"NDCG@20":"0.0637","Recall@20":"0.0768"},"uses_additional_data":false},{"leaderboard":"/sota/recommendation-systems-on-amazon-book","task":"Recommendation Systems","dataset":"Amazon-Book","model":"SANSA","rank_in_archive_order":2,"of":16,"metrics":{"Recall@20":"0.0768","nDCG@20":"0.0637"},"uses_additional_data":false},{"leaderboard":"/sota/collaborative-filtering-on-million-song","task":"Recommendation Systems","dataset":"Million Song Dataset","model":"SANSA","rank_in_archive_order":2,"of":7,"metrics":{"Recall@20":"0.332","Recall@50":"0.427","nDCG@100":"0.388"},"uses_additional_data":false}],"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":"glami/sansa","kind":"named_in_paper","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1905.03375"],"harvested_for_calls":[{"arxiv_id":"1905.03375","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1905.03375"},"call":"get_harvested_code_for_paper(arxiv_id=\"1905.03375\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"298a3c6706dec09377a7fa683ecbeb4f213d382544ed6557b9dfd4512ffe81e6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}