{"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 (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":27,"of":27,"tagged_in_all":158,"items":[{"url":"/paper/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","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","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","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_unverified":1,"n_pointer_only":4}},{"url":"/paper/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","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","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_unverified":2,"n_pointer_only":3}},{"url":"/paper/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","title":"Teaching Arithmetic to Small Transformers","date":"2023-07-07","arxiv_id":"2307.03381","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":0}},{"url":"/paper/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","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","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","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_unverified":5,"n_pointer_only":5}},{"url":"/paper/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","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","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","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","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","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","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","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","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","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","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","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","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","title":"Guaranteed Rank Minimization via Singular Value Projection","date":"2009-09-30","arxiv_id":"0909.5457","repositories_listed":1,"syntology":null}],"syntology_records":4,"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"},"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-09-24T18:15:14+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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"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"}}