{"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/dictionary-learning-for-massive-matrix","title":"Dictionary Learning for Massive Matrix Factorization","arxiv_id":"1605.00937","date":"2016-05-03","proceeding":null,"authors":["Arthur Mensch","Julien Mairal","Bertrand Thirion","Gaël Varoquaux"],"abstract":"Sparse matrix factorization is a popular tool to obtain interpretable data\ndecompositions, which are also effective to perform data completion or\ndenoising. Its applicability to large datasets has been addressed with online\nand randomized methods, that reduce the complexity in one of the matrix\ndimension, but not in both of them. In this paper, we tackle very large\nmatrices in both dimensions. We propose a new factoriza-tion method that scales\ngracefully to terabyte-scale datasets, that could not be processed by previous\nalgorithms in a reasonable amount of time. We demonstrate the efficiency of our\napproach on massive functional Magnetic Resonance Imaging (fMRI) data, and on\nmatrix completion problems for recommender systems, where we obtain significant\nspeed-ups compared to state-of-the art coordinate descent methods.","url_abs":"http://arxiv.org/abs/1605.00937v2","url_pdf":"http://arxiv.org/pdf/1605.00937v2.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":"dictionary-learning-for-massive-matrix","repo_url":"https://github.com/arthurmensch/modl","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"collaborative-filtering","task_name":"Collaborative Filtering"},{"task_slug":"dictionary-learning","task_name":"Dictionary Learning"},{"task_slug":"matrix-completion","task_name":"Matrix Completion"},{"task_slug":"recommendation-systems","task_name":"Recommendation Systems"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/collaborative-filtering-on-movielens-10m","task":"Recommendation Systems","dataset":"MovieLens 10M","model":"Factorization with dictionary learning","rank_in_archive_order":13,"of":17,"metrics":{"RMSE":"0.799"},"uses_additional_data":false},{"leaderboard":"/sota/collaborative-filtering-on-movielens-1m","task":"Recommendation Systems","dataset":"MovieLens 1M","model":"Factorization with dictionary learning","rank_in_archive_order":16,"of":31,"metrics":{"RMSE":"0.866"},"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":"arthurmensch/modl","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":"8e9b0d48490ea0062837b74824467ebadb2ee3328e6fd06fba08b1002b7d431a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}