{"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/geometric-matrix-completion-with-recurrent","title":"Geometric Matrix Completion with Recurrent Multi-Graph Neural Networks","arxiv_id":"1704.06803","date":"2017-04-22","proceeding":"NeurIPS 2017 12","authors":["Federico Monti","Michael M. Bronstein","Xavier Bresson"],"abstract":"Matrix completion models are among the most common formulations of\nrecommender systems. Recent works have showed a boost of performance of these\ntechniques when introducing the pairwise relationships between users/items in\nthe form of graphs, and imposing smoothness priors on these graphs. However,\nsuch techniques do not fully exploit the local stationarity structures of\nuser/item graphs, and the number of parameters to learn is linear w.r.t. the\nnumber of users and items. We propose a novel approach to overcome these\nlimitations by using geometric deep learning on graphs. Our matrix completion\narchitecture combines graph convolutional neural networks and recurrent neural\nnetworks to learn meaningful statistical graph-structured patterns and the\nnon-linear diffusion process that generates the known ratings. This neural\nnetwork system requires a constant number of parameters independent of the\nmatrix size. We apply our method on both synthetic and real datasets, showing\nthat it outperforms state-of-the-art techniques.","url_abs":"http://arxiv.org/abs/1704.06803v1","url_pdf":"http://arxiv.org/pdf/1704.06803v1.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":"geometric-matrix-completion-with-recurrent","repo_url":"https://github.com/fmonti/mgcnn","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}},{"paper_slug":"geometric-matrix-completion-with-recurrent","repo_url":"https://github.com/zuirod/mg-gat","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"collaborative-filtering","task_name":"Collaborative Filtering"},{"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":"sRGCNN","rank_in_archive_order":7,"of":8,"metrics":{"RMSE":"0.8012"},"uses_additional_data":true},{"leaderboard":"/sota/recommendation-systems-on-flixster-monti","task":"Recommendation Systems","dataset":"Flixster Monti","model":"sRGCNN","rank_in_archive_order":6,"of":7,"metrics":{"RMSE":"0.9258"},"uses_additional_data":true},{"leaderboard":"/sota/collaborative-filtering-on-movielens-100k","task":"Recommendation Systems","dataset":"MovieLens 100K","model":"sRGCNN","rank_in_archive_order":14,"of":18,"metrics":{"RMSE (u1 Splits)":"0.929"},"uses_additional_data":true},{"leaderboard":"/sota/recommendation-systems-on-yahoomusic-monti","task":"Recommendation Systems","dataset":"YahooMusic Monti","model":"sRGCNN","rank_in_archive_order":5,"of":6,"metrics":{"RMSE":"22.4149"},"uses_additional_data":true}],"syntology":{"syntology_url":"https://syntology.ai/paper/1704.06803","atlas_url":"https://app.syntology.ai/?focus=1704.06803","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1704.06803"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1704.06803\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1704.06803"},"call":"get_concepts_for_paper(arxiv_id=\"1704.06803\")"}],"by_repo":[{"repo":"fmonti/mgcnn","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"zuirod/mg-gat","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":"2d33c3c971b3842f5f1d7c805ede0e57ed403a5de484acb1ec6fff4d736c79b2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}