{"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/matrix-factorization-on-gpus-with-memory","title":"Matrix Factorization on GPUs with Memory Optimization and Approximate Computing","arxiv_id":"1808.03843","date":"2018-08-11","proceeding":null,"authors":["Wei Tan","Shiyu Chang","Liana Fong","Cheng Li","Zijun Wang","Liangliang Cao"],"abstract":"Matrix factorization (MF) discovers latent features from observations, which\nhas shown great promises in the fields of collaborative filtering, data\ncompression, feature extraction, word embedding, etc. While many\nproblem-specific optimization techniques have been proposed, alternating least\nsquare (ALS) remains popular due to its general applicability e.g. easy to\nhandle positive-unlabeled inputs, fast convergence and parallelization\ncapability. Current MF implementations are either optimized for a single\nmachine or with a need of a large computer cluster but still are insufficient.\nThis is because a single machine provides limited compute power for large-scale\ndata while multiple machines suffer from the network communication bottleneck.\n  To address the aforementioned challenge, accelerating ALS on graphics\nprocessing units (GPUs) is a promising direction. We propose the novel approach\nin enhancing the MF efficiency via both memory optimization and approximate\ncomputing. The former exploits GPU memory hierarchy to increase data reuse,\nwhile the later reduces unnecessary computing without hurting the convergence\nof learning algorithms. Extensive experiments on large-scale datasets show that\nour solution not only outperforms the competing CPU solutions by a large margin\nbut also has a 2x-4x performance gain compared to the state-of-the-art GPU\nsolutions. Our implementations are open-sourced and publicly available.","url_abs":"http://arxiv.org/abs/1808.03843v1","url_pdf":"http://arxiv.org/pdf/1808.03843v1.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":"matrix-factorization-on-gpus-with-memory","repo_url":"https://github.com/cuMF/cumf_als","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":null,"task_name":"CPU"},{"task_slug":"collaborative-filtering","task_name":"Collaborative Filtering"},{"task_slug":"data-compression","task_name":"Data Compression"},{"task_slug":null,"task_name":"GPU"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"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":"cuMF/cumf_als","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":"a0ee310286e2712c6bdfe59af284c8af90150ceef5d47ad9528ac25f319d43d3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}