Christian Kümmerle, Claudio Mayrink Verdun
None of the 5 samples (functions and classes) lifted from this paper's linked repositories has a recorded run on a synthesized input (5 no recorded run), measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2106.02119.json · badge: /api/ran/2106.02119.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| jonathan-wis/r2rils | reimplementation (classifier label) classifier basis: classifier_2025 |
0 ran · 5 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| R2RILS | Not yet run unverified (harvested, no recorded run) |
jonathan-wis/r2rils/R2RILS.py pointer only (licence: NONE) · get_code("4ec5a35b892b0ca7") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, jonathan-wis/r2rils when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
| convert_x_representation | Not yet run unverified (harvested, no recorded run) |
jonathan-wis/r2rils/R2RILS.py pointer only (licence: NONE) · get_code("7090f4c088caf9d8") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, jonathan-wis/r2rils when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
| generate_experiment_data | Not yet run unverified (harvested, no recorded run) |
jonathan-wis/r2rils/R2RILS_Demo.py pointer only (licence: NONE) · get_code("1564b5ffb0f30529") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, jonathan-wis/r2rils when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
| generate_set_singular_values | Not yet run unverified (harvested, no recorded run) |
jonathan-wis/r2rils/R2RILS_Demo.py pointer only (licence: NONE) · get_code("793d349c639035ba") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, jonathan-wis/r2rils when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
| rescale_A | Not yet run unverified (harvested, no recorded run) |
jonathan-wis/r2rils/R2RILS.py pointer only (licence: NONE) · get_code("1c4a7475de2a78bf") How it ranThe body of this sample is withheld: GitHub detected no licence in this paper's repository, jonathan-wis/r2rils when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded. |
Of 5 samples lifted from this paper's linked repositories, 5 carry a function identity and 0 do not. Of the 5 distinct functions with an identity, 3 are also present in other papers whose code we hold (3 with at least one paper dated earlier, 0 the same month, 0 later) and 2 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| R2RILS | 1 other paper 1 dated earlier |
2002.01849 (2020-02) Rank $2r$ iterative least squares: efficient recovery of ill-conditioned low rank matrices from few entries |
|
| convert_x_representation | 1 other paper 1 dated earlier |
2002.01849 (2020-02) Rank $2r$ iterative least squares: efficient recovery of ill-conditioned low rank matrices from few entries |
|
| rescale_A | 1 other paper 1 dated earlier |
2002.01849 (2020-02) Rank $2r$ iterative least squares: efficient recovery of ill-conditioned low rank matrices from few entries |
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
. 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. . I In different areas of machine learning and signal processing, low-rank models have turned out to be a powerful tool for the acquisition, storage and computation of information. In many of these applications, an important sub-problem is to infer the low-rank model from partial or incomplete data [DR , CLC ]. This problem is called low-rank matrix completion: Given a matrix X 0 ∈ ℝ 𝑑 1 ×𝑑 2 of rank-𝑟 and an index set Ω ⊂ [𝑑 1 ] × [𝑑 2 ], the task is to reconstruct X 0 just from the knowledge of Ω and 𝑃 Ω (X 0 ), where 𝑃 Ω : ℝ 𝑑 1 ×𝑑 2 → ℝ 𝑚 is the subsampling operator that maps a matrix to the set of entries indexed by Ω. It is well-known that this can be reformulated [RFP ] as the NP-hard rank minimization problem ( ) min From an optimization point of view, ( ) is particularly difficult to handle due to two properties: its non-convexity and its non-smoothness. A widely studied approach in the literature replaces the rank(X) by the (convex) nuclear norm X * = 𝑑 𝑖=1 𝜎 𝑖 (X) [FHB ], which is the tightest convex envelope of the rank, as an objective. For this approach, a mature theory has been developed that includes performance guarantees for a near-optimal sample complexity [CT , Che ] and robustness to noise [CP , CCF + ]. However, from a practical point of view, using such a convex relaxation to find a low-rank completion is computationally very demanding, as even first-order solvers have an per-iteration arithmetic complexity that is at least cubic in the dimensions of X 0 [CLC ]. Thus, convex relaxations are of little use in large-scale applications of the model such as in recommender systems [KBV ], where even storing the dense matrix X 0 ∈ ℝ 𝑑 1 ×𝑑 2 is prohibitive. Another
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2106.02119")
get_code_for_paper("2106.02119")
have("2106.02119")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2106.02119.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2106.02119)
Connect an agent — have() is free.