{"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/papers/6","list_of":"/task/matrix-completion","task":"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":6,"pages_in_order":8,"rows_per_page":100,"rows":[501,600],"of":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"},"first_page":"/task/matrix-completion","prev":"/task/matrix-completion/papers/5","next":"/task/matrix-completion/papers/7","papers":[{"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":"matrix-completion-from-non-uniformly-sampled","title":"Matrix Completion from Non-Uniformly Sampled Entries","date":"2018-06-27","arxiv_id":"1806.10308","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":"matrix-completion-and-performance-guarantees","title":"Matrix Completion and Performance Guarantees for Single Individual Haplotyping","date":"2018-06-13","arxiv_id":"1806.08647","repositories_listed":0,"syntology":null},{"url":null,"slug":"k-space-deep-learning-for-reference-free-epi","title":"k-Space Deep Learning for Reference-free EPI Ghost Correction","date":"2018-06-01","arxiv_id":"1806.00153","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonlinear-inductive-matrix-completion-based","title":"Nonlinear Inductive Matrix Completion based on One-layer Neural Networks","date":"2018-05-26","arxiv_id":"1805.10477","repositories_listed":0,"syntology":null},{"url":null,"slug":"randomized-robust-matrix-completion-for-the","title":"Scalable and Robust Community Detection with Randomized Sketching","date":"2018-05-25","arxiv_id":"1805.10927","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-co-completion-for-multi-label","title":"Matrix Co-completion for Multi-label Classification with Missing Features and Labels","date":"2018-05-23","arxiv_id":"1805.09156","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-projection-free","title":"Communication-Efficient Projection-Free Algorithm for Distributed Optimization","date":"2018-05-20","arxiv_id":"1805.07841","repositories_listed":0,"syntology":null},{"url":null,"slug":"transduction-with-matrix-completion-using","title":"Transduction with Matrix Completion Using Smoothed Rank Function","date":"2018-05-19","arxiv_id":"1805.07561","repositories_listed":0,"syntology":null},{"url":null,"slug":"projection-free-bandit-convex-optimization","title":"Projection-Free Bandit Convex Optimization","date":"2018-05-18","arxiv_id":"1805.07474","repositories_listed":0,"syntology":null},{"url":null,"slug":"extendable-neural-matrix-completion","title":"Extendable Neural Matrix Completion","date":"2018-05-13","arxiv_id":"1805.04912","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},{"url":null,"slug":"parametric-models-for-mutual-kernel-matrix","title":"Parametric Models for Mutual Kernel Matrix Completion","date":"2018-04-17","arxiv_id":"1804.06095","repositories_listed":0,"syntology":null},{"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":"multi-modal-disease-classification-in","title":"Multi-modal Disease Classification in Incomplete Datasets Using Geometric Matrix Completion","date":"2018-03-30","arxiv_id":"1803.11550","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-convex-matrix-completion-against-a-semi","title":"Non-Convex Matrix Completion Against a Semi-Random Adversary","date":"2018-03-28","arxiv_id":"1803.10846","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-graph-convolutional-neural-network","title":"Tensor graph convolutional neural network","date":"2018-03-27","arxiv_id":"1803.10071","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":"approximate-method-of-variational-bayesian","title":"Approximate Method of Variational Bayesian Matrix Factorization/Completion with Sparse Prior","date":"2018-03-14","arxiv_id":"1803.06234","repositories_listed":0,"syntology":null},{"url":null,"slug":"binary-matrix-completion-using-unobserved","title":"Binary Matrix Completion Using Unobserved Entries","date":"2018-03-13","arxiv_id":"1803.04663","repositories_listed":0,"syntology":null},{"url":null,"slug":"convolutional-geometric-matrix-completion","title":"Convolutional Geometric Matrix Completion","date":"2018-03-02","arxiv_id":"1803.00754","repositories_listed":0,"syntology":null},{"url":null,"slug":"random-perturbation-and-matrix-sparsification","title":"Matrices with Gaussian noise: optimal estimates for singular subspace perturbation","date":"2018-03-02","arxiv_id":"1803.00679","repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothed-analysis-for-low-rank-solutions-to","title":"Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form","date":"2018-03-01","arxiv_id":"1803.00186","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":"nonparametric-estimation-of-low-rank-matrix","title":"Nonparametric Estimation of Low Rank Matrix Valued Function","date":"2018-02-17","arxiv_id":"1802.06292","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":"active-feature-acquisition-with-supervised","title":"Active Feature Acquisition with Supervised Matrix Completion","date":"2018-02-15","arxiv_id":"1802.05380","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-sparse-inverse-covariance","title":"Large-Scale Sparse Inverse Covariance Estimation via Thresholding and Max-Det Matrix Completion","date":"2018-02-14","arxiv_id":"1802.04911","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-with-deterministic-pattern","title":"Matrix completion with deterministic pattern - a geometric perspective","date":"2018-01-31","arxiv_id":"1802.00047","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-for-structured-observations","title":"Matrix Completion for Structured Observations","date":"2018-01-29","arxiv_id":"1801.09657","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-with-nonconvex","title":"Matrix Completion with Nonconvex Regularization: Spectral Operators and Scalable Algorithms","date":"2018-01-24","arxiv_id":"1801.08227","repositories_listed":0,"syntology":null},{"url":null,"slug":"cayleynets-spectral-graph-cnns-with-complex","title":"CAYLEYNETS: SPECTRAL GRAPH CNNS WITH COMPLEX RATIONAL FILTERS","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-matrix-completion","title":"Differentially Private Matrix Completion Revisited","date":"2017-12-28","arxiv_id":"1712.09765","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":"a-new-theory-for-matrix-completion","title":"A New Theory for Matrix Completion","date":"2017-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"thy-friend-is-my-friend-iterative","title":"Thy Friend is My Friend: Iterative Collaborative Filtering for Sparse Matrix Estimation","date":"2017-12-01","arxiv_id":null,"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":"sparse-inverse-covariance-estimation-for","title":"Sparse Inverse Covariance Estimation for Chordal Structures","date":"2017-11-24","arxiv_id":"1711.09131","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-two-dimensional-decomposition-approach-for","title":"A two-dimensional decomposition approach for matrix completion through gossip","date":"2017-11-21","arxiv_id":"1711.07684","repositories_listed":0,"syntology":null},{"url":null,"slug":"memory-efficient-kernel-pca-via-partial","title":"Model-free Nonconvex Matrix Completion: Local Minima Analysis and Applications in Memory-efficient Kernel PCA","date":"2017-11-06","arxiv_id":"1711.01742","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":"sequential-matrix-completion","title":"Sequential Matrix Completion","date":"2017-10-23","arxiv_id":"1710.08045","repositories_listed":0,"syntology":null},{"url":null,"slug":"alternating-iteratively-reweighted","title":"Alternating Iteratively Reweighted Minimization Algorithms for Low-Rank Matrix Factorization","date":"2017-10-05","arxiv_id":"1710.02004","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-permutation-rank-matrices-structural","title":"Low Permutation-rank Matrices: Structural Properties and Noisy Completion","date":"2017-09-01","arxiv_id":"1709.00127","repositories_listed":0,"syntology":null},{"url":null,"slug":"noise-clustered-distant-supervision-for","title":"Noise-Clustered Distant Supervision for Relation Extraction: A Nonparametric Bayesian Perspective","date":"2017-09-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-task-clustering-for-deep-many-task","title":"Robust Task Clustering for Deep Many-Task Learning","date":"2017-08-26","arxiv_id":"1708.07918","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":"large-scale-low-rank-matrix-learning-with","title":"Large-Scale Low-Rank Matrix Learning with Nonconvex Regularizers","date":"2017-08-01","arxiv_id":"1708.00146","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":"efficient-low-rank-tensor-ring-completion","title":"Efficient Low Rank Tensor Ring Completion","date":"2017-07-23","arxiv_id":"1707.08184","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommendation-via-matrix-completion-using","title":"Recommendation via matrix completion using Kolmogorov complexity","date":"2017-07-19","arxiv_id":"1707.06055","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":"concentration-of-tempered-posteriors-and-of","title":"Concentration of tempered posteriors and of their variational approximations","date":"2017-06-28","arxiv_id":"1706.09293","repositories_listed":0,"syntology":null},{"url":null,"slug":"reexamining-low-rank-matrix-factorization-for","title":"Reexamining Low Rank Matrix Factorization for Trace Norm Regularization","date":"2017-06-27","arxiv_id":"1706.08934","repositories_listed":0,"syntology":null},{"url":null,"slug":"crowdsourcing-with-sparsely-interacting","title":"Crowdsourcing with Sparsely Interacting Workers","date":"2017-06-20","arxiv_id":"1706.06660","repositories_listed":0,"syntology":null},{"url":null,"slug":"empirical-bayes-matrix-completion","title":"Empirical Bayes Matrix Completion","date":"2017-06-05","arxiv_id":"1706.01252","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-non-monotone-alternating-updating-method","title":"A Non-monotone Alternating Updating Method for A Class of Matrix Factorization Problems","date":"2017-05-18","arxiv_id":"1705.06499","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-learning-of-drug-and-disease","title":"Representation learning of drug and disease terms for drug repositioning","date":"2017-05-15","arxiv_id":"1705.05183","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-via-factorizing-polynomials","title":"Matrix Completion via Factorizing Polynomials","date":"2017-05-04","arxiv_id":"1705.02047","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":"matrix-completion-with-queries","title":"Matrix completion with queries","date":"2017-05-01","arxiv_id":"1705.00399","repositories_listed":0,"syntology":null},{"url":null,"slug":"targeted-matrix-completion","title":"Targeted matrix completion","date":"2017-04-30","arxiv_id":"1705.00375","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-and-related-problems-via","title":"Matrix Completion and Related Problems via Strong Duality","date":"2017-04-27","arxiv_id":"1704.08683","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-low-rank-matrix-learning","title":"Structured low-rank matrix learning: algorithms and applications","date":"2017-04-24","arxiv_id":"1704.07352","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":"no-spurious-local-minima-in-nonconvex-low","title":"No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis","date":"2017-04-03","arxiv_id":"1704.00708","repositories_listed":0,"syntology":null},{"url":null,"slug":"fundamental-conditions-for-low-cp-rank-tensor","title":"Fundamental Conditions for Low-CP-Rank Tensor Completion","date":"2017-03-31","arxiv_id":"1703.10740","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":"spectrum-estimation-from-a-few-entries","title":"Spectrum Estimation from a Few Entries","date":"2017-03-18","arxiv_id":"1703.06327","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":"on-the-power-of-truncated-svd-for-general","title":"On the Power of Truncated SVD for General High-rank Matrix Estimation Problems","date":"2017-02-22","arxiv_id":"1702.06861","repositories_listed":0,"syntology":null},{"url":null,"slug":"exact-tensor-completion-with-sum-of-squares","title":"Exact tensor completion with sum-of-squares","date":"2017-02-21","arxiv_id":"1702.06237","repositories_listed":0,"syntology":null},{"url":null,"slug":"sar-semantic-analysis-for-recommendation","title":"SAR: Semantic Analysis for Recommendation","date":"2017-02-21","arxiv_id":"1702.06247","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-from-ambiguously-labeled-face-images","title":"Learning from Ambiguously Labeled Face Images","date":"2017-02-15","arxiv_id":"1702.04455","repositories_listed":0,"syntology":null},{"url":null,"slug":"mutual-kernel-matrix-completion","title":"Mutual Kernel Matrix Completion","date":"2017-02-14","arxiv_id":"1702.04077","repositories_listed":0,"syntology":null},{"url":null,"slug":"inductive-pairwise-ranking-going-beyond-the-n","title":"Inductive Pairwise Ranking: Going Beyond the n log(n) Barrier","date":"2017-02-09","arxiv_id":"1702.02661","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-from-on-samples-in-linear","title":"Matrix Completion from $O(n)$ Samples in Linear Time","date":"2017-02-08","arxiv_id":"1702.02267","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":"deterministic-and-probabilistic-conditions","title":"Deterministic and Probabilistic Conditions for Finite Completability of Low-rank Multi-View Data","date":"2017-01-03","arxiv_id":"1701.00737","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-frank-wolfe-algorithm-for","title":"Decentralized Frank-Wolfe Algorithm for Convex and Non-convex Problems","date":"2016-12-05","arxiv_id":"1612.01216","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-sparse-interactive-model-for-matrix","title":"A Sparse Interactive Model for Matrix Completion with Side Information","date":"2016-12-01","arxiv_id":null,"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":"blind-regression-nonparametric-regression-for","title":"Blind Regression: Nonparametric Regression for Latent Variable Models via Collaborative Filtering","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-representations-for-building","title":"Distributed Representations for Building Profiles of Users and Items from Text Reviews","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":"mistake-bounds-for-binary-matrix-completion","title":"Mistake Bounds for Binary Matrix Completion","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"noise-tolerant-life-long-matrix-completion","title":"Noise-Tolerant Life-Long Matrix Completion via Adaptive Sampling","date":"2016-12-01","arxiv_id":"1612.00100","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-convex-surrogate-for-the-schatten-p","title":"A Unified Convex Surrogate for the Schatten-$p$ Norm","date":"2016-11-25","arxiv_id":"1611.08372","repositories_listed":0,"syntology":null},{"url":null,"slug":"using-empirical-covariance-matrix-in","title":"Using Empirical Covariance Matrix in Enhancing Prediction Accuracy of Linear Models with Missing Information","date":"2016-11-21","arxiv_id":"1611.07093","repositories_listed":0,"syntology":null},{"url":null,"slug":"preference-completion-from-partial-rankings","title":"Preference Completion from Partial Rankings","date":"2016-11-14","arxiv_id":"1611.04218","repositories_listed":0,"syntology":null},{"url":null,"slug":"prognostics-of-surgical-site-infections-using","title":"Prognostics of Surgical Site Infections using Dynamic Health Data","date":"2016-11-12","arxiv_id":"1611.04049","repositories_listed":0,"syntology":null},{"url":null,"slug":"temporal-matrix-completion-with-locally","title":"Temporal Matrix Completion with Locally Linear Latent Factors for Medical Applications","date":"2016-10-31","arxiv_id":"1611.00800","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-matrix-recovery-from-incomplete","title":"Dynamic matrix recovery from incomplete observations under an exact low-rank constraint","date":"2016-10-28","arxiv_id":"1610.09420","repositories_listed":0,"syntology":null},{"url":null,"slug":"going-off-the-grid-iterative-model-selection","title":"Going off the Grid: Iterative Model Selection for Biclustered Matrix Completion","date":"2016-10-18","arxiv_id":"1610.05400","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-computational-and-statistical","title":"A Unified Computational and Statistical Framework for Nonconvex Low-Rank Matrix Estimation","date":"2016-10-17","arxiv_id":"1610.05275","repositories_listed":0,"syntology":null}],"record_sha256":"591166ccfeb766e5ac0df026788c8eebc55de195d0ff3f1f77aff9ee12df125e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}