{"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/8","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":8,"pages_in_order":8,"rows_per_page":100,"rows":[701,796],"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/7","next":null,"papers":[{"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":"consistent-collective-matrix-completion-under","title":"Consistent Collective Matrix Completion under Joint Low Rank Structure","date":"2014-12-05","arxiv_id":"1412.2113","repositories_listed":0,"syntology":null},{"url":null,"slug":"deterministic-symmetric-positive-semidefinite","title":"Deterministic Symmetric Positive Semidefinite Matrix Completion","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-optimization-for-max-norm","title":"Online Optimization for Max-Norm Regularization","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-k-support-norm-regularization","title":"Spectral k-Support Norm Regularization","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"guaranteed-matrix-completion-via-non-convex","title":"Guaranteed Matrix Completion via Non-convex Factorization","date":"2014-11-28","arxiv_id":"1411.8003","repositories_listed":0,"syntology":null},{"url":null,"slug":"signal-recovery-on-graphs-variation","title":"Signal Recovery on Graphs: Variation Minimization","date":"2014-11-26","arxiv_id":"1411.7414","repositories_listed":0,"syntology":null},{"url":null,"slug":"characterization-of-the-equivalence-of","title":"Characterization of the equivalence of robustification and regularization in linear and matrix regression","date":"2014-11-22","arxiv_id":"1411.6160","repositories_listed":0,"syntology":null},{"url":null,"slug":"pu-learning-for-matrix-completion","title":"PU Learning for Matrix Completion","date":"2014-11-22","arxiv_id":"1411.6081","repositories_listed":0,"syntology":null},{"url":null,"slug":"maximum-entropy-kernels-for-system","title":"Maximum Entropy Kernels for System Identification","date":"2014-11-20","arxiv_id":"1411.5620","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":"global-convergence-of-stochastic-gradient-1","title":"Global Convergence of Stochastic Gradient Descent for Some Non-convex Matrix Problems","date":"2014-11-05","arxiv_id":"1411.1134","repositories_listed":0,"syntology":null},{"url":null,"slug":"cur-algorithm-for-partially-observed-matrices","title":"CUR Algorithm for Partially Observed Matrices","date":"2014-11-04","arxiv_id":"1411.0860","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-exact-matrix-completion-with-finite","title":"Fast Exact Matrix Completion with Finite Samples","date":"2014-11-04","arxiv_id":"1411.1087","repositories_listed":0,"syntology":null},{"url":null,"slug":"noisy-matrix-completion-under-sparse-factor","title":"Noisy Matrix Completion under Sparse Factor Models","date":"2014-11-02","arxiv_id":"1411.0282","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-conditional-gradient-for-sparse","title":"Generalized Conditional Gradient for Sparse Estimation","date":"2014-10-17","arxiv_id":"1410.4828","repositories_listed":0,"syntology":null},{"url":null,"slug":"individualized-rank-aggregation-using-nuclear","title":"Individualized Rank Aggregation using Nuclear Norm Regularization","date":"2014-10-03","arxiv_id":"1410.0860","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-low-rank-matrix-factorization-with","title":"Structured Low-Rank Matrix Factorization with Missing and Grossly Corrupted Observations","date":"2014-09-03","arxiv_id":"1409.1062","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":"adaptive-multinomial-matrix-completion","title":"Adaptive Multinomial Matrix Completion","date":"2014-08-26","arxiv_id":"1408.6218","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-general-framework-for-fast-stagewise","title":"A General Framework for Fast Stagewise Algorithms","date":"2014-08-25","arxiv_id":"1408.5801","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-under-interval-uncertainty","title":"Matrix Completion under Interval Uncertainty","date":"2014-08-11","arxiv_id":"1408.2467","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-coherence-and-the-nystrom-method","title":"Matrix Coherence and the Nystrom Method","date":"2014-08-09","arxiv_id":"1408.2044","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-matrix-completion-without-the-condition","title":"Fast matrix completion without the condition number","date":"2014-07-15","arxiv_id":"1407.4070","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-power-of-adaptivity-in-matrix","title":"On the Power of Adaptivity in Matrix Completion and Approximation","date":"2014-07-14","arxiv_id":"1407.3619","repositories_listed":0,"syntology":null},{"url":null,"slug":"relevance-singular-vector-machine-for-low","title":"Relevance Singular Vector Machine for low-rank matrix sensing","date":"2014-06-30","arxiv_id":"1407.0013","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-optimization-for-large-scale-max-norm","title":"Online Optimization for Large-Scale Max-Norm Regularization","date":"2014-06-12","arxiv_id":"1406.3190","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":"truncated-nuclear-norm-minimization-for-image","title":"Truncated Nuclear Norm Minimization for Image Restoration Based On Iterative Support Detection","date":"2014-06-11","arxiv_id":"1406.2969","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploring-algorithmic-limits-of-matrix-rank","title":"Exploring Algorithmic Limits of Matrix Rank Minimization under Affine Constraints","date":"2014-06-10","arxiv_id":"1406.2504","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-matrix-completion-prior","title":"Bayesian matrix completion: prior specification","date":"2014-06-05","arxiv_id":"1406.1440","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":"spectral-unsupervised-parsing-with-additive","title":"Spectral Unsupervised Parsing with Additive Tree Metrics","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"on-tensor-completion-via-nuclear-norm","title":"On Tensor Completion via Nuclear Norm Minimization","date":"2014-05-07","arxiv_id":"1405.1773","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comparison-of-clustering-and-missing-data","title":"A Comparison of Clustering and Missing Data Methods for Health Sciences","date":"2014-04-22","arxiv_id":"1404.5899","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":"geometric-inference-for-general-high","title":"Geometric Inference for General High-Dimensional Linear Inverse Problems","date":"2014-04-17","arxiv_id":"1404.4408","repositories_listed":0,"syntology":null},{"url":null,"slug":"cur-algorithm-with-incomplete-matrix","title":"CUR Algorithm with Incomplete Matrix Observation","date":"2014-03-22","arxiv_id":"1403.5647","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-perspectives-on-k-support-and-cluster","title":"New Perspectives on k-Support and Cluster Norms","date":"2014-03-06","arxiv_id":"1403.1481","repositories_listed":0,"syntology":null},{"url":null,"slug":"computational-limits-for-matrix-completion","title":"Computational Limits for Matrix Completion","date":"2014-02-10","arxiv_id":"1402.2331","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":"low-rank-modeling-and-its-applications-in","title":"Low-Rank Modeling and Its Applications in Image Analysis","date":"2014-01-15","arxiv_id":"1401.3409","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-matrix-completion-through-nuclear-norm","title":"Online Matrix Completion Through Nuclear Norm Regularisation","date":"2014-01-10","arxiv_id":"1401.2451","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-alternating-minimization-for","title":"Understanding Alternating Minimization for Matrix Completion","date":"2013-12-03","arxiv_id":"1312.0925","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-two-step-method-for-cross-language","title":"A Novel Two-Step Method for Cross Language Representation Learning","date":"2013-12-01","arxiv_id":null,"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":"matrix-completion-from-any-given-set-of","title":"Matrix Completion From any Given Set of Observations","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":"speedup-matrix-completion-with-side","title":"Speedup Matrix Completion with Side Information: Application to Multi-Label Learning","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-mixtures-of-discrete-product","title":"Learning Mixtures of Discrete Product Distributions using Spectral Decompositions","date":"2013-11-12","arxiv_id":"1311.2972","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-noisy-power-method-a-meta-algorithm-with","title":"The Noisy Power Method: A Meta Algorithm with Applications","date":"2013-11-11","arxiv_id":"1311.2495","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-influential-entries-in-a-matrix","title":"Identifying Influential Entries in a Matrix","date":"2013-10-14","arxiv_id":"1310.3556","repositories_listed":0,"syntology":null},{"url":null,"slug":"incoherence-optimal-matrix-completion","title":"Incoherence-Optimal Matrix Completion","date":"2013-10-01","arxiv_id":"1310.0154","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":"online-algorithms-for-factorization-based","title":"Online Algorithms for Factorization-Based Structure from Motion","date":"2013-09-26","arxiv_id":"1309.6964","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-max-norm-constrained-minimization-approach","title":"A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion","date":"2013-09-24","arxiv_id":"1309.6013","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":"flexible-low-rank-statistical-modeling-with","title":"Flexible Low-Rank Statistical Modeling with Side Information","date":"2013-08-20","arxiv_id":"1308.4211","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-predictability-of-human-assessment","title":"On the Predictability of Human Assessment: when Matrix Completion Meets NLP Evaluation","date":"2013-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"completing-any-low-rank-matrix-provably","title":"Completing Any Low-rank Matrix, Provably","date":"2013-06-12","arxiv_id":"1306.2979","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":"provable-inductive-matrix-completion","title":"Provable Inductive Matrix Completion","date":"2013-06-04","arxiv_id":"1306.0626","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-spectral-compressed-sensing-via","title":"Robust Spectral Compressed Sensing via Structured Matrix Completion","date":"2013-04-30","arxiv_id":"1304.8126","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-optimization-for-distance-matrix","title":"Low-rank optimization for distance matrix completion","date":"2013-04-24","arxiv_id":"1304.6663","repositories_listed":0,"syntology":null},{"url":null,"slug":"spectral-compressed-sensing-via-structured","title":"Spectral Compressed Sensing via Structured Matrix Completion","date":"2013-04-16","arxiv_id":"1304.4610","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-via-max-norm-constrained","title":"Matrix Completion via Max-Norm Constrained Optimization","date":"2013-03-02","arxiv_id":"1303.0341","repositories_listed":0,"syntology":null},{"url":null,"slug":"missing-entries-matrix-approximation-and","title":"Missing Entries Matrix Approximation and Completion","date":"2013-02-27","arxiv_id":"1302.6768","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":"fast-methods-for-denoising-matrix-completion","title":"Fast methods for denoising matrix completion formulations, with applications to robust seismic data interpolation","date":"2013-02-20","arxiv_id":"1302.4886","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":"approximating-concavely-parameterized","title":"Approximating Concavely Parameterized Optimization Problems","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"calibrated-elastic-regularization-in-matrix","title":"Calibrated Elastic Regularization in Matrix Completion","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"relax-and-randomize-from-value-to-algorithms","title":"Relax and Randomize : From Value to Algorithms","date":"2012-12-01","arxiv_id":null,"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":"semi-crowdsourced-clustering-generalizing","title":"Semi-Crowdsourced Clustering: Generalizing Crowd Labeling by Robust Distance Metric Learning","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":"a-denoising-view-of-matrix-completion","title":"A Denoising View of Matrix Completion","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"penalty-decomposition-methods-for-rank","title":"Penalty Decomposition Methods for Rank Minimization","date":"2011-12-01","arxiv_id":null,"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":"sparcs-recovering-low-rank-and-sparse","title":"SpaRCS: Recovering low-rank and sparse matrices from compressive measurements","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-matrix-completion-and-robust","title":"Distributed Matrix Completion and Robust Factorization","date":"2011-07-05","arxiv_id":"1107.0789","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-bayesian-methods-for-low-rank-matrix","title":"Sparse Bayesian Methods for Low-Rank Matrix Estimation","date":"2011-02-25","arxiv_id":"1102.5288","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-with-column-manipulation","title":"Matrix completion with column manipulation: Near-optimal sample-robustness-rank tradeoffs","date":"2011-02-10","arxiv_id":"1102.2254","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-block-lanczos-with-warm-start-technique-for","title":"A Block Lanczos with Warm Start Technique for Accelerating Nuclear Norm Minimization Algorithms","date":"2010-12-02","arxiv_id":"1012.0365","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-filtering-in-a-non-uniform","title":"Collaborative Filtering in a Non-Uniform World: Learning with the Weighted Trace Norm","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-matrix-factorization-with-missing","title":"Large-Scale Matrix Factorization with Missing Data under Additional Constraints","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"latent-variable-models-for-predicting-file","title":"Latent Variable Models for Predicting File Dependencies in Large-Scale Software Development","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"link-discovery-using-graph-feature-tracking","title":"Link Discovery using Graph Feature Tracking","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"transduction-with-matrix-completion-three","title":"Transduction with Matrix Completion: Three Birds with One Stone","date":"2010-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":"00737ab2c846d636f63f6b6bed48c43a0162aa0684836ec0890f412a147b274d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}