{"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/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 (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":8,"rows_per_page":100,"shown":100,"of":796,"of_with_code":153,"tagged_in_all":796,"counts":{"archive_papers_tagged":796,"with_a_code_link":153,"where_syntology_ran_a_sample":16,"not_listed_spam_title":0,"listed":796,"listed_where_code_ran":16,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":15,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":15,"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/graph-convolutional-matrix-completion","slug":"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","slug":"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":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/matrix-completion-and-low-rank-svd-via-fast#ran","syntology_url":"https://syntology.ai/paper/1410.2596","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1410.2596"}},"official":null}},{"url":"/paper/hybrid-recommender-system-based-on","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/inductive-graph-pattern-learning-for#ran","syntology_url":"https://syntology.ai/paper/1904.12058","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12058"}},"official":{"repos":["muhanzhang/IGMC"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-metric-learning-in-presence-of","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","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/a-regularized-deep-matrix-factorized-model-of","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/cayleynets-graph-convolutional-neural#ran","syntology_url":"https://syntology.ai/paper/1705.07664","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.07664"}},"official":{"repos":["amoliu/CayleyNet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/geometric-matrix-completion-with-recurrent","slug":"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","slug":"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","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/matrix-completion-on-graphs","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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},{"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/distributional-matrix-completion-via-nearest","slug":"distributional-matrix-completion-via-nearest","title":"Distributional Matrix Completion via Nearest Neighbors in the Wasserstein Space","date":"2024-10-17","arxiv_id":"2410.13112","repositories_listed":1,"syntology":null},{"url":"/paper/learning-counterfactual-distributions-via","slug":"learning-counterfactual-distributions-via","title":"Learning Counterfactual Distributions via Kernel Nearest Neighbors","date":"2024-10-17","arxiv_id":"2410.13381","repositories_listed":1,"syntology":null},{"url":"/paper/can-we-predict-performance-of-large-models","slug":"can-we-predict-performance-of-large-models","title":"Can We Predict Performance of Large Models across Vision-Language Tasks?","date":"2024-10-14","arxiv_id":"2410.10112","repositories_listed":1,"syntology":null},{"url":"/paper/predictive-low-rank-matrix-learning-under","slug":"predictive-low-rank-matrix-learning-under","title":"Predictive Low Rank Matrix Learning under Partial Observations: Mixed-Projection ADMM","date":"2024-07-18","arxiv_id":"2407.13731","repositories_listed":1,"syntology":null},{"url":"/paper/proximal-interacting-particle-langevin","slug":"proximal-interacting-particle-langevin","title":"Proximal Interacting Particle Langevin Algorithms","date":"2024-06-20","arxiv_id":"2406.14292","repositories_listed":1,"syntology":null},{"url":"/paper/balancing-molecular-information-and-empirical","slug":"balancing-molecular-information-and-empirical","title":"Balancing Molecular Information and Empirical Data in the Prediction of Physico-Chemical Properties","date":"2024-06-12","arxiv_id":"2406.08075","repositories_listed":1,"syntology":null},{"url":"/paper/structured-learning-of-compositional","slug":"structured-learning-of-compositional","title":"Structured Learning of Compositional Sequential Interventions","date":"2024-06-09","arxiv_id":"2406.05745","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-low-rank-approximation-for-policy","slug":"matrix-low-rank-approximation-for-policy","title":"Matrix Low-Rank Approximation For Policy Gradient Methods","date":"2024-05-27","arxiv_id":"2405.17626","repositories_listed":1,"syntology":null},{"url":"/paper/matrix-low-rank-trust-region-policy","slug":"matrix-low-rank-trust-region-policy","title":"Matrix Low-Rank Trust Region Policy Optimization","date":"2024-05-27","arxiv_id":"2405.17625","repositories_listed":1,"syntology":null},{"url":"/paper/projected-gradient-descent-for-spectral","slug":"projected-gradient-descent-for-spectral","title":"Projected Gradient Descent for Spectral Compressed Sensing via Symmetric Hankel Factorization","date":"2024-03-14","arxiv_id":"2403.09031","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/metaheuristic-algorithms-in-artificial","slug":"metaheuristic-algorithms-in-artificial","title":"Applications of Nature-Inspired Metaheuristic Algorithms for Tackling Optimization Problems Across Disciplines","date":"2023-08-08","arxiv_id":"2308.10875","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/matrix-tri-factorization-over-the-tropical","slug":"matrix-tri-factorization-over-the-tropical","title":"Matrix tri-factorization over the tropical semiring","date":"2023-05-11","arxiv_id":"2305.06624","repositories_listed":1,"syntology":null},{"url":"/paper/rotation-synchronization-via-deep-matrix","slug":"rotation-synchronization-via-deep-matrix","title":"Rotation Synchronization via Deep Matrix Factorization","date":"2023-05-09","arxiv_id":"2305.05268","repositories_listed":1,"syntology":null},{"url":"/paper/graph-signal-sampling-for-inductive-one-bit","slug":"graph-signal-sampling-for-inductive-one-bit","title":"Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution","date":"2023-02-08","arxiv_id":"2302.03933","repositories_listed":1,"syntology":{"n":10,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/graph-signal-sampling-for-inductive-one-bit#ran","syntology_url":"https://syntology.ai/paper/2302.03933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.03933"}},"official":{"repos":["cchao0116/GSIMC-ICLR2023"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":8,"ran_from_kinds":["official"]}}},{"url":"/paper/conditions-for-estimation-of-sensitivities-of","slug":"conditions-for-estimation-of-sensitivities-of","title":"Conditions for Estimation of Sensitivities of Voltage Magnitudes to Complex Power Injections","date":"2022-12-02","arxiv_id":"2212.01471","repositories_listed":1,"syntology":null},{"url":"/paper/doubly-robust-nearest-neighbors-in-factor","slug":"doubly-robust-nearest-neighbors-in-factor","title":"Doubly robust nearest neighbors in factor models","date":"2022-11-25","arxiv_id":"2211.14297","repositories_listed":1,"syntology":null},{"url":"/paper/multiple-imputation-with-neural-network","slug":"multiple-imputation-with-neural-network","title":"Multiple Imputation with Neural Network Gaussian Process for High-dimensional Incomplete Data","date":"2022-11-23","arxiv_id":"2211.13297","repositories_listed":1,"syntology":null},{"url":"/paper/a-generalized-latent-factor-model-approach-to","slug":"a-generalized-latent-factor-model-approach-to","title":"A Generalized Latent Factor Model Approach to Mixed-data Matrix Completion with Entrywise Consistency","date":"2022-11-17","arxiv_id":"2211.09272","repositories_listed":1,"syntology":null},{"url":"/paper/hyperparameter-optimization-in-deep-multi","slug":"hyperparameter-optimization-in-deep-multi","title":"Hyperparameter optimization in deep multi-target prediction","date":"2022-11-08","arxiv_id":"2211.04362","repositories_listed":1,"syntology":null},{"url":"/paper/bounded-simplex-structured-matrix","slug":"bounded-simplex-structured-matrix","title":"Bounded Simplex-Structured Matrix Factorization: Algorithms, Identifiability and Applications","date":"2022-09-26","arxiv_id":"2209.12638","repositories_listed":1,"syntology":null},{"url":"/paper/accelerating-sgd-for-highly-ill-conditioned","slug":"accelerating-sgd-for-highly-ill-conditioned","title":"Accelerating SGD for Highly Ill-Conditioned Huge-Scale Online Matrix Completion","date":"2022-08-24","arxiv_id":"2208.11246","repositories_listed":1,"syntology":null},{"url":"/paper/matrix-completion-with-cross-concentrated","slug":"matrix-completion-with-cross-concentrated","title":"Matrix Completion with Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling","date":"2022-08-20","arxiv_id":"2208.09723","repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-and-implicit-regularization-for","slug":"adaptive-and-implicit-regularization-for","title":"Adaptive and Implicit Regularization for Matrix Completion","date":"2022-08-11","arxiv_id":"2208.05640","repositories_listed":1,"syntology":null},{"url":"/paper/forecasting-algorithms-for-causal-inference","slug":"forecasting-algorithms-for-causal-inference","title":"Forecasting Algorithms for Causal Inference with Panel Data","date":"2022-08-06","arxiv_id":"2208.03489","repositories_listed":1,"syntology":null},{"url":"/paper/a-perturbation-bound-on-the-subspace","slug":"a-perturbation-bound-on-the-subspace","title":"A Perturbation Bound on the Subspace Estimator from Canonical Projections","date":"2022-06-28","arxiv_id":"2206.14278","repositories_listed":1,"syntology":null},{"url":"/paper/sampling-theorems-for-unsupervised-learning","slug":"sampling-theorems-for-unsupervised-learning","title":"Sensing Theorems for Unsupervised Learning in Linear Inverse Problems","date":"2022-03-23","arxiv_id":"2203.12513","repositories_listed":1,"syntology":null},{"url":"/paper/faster-one-sample-stochastic-conditional","slug":"faster-one-sample-stochastic-conditional","title":"Faster One-Sample Stochastic Conditional Gradient Method for Composite Convex Minimization","date":"2022-02-26","arxiv_id":"2202.13212","repositories_listed":1,"syntology":null},{"url":"/paper/indiscriminate-poisoning-attacks-on","slug":"indiscriminate-poisoning-attacks-on","title":"Indiscriminate Poisoning Attacks on Unsupervised Contrastive Learning","date":"2022-02-22","arxiv_id":"2202.11202","repositories_listed":1,"syntology":{"n":18,"n_ran":13,"n_constructed":5,"n_ran_checked":9,"n_instrument":4,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"13 ran (of which 5 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 4 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/indiscriminate-poisoning-attacks-on#ran","syntology_url":"https://syntology.ai/paper/2202.11202","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.11202"}},"official":{"repos":["kaiwenzha/contrastive-poisoning"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":5,"n_ran_no_instrument_failure":9,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/counterfactual-inference-for-sequential","slug":"counterfactual-inference-for-sequential","title":"Counterfactual inference for sequential experiments","date":"2022-02-14","arxiv_id":"2202.06891","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/counterfactual-inference-for-sequential#ran","syntology_url":"https://syntology.ai/paper/2202.06891","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.06891"}},"official":null}},{"url":"/paper/inductive-matrix-completion-no-bad-local","slug":"inductive-matrix-completion-no-bad-local","title":"Inductive Matrix Completion: No Bad Local Minima and a Fast Algorithm","date":"2022-01-31","arxiv_id":"2201.13052","repositories_listed":1,"syntology":null},{"url":"/paper/detecting-and-tracking-small-and-dense-moving","slug":"detecting-and-tracking-small-and-dense-moving","title":"Detecting and Tracking Small and Dense Moving Objects in Satellite Videos: A Benchmark","date":"2021-11-25","arxiv_id":"2111.12960","repositories_listed":1,"syntology":null},{"url":"/paper/nonnegative-tensor-completion-via-integer","slug":"nonnegative-tensor-completion-via-integer","title":"Nonnegative Tensor Completion via Integer Optimization","date":"2021-11-08","arxiv_id":"2111.04580","repositories_listed":1,"syntology":null},{"url":"/paper/warpd-a-linearly-convergent-first-order","slug":"warpd-a-linearly-convergent-first-order","title":"WARPd: A linearly convergent first-order method for inverse problems with approximate sharpness conditions","date":"2021-10-24","arxiv_id":"2110.12437","repositories_listed":1,"syntology":null},{"url":"/paper/causal-matrix-completion","slug":"causal-matrix-completion","title":"Causal Matrix Completion","date":"2021-09-30","arxiv_id":"2109.15154","repositories_listed":1,"syntology":null},{"url":"/paper/simple-fast-and-flexible-framework-for-matrix","slug":"simple-fast-and-flexible-framework-for-matrix","title":"Simple, Fast, and Flexible Framework for Matrix Completion with Infinite Width Neural Networks","date":"2021-07-31","arxiv_id":"2108.00131","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/low-rank-hankel-tensor-completion-for-traffic","slug":"low-rank-hankel-tensor-completion-for-traffic","title":"Low-Rank Hankel Tensor Completion for Traffic Speed Estimation","date":"2021-05-21","arxiv_id":"2105.11335","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-and-explainable-1-bit-matrix","slug":"scalable-and-explainable-1-bit-matrix","title":"Scalable and Explainable 1-Bit Matrix Completion via Graph Signal Learning","date":"2021-05-18","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/noisycur-an-algorithm-for-two-cost-budgeted","slug":"noisycur-an-algorithm-for-two-cost-budgeted","title":"NoisyCUR: An algorithm for two-cost budgeted matrix completion","date":"2021-04-16","arxiv_id":"2104.08026","repositories_listed":1,"syntology":null},{"url":"/paper/deep-permutation-equivariant-structure-from","slug":"deep-permutation-equivariant-structure-from","title":"Deep Permutation Equivariant Structure from Motion","date":"2021-04-14","arxiv_id":"2104.06703","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/deep-permutation-equivariant-structure-from#ran","syntology_url":"https://syntology.ai/paper/2104.06703","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.06703"}},"official":{"repos":["drormoran/Equivariant-SFM"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarially-trained-nonnegative-matrix","slug":"adversarially-trained-nonnegative-matrix","title":"Adversarially-Trained Nonnegative Matrix Factorization","date":"2021-04-10","arxiv_id":"2104.04757","repositories_listed":1,"syntology":null},{"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/a-neural-network-for-semigroups","slug":"a-neural-network-for-semigroups","title":"A Neural Network for Semigroups","date":"2021-03-12","arxiv_id":"2103.07388","repositories_listed":1,"syntology":null},{"url":"/paper/implicit-regularization-in-tensor","slug":"implicit-regularization-in-tensor","title":"Implicit Regularization in Tensor Factorization","date":"2021-02-19","arxiv_id":"2102.09972","repositories_listed":1,"syntology":null},{"url":"/paper/policy-augmentation-an-exploration-strategy","slug":"policy-augmentation-an-exploration-strategy","title":"Policy Augmentation: An Exploration Strategy for Faster Convergence of Deep Reinforcement Learning Algorithms","date":"2021-02-10","arxiv_id":"2102.05249","repositories_listed":1,"syntology":null},{"url":"/paper/unlabeled-principal-component-analysis","slug":"unlabeled-principal-component-analysis","title":"Unlabeled Principal Component Analysis and Matrix Completion","date":"2021-01-23","arxiv_id":"2101.09446","repositories_listed":1,"syntology":null},{"url":"/paper/outlier-robust-sparse-low-rank-least-squares","slug":"outlier-robust-sparse-low-rank-least-squares","title":"Outlier-robust sparse/low-rank least-squares regression and robust matrix completion","date":"2020-12-12","arxiv_id":"2012.06750","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/adversarial-crowdsourcing-through-robust-rank","slug":"adversarial-crowdsourcing-through-robust-rank","title":"Adversarial Crowdsourcing Through Robust Rank-One Matrix Completion","date":"2020-10-23","arxiv_id":"2010.12181","repositories_listed":1,"syntology":null},{"url":"/paper/an-inertial-block-majorization-minimization","slug":"an-inertial-block-majorization-minimization","title":"An Inertial Block Majorization Minimization Framework for Nonsmooth Nonconvex Optimization","date":"2020-10-23","arxiv_id":"2010.12133","repositories_listed":1,"syntology":null},{"url":"/paper/geometric-matrix-completion-a-functional-view","slug":"geometric-matrix-completion-a-functional-view","title":"Geometric Matrix Completion: A Functional View","date":"2020-09-29","arxiv_id":"2009.14343","repositories_listed":1,"syntology":null},{"url":"/paper/crosslingual-topic-modeling-with-wikipda","slug":"crosslingual-topic-modeling-with-wikipda","title":"Crosslingual Topic Modeling with WikiPDA","date":"2020-09-23","arxiv_id":"2009.11207","repositories_listed":1,"syntology":null},{"url":"/paper/deepvir-graphical-deep-matrix-factorization","slug":"deepvir-graphical-deep-matrix-factorization","title":"DeepVir -- Graphical Deep Matrix Factorization for \"In Silico\" Antiviral Repositioning: Application to COVID-19","date":"2020-09-22","arxiv_id":"2009.10333","repositories_listed":1,"syntology":null},{"url":"/paper/meta-learning-for-multi-variable-non-convex","slug":"meta-learning-for-multi-variable-non-convex","title":"Meta-learning based Alternating Minimization Algorithm for Non-convex Optimization","date":"2020-09-09","arxiv_id":"2009.04899","repositories_listed":1,"syntology":null},{"url":"/paper/efficient-model-based-collaborative-filtering","slug":"efficient-model-based-collaborative-filtering","title":"Efficient Model-Based Collaborative Filtering with Fast Adaptive PCA","date":"2020-09-04","arxiv_id":"2009.02251","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-relational-matrix-completion","slug":"inductive-relational-matrix-completion","title":"Towards Open-World Recommendation: An Inductive Model-based Collaborative Filtering Approach","date":"2020-07-09","arxiv_id":"2007.04833","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/inductive-relational-matrix-completion#ran","syntology_url":"https://syntology.ai/paper/2007.04833","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04833"}},"official":{"repos":["qitianwu/IDCF"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/partial-trace-regression-and-low-rank-kraus","slug":"partial-trace-regression-and-low-rank-kraus","title":"Partial Trace Regression and Low-Rank Kraus Decomposition","date":"2020-07-02","arxiv_id":"2007.00935","repositories_listed":1,"syntology":null},{"url":"/paper/simultaneous-imputation-and-disease","slug":"simultaneous-imputation-and-disease","title":"Simultaneous imputation and disease classification in incomplete medical datasets using Multigraph Geometric Matrix Completion (MGMC)","date":"2020-05-14","arxiv_id":"2005.06935","repositories_listed":1,"syntology":null},{"url":"/paper/implicit-regularization-in-deep-learning-may","slug":"implicit-regularization-in-deep-learning-may","title":"Implicit Regularization in Deep Learning May Not Be Explainable by Norms","date":"2020-05-13","arxiv_id":"2005.06398","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/deep-geometric-matrix-completion-are-we-doing-1","slug":"deep-geometric-matrix-completion-are-we-doing-1","title":"Spectral Geometric Matrix Completion","date":"2019-11-17","arxiv_id":"1911.07255","repositories_listed":1,"syntology":null},{"url":"/paper/missing-not-at-random-in-matrix-completion","slug":"missing-not-at-random-in-matrix-completion","title":"Missing Not at Random in Matrix Completion: The Effectiveness of Estimating Missingness Probabilities Under a Low Nuclear Norm Assumption","date":"2019-10-28","arxiv_id":"1910.12774","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}],"syntology_records":12,"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":16,"papers_where_code_ran_first_page":"/task/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":8,"url":"/task/matrix-completion/papers/2","json":"/task/matrix-completion/papers/2.json","rows":100},{"order":"archive","page":3,"of":8,"url":"/task/matrix-completion/papers/3","json":"/task/matrix-completion/papers/3.json","rows":100},{"order":"archive","page":4,"of":8,"url":"/task/matrix-completion/papers/4","json":"/task/matrix-completion/papers/4.json","rows":100},{"order":"archive","page":5,"of":8,"url":"/task/matrix-completion/papers/5","json":"/task/matrix-completion/papers/5.json","rows":100},{"order":"archive","page":6,"of":8,"url":"/task/matrix-completion/papers/6","json":"/task/matrix-completion/papers/6.json","rows":100},{"order":"archive","page":7,"of":8,"url":"/task/matrix-completion/papers/7","json":"/task/matrix-completion/papers/7.json","rows":100},{"order":"archive","page":8,"of":8,"url":"/task/matrix-completion/papers/8","json":"/task/matrix-completion/papers/8.json","rows":96},{"order":"ran","page":1,"of":1,"url":"/task/matrix-completion/papers/ran/1","json":"/task/matrix-completion/papers/ran/1.json","rows":16}],"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":"495b2ee82f67bf6bd39bcb87c7e24216ed45ae5a7052a3c27db42f34a390c23a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}