{"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-probabilistic-matrix-factorization","title":"Scalable Probabilistic Matrix Factorization with Graph-Based Priors","arxiv_id":"1908.09393","date":"2019-08-25","proceeding":null,"authors":["Jonathan Strahl","Jaakko Peltonen","Hiroshi Mamitsuka","Samuel Kaski"],"abstract":"In matrix factorization, available graph side-information may not be well suited for the matrix completion problem, having edges that disagree with the latent-feature relations learnt from the incomplete data matrix. We show that removing these $\\textit{contested}$ edges improves prediction accuracy and scalability. We identify the contested edges through a highly-efficient graphical lasso approximation. The identification and removal of contested edges adds no computational complexity to state-of-the-art graph-regularized matrix factorization, remaining linear with respect to the number of non-zeros. Computational load even decreases proportional to the number of edges removed. Formulating a probabilistic generative model and using expectation maximization to extend graph-regularised alternating least squares (GRALS) guarantees convergence. Rich simulated experiments illustrate the desired properties of the resulting algorithm. On real data experiments we demonstrate improved prediction accuracy with fewer graph edges (empirical evidence that graph side-information is often inaccurate). A 300 thousand dimensional graph with three million edges (Yahoo music side-information) can be analyzed in under ten minutes on a standard laptop computer demonstrating the efficiency of our graph update.","url_abs":"https://arxiv.org/abs/1908.09393v2","url_pdf":"https://arxiv.org/pdf/1908.09393v2.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-probabilistic-matrix-factorization","repo_url":"https://github.com/strahl2e/GPMF-GBP-AAAI-20","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"matrix-completion","task_name":"Matrix Completion"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/recommendation-systems-on-douban-monti","task":"Recommendation Systems","dataset":"Douban Monti","model":"GRAEM / KPMF","rank_in_archive_order":4,"of":8,"metrics":{"RMSE":"0.7323"},"uses_additional_data":true},{"leaderboard":"/sota/recommendation-systems-on-flixster-monti","task":"Recommendation Systems","dataset":"Flixster Monti","model":"GRAEM","rank_in_archive_order":3,"of":7,"metrics":{"RMSE":"0.8857"},"uses_additional_data":true},{"leaderboard":"/sota/collaborative-filtering-on-movielens-100k","task":"Recommendation Systems","dataset":"MovieLens 100K","model":"GRAEM / KPMF","rank_in_archive_order":11,"of":18,"metrics":{"RMSE (u1 Splits)":"0.9174"},"uses_additional_data":true},{"leaderboard":"/sota/collaborative-filtering-on-yahoomusic","task":"Recommendation Systems","dataset":"YahooMusic","model":"GRALS","rank_in_archive_order":1,"of":3,"metrics":{"RMSE":"22.760"},"uses_additional_data":true},{"leaderboard":"/sota/collaborative-filtering-on-yahoomusic","task":"Recommendation Systems","dataset":"YahooMusic","model":"GRAEM","rank_in_archive_order":2,"of":3,"metrics":{"RMSE":"22.795"},"uses_additional_data":true}],"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":"strahl2e/GPMF-GBP-AAAI-20","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":"9fcc1c1867e8749d739975cb73df0c3380e37f786dfde23f9cbc1abef2f1e038","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}