{"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":"/task/matrix-factorization-decomposition","name":"Matrix Factorization / Decomposition","slug":"matrix-factorization-decomposition","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":16,"papers_with_code":9,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":16,"of":16,"of_with_code":9,"tagged_in_all":16,"counts":{"archive_papers_tagged":16,"with_a_code_link":9,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":16,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/replicate-or-relocate-non-uniform-access-in","slug":"replicate-or-relocate-non-uniform-access-in","title":"NuPS: A Parameter Server for Machine Learning with Non-Uniform Parameter Access","date":"2021-04-01","arxiv_id":"2104.00501","repositories_listed":2,"syntology":null},{"url":"/paper/joint-matrix-tensor-factorization-for","slug":"joint-matrix-tensor-factorization-for","title":"Joint Matrix-Tensor Factorization for Knowledge Base Inference","date":"2017-06-02","arxiv_id":"1706.00637","repositories_listed":2,"syntology":null},{"url":"/paper/contrastive-deep-nonnegative-matrix","slug":"contrastive-deep-nonnegative-matrix","title":"Contrastive Deep Nonnegative Matrix Factorization for Community Detection","date":"2023-11-04","arxiv_id":"2311.02357","repositories_listed":1,"syntology":null},{"url":"/paper/fast-rank-1-nmf-for-missing-data-with-kl","slug":"fast-rank-1-nmf-for-missing-data-with-kl","title":"Fast Rank-1 NMF for Missing Data with KL Divergence","date":"2021-10-25","arxiv_id":"2110.12595","repositories_listed":1,"syntology":null},{"url":"/paper/joint-matrix-decomposition-for-deep","slug":"joint-matrix-decomposition-for-deep","title":"Joint Matrix Decomposition for Deep Convolutional Neural Networks Compression","date":"2021-07-09","arxiv_id":"2107.04386","repositories_listed":1,"syntology":null},{"url":"/paper/accurate-and-fast-matrix-factorization-for","slug":"accurate-and-fast-matrix-factorization-for","title":"Accurate and fast matrix factorization for low-rank learning","date":"2021-04-21","arxiv_id":"2104.10785","repositories_listed":1,"syntology":null},{"url":"/paper/rank-reduction-matrix-balancing-and-mean","slug":"rank-reduction-matrix-balancing-and-mean","title":"Fast Rank Reduction for Non-negative Matrices via Mean Field Theory","date":"2020-06-09","arxiv_id":"2006.05321","repositories_listed":1,"syntology":null},{"url":"/paper/instance-ranking-and-numerosity-reduction","slug":"instance-ranking-and-numerosity-reduction","title":"Instance Ranking and Numerosity Reduction Using Matrix Decomposition and Subspace Learning","date":"2019-04-24","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/eigenvalue-and-generalized-eigenvalue","slug":"eigenvalue-and-generalized-eigenvalue","title":"Eigenvalue and Generalized Eigenvalue Problems: Tutorial","date":"2019-03-25","arxiv_id":"1903.11240","repositories_listed":1,"syntology":null},{"url":null,"slug":"fedhm-efficient-federated-learning-for","title":"FedHM: Efficient Federated Learning for Heterogeneous Models via Low-rank Factorization","date":"2021-11-29","arxiv_id":"2111.14655","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-low-rank-matrix-factorization-based","title":"Efficient Low-Rank Matrix Factorization based on l1,ε-norm for Online Background Subtraction","date":"2021-11-19","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-convex-sparse-thermal-matrix","title":"Low-rank Convex/Sparse Thermal Matrix Approximation for Infrared-based Diagnostic System","date":"2020-10-14","arxiv_id":"2010.06784","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimum-codesign-for-image-denoising-between","title":"Optimum Codesign for Image Denoising Between Type-2 Fuzzy Identifier and Matrix Completion Denoiser","date":"2020-10-13","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-mcmc-sampling-for-bayesian-matrix","title":"Efficient MCMC Sampling for Bayesian Matrix Factorization by Breaking Posterior Symmetries","date":"2020-06-08","arxiv_id":"2006.04295","repositories_listed":0,"syntology":null},{"url":null,"slug":"text-mining-using-nonnegative-matrix","title":"Text Mining using Nonnegative Matrix Factorization and Latent Semantic Analysis","date":"2019-11-12","arxiv_id":"1911.04705","repositories_listed":0,"syntology":null},{"url":null,"slug":"identification-of-refugee-influx-patterns-in","title":"Identification of refugee influx patterns in Greece via model-theoretic analysis of daily arrivals","date":"2016-05-09","arxiv_id":"1605.02784","repositories_listed":0,"syntology":null}],"syntology_records":0,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"27684cfdd2db28619120fac3cc7cbd764c4c0089f6d08e194228fb807daa2bc2","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}