{"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/a-scalable-second-order-method-for-ill","title":"A Scalable Second Order Method for Ill-Conditioned Matrix Completion from Few Samples","arxiv_id":"2106.02119","date":"2021-06-03","proceeding":null,"authors":["Christian Kümmerle","Claudio Mayrink Verdun"],"abstract":"We propose an iterative algorithm for low-rank matrix completion that can be interpreted as an iteratively reweighted least squares (IRLS) algorithm, a saddle-escaping smoothing Newton method or a variable metric proximal gradient method applied to a non-convex rank surrogate. It combines the favorable data-efficiency of previous IRLS approaches with an improved scalability by several orders of magnitude. We establish the first local convergence guarantee from a minimal number of samples for that class of algorithms, showing that the method attains a local quadratic convergence rate. Furthermore, we show that the linear systems to be solved are well-conditioned even for very ill-conditioned ground truth matrices. We provide extensive experiments, indicating that unlike many state-of-the-art approaches, our method is able to complete very ill-conditioned matrices with a condition number of up to $10^{10}$ from few samples, while being competitive in its scalability.","url_abs":"https://arxiv.org/abs/2106.02119v1","url_pdf":"https://arxiv.org/pdf/2106.02119v1.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":"a-scalable-second-order-method-for-ill","repo_url":"https://github.com/ckuemmerle/MatrixIRLS","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"low-rank-matrix-completion","task_name":"Low-Rank Matrix Completion"},{"task_slug":"matrix-completion","task_name":"Matrix Completion"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2106.02119","atlas_url":"https://app.syntology.ai/?focus=2106.02119","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02119"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.02119"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.02119"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.02119\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2106.02119"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2106.02119\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2106.02119"},"call":"get_concepts_for_paper(arxiv_id=\"2106.02119\")"}],"by_repo":[{"repo":"ckuemmerle/MatrixIRLS","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"cpmusco/bksvd","kind":"found_in_text","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Jonathan-WIS/R2RILS","kind":"found_in_text","samples":5,"ran":0,"instrument":0,"unverified":5},{"repo":"Titan-Tong/Sca","kind":"found_in_text","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","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2106.02119.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2106.02119.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"deterministic:regex_extraction","url":"https://github.com/cpmusco/bksvd","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"deterministic:regex_extraction","url":"https://github.com/Jonathan-WIS/R2RILS","reach":null},{"provenance":"deterministic:regex_extraction","url":"https://github.com/Titan-Tong/Sca","reach":{"status":"gone","observed_at":"2026-09-17","how":"tree_404+repo_404"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ckuemmerle/MatrixIRLS","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":5},"n_samples":5,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":5,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"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)"},"by_repo_kind":{"found_in_text":{"samples":5,"ran":0,"n_ran_checked":0,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"official_not_harvested":{"repositories":["ckuemmerle/MatrixIRLS"],"harvested_for_other_papers":[0],"samples_from_other_repositories":5,"other_repositories":1,"samples_unlocated":0},"n_pointer_only_for_licence":5,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"samples":[{"code_sha256":"4ec5a35b892b0ca7","code_sha256_prefix":"4ec5a35b892b0ca7","entry":"R2RILS","repo":"jonathan-wis/r2rils","repo_kind":"found_in_text","path":"R2RILS.py","file_url":"https://github.com/jonathan-wis/r2rils/blob/HEAD/R2RILS.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jonathan-wis/r2rils when it was checked","mcp_get_code":{"code_sha256":"4ec5a35b892b0ca7"}},{"code_sha256":"7090f4c088caf9d8","code_sha256_prefix":"7090f4c088caf9d8","entry":"convert_x_representation","repo":"jonathan-wis/r2rils","repo_kind":"found_in_text","path":"R2RILS.py","file_url":"https://github.com/jonathan-wis/r2rils/blob/HEAD/R2RILS.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jonathan-wis/r2rils when it was checked","mcp_get_code":{"code_sha256":"7090f4c088caf9d8"}},{"code_sha256":"1564b5ffb0f30529","code_sha256_prefix":"1564b5ffb0f30529","entry":"generate_experiment_data","repo":"jonathan-wis/r2rils","repo_kind":"found_in_text","path":"R2RILS_Demo.py","file_url":"https://github.com/jonathan-wis/r2rils/blob/HEAD/R2RILS_Demo.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":"TIMEOUT","metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jonathan-wis/r2rils when it was checked","mcp_get_code":{"code_sha256":"1564b5ffb0f30529"}},{"code_sha256":"793d349c639035ba","code_sha256_prefix":"793d349c639035ba","entry":"generate_set_singular_values","repo":"jonathan-wis/r2rils","repo_kind":"found_in_text","path":"R2RILS_Demo.py","file_url":"https://github.com/jonathan-wis/r2rils/blob/HEAD/R2RILS_Demo.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jonathan-wis/r2rils when it was checked","mcp_get_code":{"code_sha256":"793d349c639035ba"}},{"code_sha256":"1c4a7475de2a78bf","code_sha256_prefix":"1c4a7475de2a78bf","entry":"rescale_A","repo":"jonathan-wis/r2rils","repo_kind":"found_in_text","path":"R2RILS.py","file_url":"https://github.com/jonathan-wis/r2rils/blob/HEAD/R2RILS.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jonathan-wis/r2rils when it was checked","mcp_get_code":{"code_sha256":"1c4a7475de2a78bf"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"429663b8ec7ebd68c04addddd4ebe4688b68ff611c64b1fe1c0aadac0dfa212b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}