{"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/papers/2","list_of":"/task/low-rank-matrix-completion","task":"Low-Rank Matrix Completion","archive":{"snapshot":"2025-07-28"},"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)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":2,"rows_per_page":100,"rows":[101,158],"of":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"},"first_page":"/task/low-rank-matrix-completion","prev":"/task/low-rank-matrix-completion","next":null,"papers":[{"url":null,"slug":"exact-reconstruction-of-euclidean-distance","title":"Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-rank Matrix Completion","date":"2018-04-12","arxiv_id":"1804.04310","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-leave-one-out-approach-for-matrix","title":"Leave-one-out Approach for Matrix Completion: Primal and Dual Analysis","date":"2018-03-20","arxiv_id":"1803.07554","repositories_listed":0,"syntology":null},{"url":null,"slug":"static-and-dynamic-robust-pca-and-matrix","title":"Static and Dynamic Robust PCA and Matrix Completion: A Review","date":"2018-03-01","arxiv_id":"1803.00651","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-low-rank-matrix-completion-for","title":"Structured low-rank matrix completion for forecasting in time series analysis","date":"2018-02-22","arxiv_id":"1802.08242","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-latent-features-with-pairwise","title":"Learning Latent Features with Pairwise Penalties in Low-Rank Matrix Completion","date":"2018-02-16","arxiv_id":"1802.05821","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-deterministic-sampling-patterns-for-robust","title":"On Deterministic Sampling Patterns for Robust Low-Rank Matrix Completion","date":"2017-12-05","arxiv_id":"1712.01628","repositories_listed":0,"syntology":null},{"url":null,"slug":"implicit-regularization-in-nonconvex","title":"Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution","date":"2017-11-28","arxiv_id":"1711.10467","repositories_listed":0,"syntology":null},{"url":null,"slug":"background-subtraction-via-fast-robust-matrix","title":"Background Subtraction via Fast Robust Matrix Completion","date":"2017-11-03","arxiv_id":"1711.01218","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-low-rank-bayesian-matrix-completion-with","title":"Fast Low-Rank Bayesian Matrix Completion with Hierarchical Gaussian Prior Models","date":"2017-08-08","arxiv_id":"1708.02455","repositories_listed":0,"syntology":null},{"url":null,"slug":"nearly-optimal-robust-matrix-completion-1","title":"Nearly Optimal Robust Matrix Completion","date":"2017-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"reflection-removal-using-low-rank-matrix","title":"Reflection Removal Using Low-Rank Matrix Completion","date":"2017-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-riemannian-gossip-approach-to-subspace","title":"A Riemannian gossip approach to subspace learning on Grassmann manifold","date":"2017-05-01","arxiv_id":"1705.00467","repositories_listed":0,"syntology":null},{"url":null,"slug":"recovery-of-damped-exponentials-using","title":"Recovery of damped exponentials using structured low rank matrix completion","date":"2017-04-14","arxiv_id":"1704.04511","repositories_listed":0,"syntology":null},{"url":null,"slug":"novel-structured-low-rank-algorithm-to","title":"Novel Structured Low-rank algorithm to recover spatially smooth exponential image time series","date":"2017-03-29","arxiv_id":"1703.09880","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-stochastic-quasi-newton-algorithm","title":"Riemannian stochastic quasi-Newton algorithm with variance reduction and its convergence analysis","date":"2017-03-15","arxiv_id":"1703.04890","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-permutation-testing-in-voxel","title":"Accelerating Permutation Testing in Voxel-wise Analysis through Subspace Tracking: A new plugin for SnPM","date":"2017-03-04","arxiv_id":"1703.01506","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-uncalibrated-photometric-stereo-using","title":"Solving Uncalibrated Photometric Stereo Using Fewer Images by Jointly Optimizing Low-rank Matrix Completion and Integrability","date":"2017-02-02","arxiv_id":"1702.00506","repositories_listed":0,"syntology":null},{"url":null,"slug":"modelling-competitive-sports-bradley-terry","title":"Modelling Competitive Sports: Bradley-Terry-Élő Models for Supervised and On-Line Learning of Paired Competition Outcomes","date":"2017-01-27","arxiv_id":"1701.08055","repositories_listed":0,"syntology":null},{"url":null,"slug":"asynchronous-parallel-learning-for-neural","title":"Asynchronous Parallel Learning for Neural Networks and Structured Models with Dense Features","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"high-rank-matrix-completion-and-clustering","title":"High-Rank Matrix Completion and Clustering under Self-Expressive Models","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"low-tubal-rank-tensor-completion-using","title":"Low-tubal-rank Tensor Completion using Alternating Minimization","date":"2016-10-05","arxiv_id":"1610.01690","repositories_listed":0,"syntology":null},{"url":null,"slug":"nearly-optimal-robust-matrix-completion","title":"Nearly-optimal Robust Matrix Completion","date":"2016-06-23","arxiv_id":"1606.07315","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaled-stochastic-gradient-descent-for-low","title":"Scaled stochastic gradient descent for low-rank matrix completion","date":"2016-03-16","arxiv_id":"1603.04989","repositories_listed":0,"syntology":null},{"url":null,"slug":"secrets-of-matrix-factorization","title":"Secrets of Matrix Factorization: Approximations, Numerics, Manifold Optimization and Random Restarts","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"an-extended-frank-wolfe-method-with-in-face","title":"An Extended Frank-Wolfe Method with \"In-Face\" Directions, and its Application to Low-Rank Matrix Completion","date":"2015-11-06","arxiv_id":"1511.02204","repositories_listed":0,"syntology":null},{"url":null,"slug":"symmetric-tensor-completion-from-multilinear","title":"Symmetric Tensor Completion from Multilinear Entries and Learning Product Mixtures over the Hypercube","date":"2015-06-09","arxiv_id":"1506.03137","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-retraction-for-accelerating-the","title":"A New Retraction for Accelerating the Riemannian Three-Factor Low-Rank Matrix Completion Algorithm","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"analysis-of-nuclear-norm-regularization-for","title":"Relative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion","date":"2015-04-26","arxiv_id":"1504.06817","repositories_listed":0,"syntology":null},{"url":null,"slug":"relaxed-leverage-sampling-for-low-rank-matrix","title":"Relaxed Leverage Sampling for Low-rank Matrix Completion","date":"2015-03-22","arxiv_id":"1503.06379","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-matrix-completion-and-online-robust","title":"Online Matrix Completion and Online Robust PCA","date":"2015-03-11","arxiv_id":"1503.03525","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-characterization-of-deterministic-sampling","title":"A Characterization of Deterministic Sampling Patterns for Low-Rank Matrix Completion","date":"2015-03-09","arxiv_id":"1503.02596","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-matrix-completion-with-exponential","title":"Low Rank Matrix Completion with Exponential Family Noise","date":"2015-02-24","arxiv_id":"1502.06919","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-learning-for-low-rank-matrix","title":"Bayesian Learning for Low-Rank matrix reconstruction","date":"2015-01-23","arxiv_id":"1501.05740","repositories_listed":0,"syntology":null},{"url":null,"slug":"adjusting-leverage-scores-by-row-weighting-a","title":"Adjusting Leverage Scores by Row Weighting: A Practical Approach to Coherent Matrix Completion","date":"2014-12-26","arxiv_id":"1412.7938","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-low-rank-matrix-completion-on","title":"Probabilistic low-rank matrix completion on finite alphabets","date":"2014-12-08","arxiv_id":"1412.2632","repositories_listed":0,"syntology":null},{"url":null,"slug":"errata-distant-supervision-for-relation","title":"Errata: Distant Supervision for Relation Extraction with Matrix Completion","date":"2014-11-17","arxiv_id":"1411.4455","repositories_listed":0,"syntology":null},{"url":null,"slug":"ad-hoc-microphone-array-calibration-euclidean","title":"Ad Hoc Microphone Array Calibration: Euclidean Distance Matrix Completion Algorithm and Theoretical Guarantees","date":"2014-08-31","arxiv_id":"1409.0203","repositories_listed":0,"syntology":null},{"url":null,"slug":"algebraic-combinatorial-methods-for-low-rank","title":"Algebraic-Combinatorial Methods for Low-Rank Matrix Completion with Application to Athletic Performance Prediction","date":"2014-06-11","arxiv_id":"1406.2864","repositories_listed":0,"syntology":null},{"url":null,"slug":"depth-enhancement-via-low-rank-matrix","title":"Depth Enhancement via Low-rank Matrix Completion","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"advancing-matrix-completion-by-modeling-extra","title":"Advancing Matrix Completion by Modeling Extra Structures beyond Low-Rankness","date":"2014-04-17","arxiv_id":"1404.4646","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-matrix-completion","title":"Universal Matrix Completion","date":"2014-02-10","arxiv_id":"1402.2324","repositories_listed":0,"syntology":null},{"url":null,"slug":"phase-transitions-and-sample-complexity-in","title":"Phase transitions and sample complexity in Bayes-optimal matrix factorization","date":"2014-02-06","arxiv_id":"1402.1298","repositories_listed":0,"syntology":null},{"url":null,"slug":"error-minimizing-estimates-and-universal","title":"Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low-Rank Matrix Completion","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-low-rank-matrix-completion-with","title":"Probabilistic Low-Rank Matrix Completion with Adaptive Spectral Regularization Algorithms","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-spectral-learning-of-wcfg-as-low","title":"Unsupervised Spectral Learning of WCFG as Low-rank Matrix Completion","date":"2013-10-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"practical-matrix-completion-and-corruption","title":"Practical Matrix Completion and Corruption Recovery using Proximal Alternating Robust Subspace Minimization","date":"2013-09-06","arxiv_id":"1309.1539","repositories_listed":0,"syntology":null},{"url":null,"slug":"manopt-a-matlab-toolbox-for-optimization-on","title":"Manopt, a Matlab toolbox for optimization on manifolds","date":"2013-08-23","arxiv_id":"1308.5200","repositories_listed":0,"syntology":null},{"url":null,"slug":"r3mc-a-riemannian-three-factor-algorithm-for","title":"R3MC: A Riemannian three-factor algorithm for low-rank matrix completion","date":"2013-06-11","arxiv_id":"1306.2672","repositories_listed":0,"syntology":null},{"url":null,"slug":"obtaining-error-minimizing-estimates-and","title":"Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion","date":"2013-02-21","arxiv_id":"1302.5337","repositories_listed":0,"syntology":null},{"url":null,"slug":"coherence-and-sufficient-sampling-densities","title":"Coherence and sufficient sampling densities for reconstruction in compressed sensing","date":"2013-02-12","arxiv_id":"1302.2767","repositories_listed":0,"syntology":null},{"url":null,"slug":"scaled-gradients-on-grassmann-manifolds-for","title":"Scaled Gradients on Grassmann Manifolds for Matrix Completion","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"the-algebraic-combinatorial-approach-for-low","title":"The Algebraic Combinatorial Approach for Low-Rank Matrix Completion","date":"2012-11-17","arxiv_id":"1211.4116","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-rank-corrected-procedure-for-matrix","title":"A Rank-Corrected Procedure for Matrix Completion with Fixed Basis Coefficients","date":"2012-10-13","arxiv_id":"1210.3709","repositories_listed":0,"syntology":null},{"url":null,"slug":"fixed-rank-matrix-factorizations-and","title":"Fixed-rank matrix factorizations and Riemannian low-rank optimization","date":"2012-09-03","arxiv_id":"1209.0430","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-optimization-with-trace-norm-penalty","title":"Low-rank optimization with trace norm penalty","date":"2011-12-11","arxiv_id":"1112.2318","repositories_listed":0,"syntology":null},{"url":null,"slug":"rtrmc-a-riemannian-trust-region-method-for","title":"RTRMC: A Riemannian trust-region method for low-rank matrix completion","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nuclear-norm-penalization-and-optimal-rates","title":"Nuclear norm penalization and optimal rates for noisy low rank matrix completion","date":"2010-11-29","arxiv_id":"1011.6256","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-from-power-law-distributed","title":"Matrix Completion from Power-Law Distributed Samples","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"aa3d802cafefccd8d324ffb302159d61237d453378e2838fb491e8c8f6b0c080","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}