{"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/low-rank-matrix-completion","name":"Low-Rank Matrix Completion","slug":"low-rank-matrix-completion","description_markdown":"**Low-Rank Matrix Completion** is an important problem with several applications in areas such as recommendation systems, sketching, and quantum tomography. The goal in matrix completion is to recover a low rank matrix, given a small number of entries of the matrix.\n\n\n<span class=\"description-source\">Source: [Universal Matrix Completion ](https://arxiv.org/abs/1402.2324)</span>","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":158,"papers_with_code":27,"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":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/matrix-completion","name":"Matrix Completion"}],"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":2,"rows_per_page":100,"shown":100,"of":158,"of_with_code":27,"tagged_in_all":158,"counts":{"archive_papers_tagged":158,"with_a_code_link":27,"where_syntology_ran_a_sample":4,"not_listed_spam_title":0,"listed":158,"listed_where_code_ran":4,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":3,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":3,"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"},"items":[{"url":"/paper/escaping-saddle-points-in-ill-conditioned","slug":"escaping-saddle-points-in-ill-conditioned","title":"Escaping Saddle Points in Ill-Conditioned Matrix Completion with a Scalable Second Order Method","date":"2020-09-07","arxiv_id":"2009.02905","repositories_listed":2,"syntology":null},{"url":"/paper/collaborative-filtering-with-graph","slug":"collaborative-filtering-with-graph","title":"Collaborative Filtering with Graph Information: Consistency and Scalable Methods","date":"2015-12-01","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/efficient-and-robust-freeway-traffic-speed","slug":"efficient-and-robust-freeway-traffic-speed","title":"Efficient and Robust Freeway Traffic Speed Estimation under Oblique Grid using Vehicle Trajectory Data","date":"2024-11-06","arxiv_id":"2411.05842","repositories_listed":1,"syntology":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/efficient-minimum-bayes-risk-decoding-using","slug":"efficient-minimum-bayes-risk-decoding-using","title":"Efficient Minimum Bayes Risk Decoding using Low-Rank Matrix Completion Algorithms","date":"2024-06-05","arxiv_id":"2406.02832","repositories_listed":1,"syntology":null},{"url":"/paper/matrix-completion-with-convex-optimization","slug":"matrix-completion-with-convex-optimization","title":"Randomized Approach to Matrix Completion: Applications in Collaborative Filtering and Image Inpainting","date":"2024-03-04","arxiv_id":"2403.01919","repositories_listed":1,"syntology":null},{"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/efficient-compression-of-overparameterized","slug":"efficient-compression-of-overparameterized","title":"Efficient Compression of Overparameterized Deep Models through Low-Dimensional Learning Dynamics","date":"2023-11-08","arxiv_id":"2311.05061","repositories_listed":1,"syntology":null},{"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/guaranteed-tensor-recovery-fused-low-rankness","slug":"guaranteed-tensor-recovery-fused-low-rankness","title":"Guaranteed Tensor Recovery Fused Low-rankness and Smoothness","date":"2023-02-04","arxiv_id":"2302.02155","repositories_listed":1,"syntology":null},{"url":"/paper/generalized-nonconvex-approach-for-low-tubal","slug":"generalized-nonconvex-approach-for-low-tubal","title":"Generalized Nonconvex Approach for Low-Tubal-Rank Tensor Recovery","date":"2022-08-04","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/gnmr-a-provable-one-line-algorithm-for-low","slug":"gnmr-a-provable-one-line-algorithm-for-low","title":"GNMR: A provable one-line algorithm for low rank matrix recovery","date":"2021-06-24","arxiv_id":"2106.12933","repositories_listed":1,"syntology":null},{"url":"/paper/a-scalable-second-order-method-for-ill","slug":"a-scalable-second-order-method-for-ill","title":"A Scalable Second Order Method for Ill-Conditioned Matrix Completion from Few Samples","date":"2021-06-03","arxiv_id":"2106.02119","repositories_listed":1,"syntology":{"n":5,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"0 ran · 5 unverified","sample_list":"/paper/a-scalable-second-order-method-for-ill#ran","syntology_url":"https://syntology.ai/paper/2106.02119","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.02119"}},"official":{"repos":["ckuemmerle/MatrixIRLS"],"state":"official: not harvested","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":[]}}},{"url":"/paper/numerical-comparisons-between-bayesian-and","slug":"numerical-comparisons-between-bayesian-and","title":"Simulation comparisons between Bayesian and de-biased estimators in low-rank matrix completion","date":"2021-03-22","arxiv_id":"2103.11749","repositories_listed":1,"syntology":null},{"url":"/paper/mixed-membership-graph-clustering-via","slug":"mixed-membership-graph-clustering-via","title":"Mixed Membership Graph Clustering via Systematic Edge Query","date":"2020-11-25","arxiv_id":"2011.12988","repositories_listed":1,"syntology":null},{"url":"/paper/deep-generalization-of-structured-low-rank","slug":"deep-generalization-of-structured-low-rank","title":"Deep Generalization of Structured Low-Rank Algorithms (Deep-SLR)","date":"2019-12-07","arxiv_id":"1912.03433","repositories_listed":1,"syntology":null},{"url":"/paper/structured-low-rank-algorithms-theory-mr","slug":"structured-low-rank-algorithms-theory-mr","title":"Structured Low-Rank Algorithms: Theory, MR Applications, and Links to Machine Learning","date":"2019-10-27","arxiv_id":"1910.12162","repositories_listed":1,"syntology":null},{"url":"/paper/190411800","slug":"190411800","title":"Adaptive Matrix Completion for the Users and the Items in Tail","date":"2019-04-22","arxiv_id":"1904.11800","repositories_listed":1,"syntology":null},{"url":"/paper/subspace-tracking-from-missing-and-outlier","slug":"subspace-tracking-from-missing-and-outlier","title":"Provable Subspace Tracking from Missing Data and Matrix Completion","date":"2018-10-06","arxiv_id":"1810.03051","repositories_listed":1,"syntology":null},{"url":"/paper/algebraic-variety-models-for-high-rank-matrix","slug":"algebraic-variety-models-for-high-rank-matrix","title":"Algebraic Variety Models for High-Rank Matrix Completion","date":"2017-03-28","arxiv_id":"1703.09631","repositories_listed":1,"syntology":null},{"url":"/paper/riemannian-stochastic-variance-reduced-1","slug":"riemannian-stochastic-variance-reduced-1","title":"Riemannian stochastic variance reduced gradient algorithm with retraction and vector transport","date":"2017-02-18","arxiv_id":"1702.05594","repositories_listed":1,"syntology":null},{"url":"/paper/riemannian-stochastic-variance-reduced","slug":"riemannian-stochastic-variance-reduced","title":"Riemannian stochastic variance reduced gradient on Grassmann manifold","date":"2016-05-24","arxiv_id":"1605.07367","repositories_listed":1,"syntology":null},{"url":"/paper/depth-image-inpainting-improving-low-rank","slug":"depth-image-inpainting-improving-low-rank","title":"Depth Image Inpainting: Improving Low Rank Matrix Completion with Low Gradient Regularization","date":"2016-04-20","arxiv_id":"1604.05817","repositories_listed":1,"syntology":null},{"url":"/paper/distant-supervision-for-relation-extraction-4","slug":"distant-supervision-for-relation-extraction-4","title":"Distant Supervision for Relation Extraction with Matrix Completion","date":"2014-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/orthogonal-rank-one-matrix-pursuit-for-low","slug":"orthogonal-rank-one-matrix-pursuit-for-low","title":"Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion","date":"2014-04-04","arxiv_id":"1404.1377","repositories_listed":1,"syntology":null},{"url":"/paper/a-gradient-descent-algorithm-on-the-grassman","slug":"a-gradient-descent-algorithm-on-the-grassman","title":"A Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion","date":"2009-10-27","arxiv_id":"0910.5260","repositories_listed":1,"syntology":null},{"url":"/paper/guaranteed-rank-minimization-via-singular","slug":"guaranteed-rank-minimization-via-singular","title":"Guaranteed Rank Minimization via Singular Value Projection","date":"2009-09-30","arxiv_id":"0909.5457","repositories_listed":1,"syntology":null},{"url":null,"slug":"new-hardness-results-for-low-rank-matrix","title":"New Hardness Results for Low-Rank Matrix Completion","date":"2025-06-23","arxiv_id":"2506.18440","repositories_listed":0,"syntology":null},{"url":null,"slug":"altgdmin-alternating-gd-and-minimization-for","title":"AltGDmin: Alternating GD and Minimization for Partly-Decoupled (Federated) Optimization","date":"2025-04-20","arxiv_id":"2504.14741","repositories_listed":0,"syntology":null},{"url":null,"slug":"truncated-matrix-completion-an-empirical","title":"Truncated Matrix Completion - An Empirical Study","date":"2025-04-14","arxiv_id":"2504.09873","repositories_listed":0,"syntology":null},{"url":null,"slug":"norm-bounded-low-rank-adaptation","title":"Norm-Bounded Low-Rank Adaptation","date":"2025-01-31","arxiv_id":"2501.19050","repositories_listed":0,"syntology":null},{"url":null,"slug":"faster-convergence-of-riemannian-stochastic","title":"Faster Convergence of Riemannian Stochastic Gradient Descent with Increasing Batch Size","date":"2025-01-30","arxiv_id":"2501.18164","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-matrix-completion-and-realization-of","title":"Low rank matrix completion and realization of graphs: results and problems","date":"2025-01-10","arxiv_id":"2501.13935","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-privacy-preserving-distributed-credible","title":"A privacy-preserving distributed credible evidence fusion algorithm for collective decision-making","date":"2024-12-03","arxiv_id":"2412.02130","repositories_listed":0,"syntology":null},{"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":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 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":null,"slug":"riemannian-optimization-for-non-convex","title":"Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees","date":"2024-10-08","arxiv_id":"2410.06376","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-singular-value-decomposition","title":"Decentralized Singular Value Decomposition for Large-scale Distributed Sensor Networks","date":"2024-08-26","arxiv_id":"2408.14292","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-matrix-completion-a-collaborative","title":"Online Matrix Completion: A Collaborative Approach with Hott Items","date":"2024-08-11","arxiv_id":"2408.05843","repositories_listed":0,"syntology":null},{"url":null,"slug":"leave-one-out-analysis-for-nonconvex-robust","title":"Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions","date":"2024-07-28","arxiv_id":"2407.19446","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-low-rank-matrix-completion-model","title":"Generalized Low-Rank Matrix Completion Model with Overlapping Group Error Representation","date":"2024-07-11","arxiv_id":"2407.08517","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonconvex-federated-learning-on-compact","title":"Nonconvex Federated Learning on Compact Smooth Submanifolds With Heterogeneous Data","date":"2024-06-12","arxiv_id":"2406.08465","repositories_listed":0,"syntology":null},{"url":null,"slug":"symmetric-matrix-completion-with-relu","title":"Symmetric Matrix Completion with ReLU Sampling","date":"2024-06-09","arxiv_id":"2406.05822","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-federated-low-rank-matrix","title":"Efficient Federated Low Rank Matrix Completion","date":"2024-05-10","arxiv_id":"2405.06569","repositories_listed":0,"syntology":null},{"url":null,"slug":"discrete-aware-matrix-completion-via","title":"Discrete Aware Matrix Completion via Convexized $\\ell_0$-Norm Approximation","date":"2024-05-03","arxiv_id":"2405.02101","repositories_listed":0,"syntology":null},{"url":null,"slug":"entry-specific-bounds-for-low-rank-matrix","title":"Entry-Specific Bounds for Low-Rank Matrix Completion under Highly Non-Uniform Sampling","date":"2024-02-29","arxiv_id":"2403.00184","repositories_listed":0,"syntology":null},{"url":null,"slug":"effect-of-beampattern-on-matrix-completion","title":"Effect of Beampattern on Matrix Completion with Sparse Arrays","date":"2024-01-12","arxiv_id":"2401.06494","repositories_listed":0,"syntology":null},{"url":null,"slug":"harmonic-retrieval-using-weighted-lifted","title":"Harmonic Retrieval Using Weighted Lifted-Structure Low-Rank Matrix Completion","date":"2023-11-08","arxiv_id":"2311.05003","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-framework-to-generate-sparsity-inducing","title":"A framework to generate sparsity-inducing regularizers for enhanced low-rank matrix completion","date":"2023-10-08","arxiv_id":"2310.04954","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-low-rank-matrix-completion-via-a-new","title":"Robust Low-Rank Matrix Completion via a New Sparsity-Inducing Regularizer","date":"2023-10-07","arxiv_id":"2310.04762","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-in-almost-verification-time","title":"Matrix Completion in Almost-Verification Time","date":"2023-08-07","arxiv_id":"2308.03661","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-based-system-representations-from","title":"Data-based system representations from irregularly measured data","date":"2023-07-21","arxiv_id":"2307.11589","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-convex-optimizations-for-machine-learning","title":"Non-Convex Optimizations for Machine Learning with Theoretical Guarantee: Robust Matrix Completion and Neural Network Learning","date":"2023-06-28","arxiv_id":"2306.16557","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-based-matrix-completion-applied-to","title":"Graph-Based Matrix Completion Applied to Weather Data","date":"2023-06-14","arxiv_id":"2306.08627","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-alternating-minimization-with","title":"Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation","date":"2023-06-07","arxiv_id":"2306.04169","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-from-general-deterministic","title":"Matrix Completion from General Deterministic Sampling Patterns","date":"2023-06-04","arxiv_id":"2306.02283","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-spectral-embedding-and-matrix","title":"Spectal Harmonics: Bridging Spectral Embedding and Matrix Completion in Self-Supervised Learning","date":"2023-05-31","arxiv_id":"2305.19818","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-low-rank-matrix-completion","title":"Disjunctive Branch-And-Bound for Certifiably Optimal Low-Rank Matrix Completion","date":"2023-05-20","arxiv_id":"2305.12292","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-majorization-minimization-gauss-newton","title":"A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion","date":"2023-04-27","arxiv_id":"2304.13940","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-matrix-completion-via-robust","title":"Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time","date":"2023-02-21","arxiv_id":"2302.11068","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-transition-operators-from-sparse","title":"Learning Transition Operators From Sparse Space-Time Samples","date":"2022-12-01","arxiv_id":"2212.00746","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-covariance-completion-for-graph","title":"Low-Rank Covariance Completion for Graph Quilting with Applications to Functional Connectivity","date":"2022-09-17","arxiv_id":"2209.08273","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-low-rank-matrix-completion","title":"Online Low Rank Matrix Completion","date":"2022-09-08","arxiv_id":"2209.03997","repositories_listed":0,"syntology":null},{"url":null,"slug":"introducing-the-huber-mechanism-for","title":"Introducing the Huber mechanism for differentially private low-rank matrix completion","date":"2022-06-16","arxiv_id":"2206.07910","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-matrix-completion-with-heavy-tailed","title":"Robust Matrix Completion with Heavy-tailed Noise","date":"2022-06-09","arxiv_id":"2206.04276","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-low-rank-matrix-completion-with-dual","title":"Bayesian Low-rank Matrix Completion with Dual-graph Embedding: Prior Analysis and Tuning-free Inference","date":"2022-03-18","arxiv_id":"2203.10044","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-noisy-matrix-completion","title":"Adaptive Noisy Matrix Completion","date":"2022-03-16","arxiv_id":"2203.08340","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-statistical-estimation-under","title":"High Dimensional Statistical Estimation under Uniformly Dithered One-bit Quantization","date":"2022-02-26","arxiv_id":"2202.13157","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-bayesian-filtering-with-subspace","title":"Variational Bayesian Filtering with Subspace Information for Extreme Spatio-Temporal Matrix Completion","date":"2022-01-20","arxiv_id":"2201.08307","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":"uncertainty-quantification-for-low-rank","title":"Uncertainty Quantification For Low-Rank Matrix Completion With Heterogeneous and Sub-Exponential Noise","date":"2021-10-22","arxiv_id":"2110.12046","repositories_listed":0,"syntology":null},{"url":null,"slug":"reconstruction-of-fragmented-trajectories-of","title":"Reconstruction of Fragmented Trajectories of Collective Motion using Hadamard Deep Autoencoders","date":"2021-10-20","arxiv_id":"2110.10428","repositories_listed":0,"syntology":null},{"url":null,"slug":"weighted-low-rank-matrix-approximation-and","title":"Weighted Low Rank Matrix Approximation and Acceleration","date":"2021-09-22","arxiv_id":"2109.11057","repositories_listed":0,"syntology":null},{"url":null,"slug":"reproducing-kernel-hilbert-space-mercer-s","title":"Reproducing Kernel Hilbert Space, Mercer's Theorem, Eigenfunctions, Nyström Method, and Use of Kernels in Machine Learning: Tutorial and Survey","date":"2021-06-15","arxiv_id":"2106.08443","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-pre-training-oracle-for-predicting","title":"A Pre-training Oracle for Predicting Distances in Social Networks","date":"2021-06-06","arxiv_id":"2106.03233","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learned-svt-unrolling-singular-value","title":"Deep learned SVT: Unrolling singular value thresholding to obtain better MSE","date":"2021-05-14","arxiv_id":"2105.06934","repositories_listed":0,"syntology":null},{"url":null,"slug":"structure-preserving-progressive-low-rank","title":"Structure-Preserving Progressive Low-rank Image Completion for Defending Adversarial Attacks","date":"2021-03-04","arxiv_id":"2103.02781","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-linear-convergence-rate-analysis-for","title":"Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix Completion via Gradient Descent","date":"2021-02-04","arxiv_id":"2102.02396","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-array-beamformer-design-for-active-and","title":"Sparse Array Beamformer Design for Active and Passive Sensing","date":"2021-01-18","arxiv_id":"2101.06816","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":"robust-low-rank-matrix-completion-via-an","title":"Robust Low-rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method","date":"2020-08-18","arxiv_id":"2008.07740","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-low-rank-matrix-learning-by","title":"A Scalable, Adaptive and Sound Nonconvex Regularizer for Low-rank Matrix Completion","date":"2020-08-14","arxiv_id":"2008.06542","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-stochastic-proximal-gradient","title":"Riemannian Stochastic Proximal Gradient Methods for Nonsmooth Optimization over the Stiefel Manifold","date":"2020-05-03","arxiv_id":"2005.01209","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-exposition-to-the-finiteness-of-fibers-in","title":"Low-rank matrix completion theory via Plucker coordinates","date":"2020-04-26","arxiv_id":"2004.12430","repositories_listed":0,"syntology":null},{"url":null,"slug":"bounded-manifold-completion","title":"Bounded Manifold Completion","date":"2019-12-19","arxiv_id":"1912.09026","repositories_listed":0,"syntology":null},{"url":null,"slug":"factor-group-sparse-regularization-for-1","title":"Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery","date":"2019-11-13","arxiv_id":"1911.05774","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-sparse-reverse-of-principal-component","title":"The Sparse Reverse of Principal Component Analysis for Fast Low-Rank Matrix Completion","date":"2019-10-04","arxiv_id":"1910.02155","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-matrix-completion-and-denoising","title":"Low-rank matrix completion and denoising under Poisson noise","date":"2019-07-11","arxiv_id":"1907.05325","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-divide-and-conquer-algorithm-for-binary","title":"A divide-and-conquer algorithm for binary matrix completion","date":"2019-07-09","arxiv_id":"1907.04251","repositories_listed":0,"syntology":null},{"url":null,"slug":"depth-restoration-a-fast-low-rank-matrix","title":"Depth Restoration: A fast low-rank matrix completion via dual-graph regularization","date":"2019-07-05","arxiv_id":"1907.02841","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficiently-escaping-saddle-points-on","title":"Efficiently escaping saddle points on manifolds","date":"2019-06-10","arxiv_id":"1906.04321","repositories_listed":0,"syntology":null},{"url":null,"slug":"guaranteed-matrix-completion-under-multiple","title":"Guaranteed Matrix Completion Under Multiple Linear Transformations","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-approximation-from-communication","title":"Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation","date":"2019-04-22","arxiv_id":"1904.09841","repositories_listed":0,"syntology":null},{"url":null,"slug":"noisy-matrix-completion-understanding","title":"Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization","date":"2019-02-20","arxiv_id":"1902.07698","repositories_listed":0,"syntology":null},{"url":null,"slug":"double-weighted-truncated-nuclear-norm","title":"Double Weighted Truncated Nuclear Norm Regularization for Low-Rank Matrix Completion","date":"2019-01-07","arxiv_id":"1901.01711","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-parallel-algorithms","title":"Communication Efficient Parallel Algorithms for Optimization on Manifolds","date":"2018-10-26","arxiv_id":"1810.11155","repositories_listed":0,"syntology":null},{"url":null,"slug":"fusion-subspace-clustering-full-and","title":"Fusion Subspace Clustering: Full and Incomplete Data","date":"2018-08-02","arxiv_id":"1808.00628","repositories_listed":0,"syntology":null},{"url":null,"slug":"implicit-regularization-in-nonconvex-1","title":"Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval and Matrix Completion","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-recovery-from-limited-comparisons","title":"Ranking Recovery from Limited Comparisons using Low-Rank Matrix Completion","date":"2018-06-14","arxiv_id":"1806.05419","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-group-inductive-matrix-completion","title":"Sparse Group Inductive Matrix Completion","date":"2018-04-27","arxiv_id":"1804.10653","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-methods-for-nonlinear-matrix","title":"Tensor Methods for Nonlinear Matrix Completion","date":"2018-04-26","arxiv_id":"1804.10266","repositories_listed":0,"syntology":null}],"syntology_records":5,"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":4,"papers_where_code_ran_first_page":"/task/low-rank-matrix-completion/papers/ran/1","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":[{"order":"archive","page":2,"of":2,"url":"/task/low-rank-matrix-completion/papers/2","json":"/task/low-rank-matrix-completion/papers/2.json","rows":58},{"order":"ran","page":1,"of":1,"url":"/task/low-rank-matrix-completion/papers/ran/1","json":"/task/low-rank-matrix-completion/papers/ran/1.json","rows":4}],"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":"73aa0662d9620a317d6f32a2df1bc0247f62cc4f29273c5246dd539ca3f6b63b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}