{"url":"/task/matrix-completion","name":"Matrix Completion","slug":"matrix-completion","description_markdown":"**Matrix Completion** is a method for recovering lost information. It originates from machine learning and usually deals with highly sparse matrices. Missing or unknown data is estimated using the low-rank matrix of the known data.\n\n\n<span class=\"description-source\">Source: [A Fast Matrix-Completion-Based Approach for Recommendation Systems ](https://arxiv.org/abs/1912.00600)</span>","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":796,"papers_with_code":153,"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":4,"subtasks":1,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/netflix-prize","name":"Netflix Prize","full_name":"Netflix Prize","num_papers_in_archive":370},{"url":"/dataset/cal500","name":"CAL500","full_name":"Computer Audition Lab 500","num_papers_in_archive":21},{"url":"/dataset/savoias","name":"SAVOIAS","full_name":"","num_papers_in_archive":2},{"url":"/dataset/sweetrs","name":"SweetRS","full_name":"","num_papers_in_archive":2}],"subtasks":[{"url":"/task/low-rank-matrix-completion","name":"Low-Rank Matrix Completion"}],"parent_tasks":[],"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":30,"of":153,"tagged_in_all":796,"items":[{"url":"/paper/graph-convolutional-matrix-completion","title":"Graph Convolutional Matrix Completion","date":"2017-06-07","arxiv_id":"1706.02263","repositories_listed":17,"syntology":null},{"url":"/paper/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":0,"n_unverified":9,"n_pointer_only":0}},{"url":"/paper/hybrid-recommender-system-based-on","title":"Hybrid Recommender System based on Autoencoders","date":"2016-06-24","arxiv_id":"1606.07659","repositories_listed":4,"syntology":null},{"url":"/paper/glocal-k-global-and-local-kernels-for","title":"GLocal-K: Global and Local Kernels for Recommender Systems","date":"2021-08-27","arxiv_id":"2108.12184","repositories_listed":3,"syntology":null},{"url":"/paper/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_unverified":1,"n_pointer_only":2}},{"url":"/paper/unsupervised-metric-learning-in-presence-of","title":"Unsupervised Metric Learning in Presence of Missing Data","date":"2018-07-19","arxiv_id":"1807.07610","repositories_listed":3,"syntology":null},{"url":"/paper/sequence-aware-recommender-systems","title":"Sequence-Aware Recommender Systems","date":"2018-02-23","arxiv_id":"1802.08452","repositories_listed":3,"syntology":null},{"url":"/paper/an-exact-and-robust-conformal-inference","title":"An Exact and Robust Conformal Inference Method for Counterfactual and Synthetic Controls","date":"2017-12-25","arxiv_id":"1712.09089","repositories_listed":3,"syntology":null},{"url":"/paper/estimating-missing-data-in-temporal-data","title":"Estimating Missing Data in Temporal Data Streams Using Multi-directional Recurrent Neural Networks","date":"2017-11-23","arxiv_id":"1711.08742","repositories_listed":3,"syntology":null},{"url":"/paper/air-net-adaptive-and-implicit-regularization-1","title":"AIR-Net: Adaptive and Implicit Regularization Neural Network for Matrix Completion","date":"2021-10-12","arxiv_id":"2110.07557","repositories_listed":2,"syntology":null},{"url":"/paper/inductive-matrix-completion-using-graph","title":"Inductive Matrix Completion Using Graph Autoencoder","date":"2021-08-25","arxiv_id":"2108.11124","repositories_listed":2,"syntology":null},{"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/a-regularized-deep-matrix-factorized-model-of","title":"A regularized deep matrix factorized model of matrix completion for image restoration","date":"2020-07-29","arxiv_id":"2007.14581","repositories_listed":2,"syntology":null},{"url":"/paper/compressed-sensing-of-low-rank-plus-sparse","title":"Compressed sensing of low-rank plus sparse matrices","date":"2020-07-18","arxiv_id":"2007.09457","repositories_listed":2,"syntology":null},{"url":"/paper/matrix-completion-with-quantified-uncertainty","title":"Matrix Completion with Quantified Uncertainty through Low Rank Gaussian Copula","date":"2020-06-18","arxiv_id":"2006.10829","repositories_listed":2,"syntology":null},{"url":"/paper/accelerating-ill-conditioned-low-rank-matrix","title":"Accelerating Ill-Conditioned Low-Rank Matrix Estimation via Scaled Gradient Descent","date":"2020-05-18","arxiv_id":"2005.08898","repositories_listed":2,"syntology":null},{"url":"/paper/indian-regional-movie-dataset-for-recommender","title":"Indian Regional Movie Dataset for Recommender Systems","date":"2018-01-07","arxiv_id":"1801.02203","repositories_listed":2,"syntology":null},{"url":"/paper/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_unverified":0,"n_pointer_only":3}},{"url":"/paper/geometric-matrix-completion-with-recurrent","title":"Geometric Matrix Completion with Recurrent Multi-Graph Neural Networks","date":"2017-04-22","arxiv_id":"1704.06803","repositories_listed":2,"syntology":null},{"url":"/paper/low-rank-inducing-norms-with-optimality","title":"Low-Rank Inducing Norms with Optimality Interpretations","date":"2016-12-09","arxiv_id":"1612.03186","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/matrix-completion-on-graphs","title":"Matrix Completion on Graphs","date":"2014-08-07","arxiv_id":"1408.1717","repositories_listed":2,"syntology":null},{"url":"/paper/contrastive-matrix-completion-with-denoising","title":"Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation","date":"2025-06-12","arxiv_id":"2506.10658","repositories_listed":1,"syntology":null},{"url":"/paper/n-2-a-unified-python-package-and-test-bench","title":"N$^2$: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix Completion","date":"2025-06-04","arxiv_id":"2506.04166","repositories_listed":1,"syntology":null},{"url":"/paper/adaptively-weighted-nearest-neighbors-for","title":"Adaptively-weighted Nearest Neighbors for Matrix Completion","date":"2025-05-14","arxiv_id":"2505.09612","repositories_listed":1,"syntology":null},{"url":"/paper/an-extrapolated-and-provably-convergent","title":"An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function","date":"2025-03-31","arxiv_id":"2503.23832","repositories_listed":1,"syntology":null},{"url":"/paper/interference-aware-edge-runtime-prediction","title":"Interference-Aware Edge Runtime Prediction with Conformal Matrix Completion","date":"2025-03-09","arxiv_id":"2503.06428","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-over-parameterized-matrix-sensing","title":"Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient Descent","date":"2025-02-01","arxiv_id":"2502.00463","repositories_listed":1,"syntology":null},{"url":"/paper/robust-matrix-completion-for-discrete-rating","title":"Robust Matrix Completion for Discrete Rating-Scale Data","date":"2024-12-30","arxiv_id":"2412.20802","repositories_listed":1,"syntology":null},{"url":"/paper/on-adaptivity-and-minimax-optimality-of-two","title":"On adaptivity and minimax optimality of two-sided nearest neighbors","date":"2024-11-20","arxiv_id":"2411.12965","repositories_listed":1,"syntology":null}],"syntology_records":3,"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"}}