{"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-completion/papers/ran/1","list_of":"/task/matrix-completion","task":"Matrix Completion","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","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.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,16],"of":16,"counts":{"archive_papers_tagged":796,"with_a_code_link":153,"where_syntology_ran_a_sample":16,"not_listed_spam_title":0,"listed":796,"listed_where_code_ran":16,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":15,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":15,"listed_every_run_a_failure_of_syntologys_instrument":1,"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"},"first_page":"/task/matrix-completion/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/abrupt-learning-in-transformers-a-case-study","slug":"abrupt-learning-in-transformers-a-case-study","title":"Abrupt Learning in Transformers: A Case Study on Matrix Completion","date":"2024-10-29","arxiv_id":"2410.22244","repositories_listed":0,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/abrupt-learning-in-transformers-a-case-study#ran","syntology_url":"https://syntology.ai/paper/2410.22244","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.22244"}},"official":null}},{"url":"/paper/compressible-dynamics-in-deep","slug":"compressible-dynamics-in-deep","title":"Compressible Dynamics in Deep Overparameterized Low-Rank Learning & Adaptation","date":"2024-06-06","arxiv_id":"2406.04112","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":2,"n_pointer_only":4,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/compressible-dynamics-in-deep#ran","syntology_url":"https://syntology.ai/paper/2406.04112","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2406.04112"}},"official":{"repos":["cjyaras/deep-lora-transformers"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":2,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/linear-recursive-feature-machines-provably","slug":"linear-recursive-feature-machines-provably","title":"Linear Recursive Feature Machines provably recover low-rank matrices","date":"2024-01-09","arxiv_id":"2401.04553","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/linear-recursive-feature-machines-provably#ran","syntology_url":"https://syntology.ai/paper/2401.04553","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2401.04553"}},"official":{"repos":["aradha/lin-rfm"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/teaching-arithmetic-to-small-transformers","slug":"teaching-arithmetic-to-small-transformers","title":"Teaching Arithmetic to Small Transformers","date":"2023-07-07","arxiv_id":"2307.03381","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/teaching-arithmetic-to-small-transformers#ran","syntology_url":"https://syntology.ai/paper/2307.03381","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.03381"}},"official":{"repos":["lee-ny/teaching_arithmetic"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-signal-sampling-for-inductive-one-bit","slug":"graph-signal-sampling-for-inductive-one-bit","title":"Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution","date":"2023-02-08","arxiv_id":"2302.03933","repositories_listed":1,"syntology":{"n":10,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/graph-signal-sampling-for-inductive-one-bit#ran","syntology_url":"https://syntology.ai/paper/2302.03933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03933"}},"official":{"repos":["cchao0116/GSIMC-ICLR2023"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/indiscriminate-poisoning-attacks-on","slug":"indiscriminate-poisoning-attacks-on","title":"Indiscriminate Poisoning Attacks on Unsupervised Contrastive Learning","date":"2022-02-22","arxiv_id":"2202.11202","repositories_listed":1,"syntology":{"n":18,"n_ran":13,"n_constructed":5,"n_ran_checked":9,"n_instrument":4,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"13 ran (of which 5 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/indiscriminate-poisoning-attacks-on#ran","syntology_url":"https://syntology.ai/paper/2202.11202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.11202"}},"official":{"repos":["kaiwenzha/contrastive-poisoning"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":5,"n_ran_no_instrument_failure":9,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/counterfactual-inference-for-sequential","slug":"counterfactual-inference-for-sequential","title":"Counterfactual inference for sequential experiments","date":"2022-02-14","arxiv_id":"2202.06891","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/counterfactual-inference-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2202.06891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06891"}},"official":null}},{"url":"/paper/deep-permutation-equivariant-structure-from","slug":"deep-permutation-equivariant-structure-from","title":"Deep Permutation Equivariant Structure from Motion","date":"2021-04-14","arxiv_id":"2104.06703","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-permutation-equivariant-structure-from#ran","syntology_url":"https://syntology.ai/paper/2104.06703","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.06703"}},"official":{"repos":["drormoran/Equivariant-SFM"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/inductive-relational-matrix-completion","slug":"inductive-relational-matrix-completion","title":"Towards Open-World Recommendation: An Inductive Model-based Collaborative Filtering Approach","date":"2020-07-09","arxiv_id":"2007.04833","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/inductive-relational-matrix-completion#ran","syntology_url":"https://syntology.ai/paper/2007.04833","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04833"}},"official":{"repos":["qitianwu/IDCF"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/inductive-graph-pattern-learning-for","slug":"inductive-graph-pattern-learning-for","title":"Inductive Matrix Completion Based on Graph Neural Networks","date":"2019-04-26","arxiv_id":"1904.12058","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/inductive-graph-pattern-learning-for#ran","syntology_url":"https://syntology.ai/paper/1904.12058","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12058"}},"official":{"repos":["muhanzhang/IGMC"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bayesian-graph-convolutional-neural-networks","slug":"bayesian-graph-convolutional-neural-networks","title":"Bayesian graph convolutional neural networks for semi-supervised classification","date":"2018-11-27","arxiv_id":"1811.11103","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":3,"n_honours":3,"n_violates":3,"n_no_contract":6,"n_pointer_only":16,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 3 honoured, 3 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/bayesian-graph-convolutional-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1811.11103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.11103"}},"official":null}},{"url":"/paper/oboe-collaborative-filtering-for-automl","slug":"oboe-collaborative-filtering-for-automl","title":"OBOE: Collaborative Filtering for AutoML Model Selection","date":"2018-08-09","arxiv_id":"1808.03233","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/oboe-collaborative-filtering-for-automl#ran","syntology_url":"https://syntology.ai/paper/1808.03233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.03233"}},"official":{"repos":["udellgroup/oboe"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/cayleynets-graph-convolutional-neural","slug":"cayleynets-graph-convolutional-neural","title":"CayleyNets: Graph Convolutional Neural Networks with Complex Rational Spectral Filters","date":"2017-05-22","arxiv_id":"1705.07664","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cayleynets-graph-convolutional-neural#ran","syntology_url":"https://syntology.ai/paper/1705.07664","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.07664"}},"official":{"repos":["amoliu/CayleyNet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/preference-completion-large-scale","slug":"preference-completion-large-scale","title":"Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisons","date":"2015-07-16","arxiv_id":"1507.04457","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/preference-completion-large-scale#ran","syntology_url":"https://syntology.ai/paper/1507.04457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1507.04457"}},"official":null}},{"url":"/paper/matrix-completion-and-low-rank-svd-via-fast","slug":"matrix-completion-and-low-rank-svd-via-fast","title":"Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares","date":"2014-10-09","arxiv_id":"1410.2596","repositories_listed":5,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/matrix-completion-and-low-rank-svd-via-fast#ran","syntology_url":"https://syntology.ai/paper/1410.2596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1410.2596"}},"official":null}},{"url":"/paper/matrix-completion-from-noisy-entries","slug":"matrix-completion-from-noisy-entries","title":"Matrix Completion from Noisy Entries","date":"2009-06-11","arxiv_id":"0906.2027","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/matrix-completion-from-noisy-entries#ran","syntology_url":"https://syntology.ai/paper/0906.2027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"0906.2027"}},"official":null}}],"record_sha256":"b9fd7f42fed108bd2ff8b463bbac7b0b403ee932a948f4bbb91df6ff18d0ef37","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}