{"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/7","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":7,"pages_in_order":8,"rows_per_page":100,"rows":[601,700],"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/6","next":"/task/matrix-completion/papers/8","papers":[{"url":null,"slug":"spectral-inference-methods-on-sparse-graphs","title":"Spectral Inference Methods on Sparse Graphs: Theory and Applications","date":"2016-10-14","arxiv_id":"1610.04337","repositories_listed":0,"syntology":null},{"url":null,"slug":"unorganized-malicious-attacks-detection","title":"Unorganized Malicious Attacks Detection","date":"2016-10-13","arxiv_id":"1610.04086","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":"max-norm-optimization-for-robust-matrix","title":"Max-Norm Optimization for Robust Matrix Recovery","date":"2016-09-24","arxiv_id":"1609.07664","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-completion-by-alternating-minimization","title":"Tensor Completion by Alternating Minimization under the Tensor Train (TT) Model","date":"2016-09-19","arxiv_id":"1609.05587","repositories_listed":0,"syntology":null},{"url":null,"slug":"noisy-inductive-matrix-completion-under","title":"Noisy Inductive Matrix Completion Under Sparse Factor Models","date":"2016-09-13","arxiv_id":"1609.03958","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-spectral-detection-of-global","title":"Robust Spectral Detection of Global Structures in the Data by Learning a Regularization","date":"2016-09-09","arxiv_id":"1609.02906","repositories_listed":0,"syntology":null},{"url":null,"slug":"tracking-completion","title":"Tracking Completion","date":"2016-08-29","arxiv_id":"1608.08171","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-non-convex-one-pass-framework-for","title":"A Non-convex One-Pass Framework for Generalized Factorization Machine and Rank-One Matrix Sensing","date":"2016-08-21","arxiv_id":"1608.05995","repositories_listed":0,"syntology":null},{"url":null,"slug":"which-tumblr-post-should-i-read-next","title":"Which Tumblr Post Should I Read Next?","date":"2016-08-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-of-generalized-low-rank-models-a","title":"Learning of Generalized Low-Rank Models: A Greedy Approach","date":"2016-07-27","arxiv_id":"1607.08012","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-methods-for-recovering-sparse-parameters","title":"Fast Methods for Recovering Sparse Parameters in Linear Low Rank Models","date":"2016-06-26","arxiv_id":"1606.08009","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":"link-prediction-via-matrix-completion","title":"Link Prediction via Matrix Completion","date":"2016-06-22","arxiv_id":"1606.06812","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-pairwise-learning-using-kernel","title":"Efficient Pairwise Learning Using Kernel Ridge Regression: an Exact Two-Step Method","date":"2016-06-14","arxiv_id":"1606.04275","repositories_listed":0,"syntology":null},{"url":null,"slug":"extended-gauss-newton-and-gauss-newton-admm","title":"Extended Gauss-Newton and ADMM-Gauss-Newton Algorithms for Low-Rank Matrix Optimization","date":"2016-06-10","arxiv_id":"1606.03358","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-algorithms-for-tractable-schatten","title":"Scalable Algorithms for Tractable Schatten Quasi-Norm Minimization","date":"2016-06-04","arxiv_id":"1606.01245","repositories_listed":0,"syntology":null},{"url":null,"slug":"contextual-bandits-with-latent-confounders-an","title":"Contextual Bandits with Latent Confounders: An NMF Approach","date":"2016-06-01","arxiv_id":"1606.00119","repositories_listed":0,"syntology":null},{"url":null,"slug":"deephand-robust-hand-pose-estimation-by","title":"DeepHand: Robust Hand Pose Estimation by Completing a Matrix Imputed With Deep Features","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"proximal-riemannian-pursuit-for-large-scale","title":"Proximal Riemannian Pursuit for Large-Scale Trace-Norm Minimization","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"self-adaptive-matrix-completion-for-heart","title":"Self-Adaptive Matrix Completion for Heart Rate Estimation From Face Videos Under Realistic Conditions","date":"2016-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-efficient-online-matrix-completion","title":"Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent","date":"2016-05-26","arxiv_id":"1605.08370","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-algorithms-for-robust-pca-via-gradient","title":"Fast Algorithms for Robust PCA via Gradient Descent","date":"2016-05-25","arxiv_id":"1605.07784","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-has-no-spurious-local","title":"Matrix Completion has No Spurious Local Minimum","date":"2016-05-24","arxiv_id":"1605.07272","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-riemannian-gossip-approach-to-decentralized","title":"A Riemannian gossip approach to decentralized matrix completion","date":"2016-05-23","arxiv_id":"1605.06968","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-analysis-for-rectangular-matrix","title":"Convergence Analysis for Rectangular Matrix Completion Using Burer-Monteiro Factorization and Gradient Descent","date":"2016-05-23","arxiv_id":"1605.07051","repositories_listed":0,"syntology":null},{"url":null,"slug":"sub-gaussian-estimators-of-the-mean-of-a-1","title":"Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entries","date":"2016-05-23","arxiv_id":"1605.07129","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-note-on-the-statistical-view-of-matrix","title":"A note on the statistical view of matrix completion","date":"2016-05-10","arxiv_id":"1605.03040","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-global-optimality-for-dictionary","title":"Identifying global optimality for dictionary learning","date":"2016-04-17","arxiv_id":"1604.04942","repositories_listed":0,"syntology":null},{"url":null,"slug":"1-bit-matrix-completion-pac-bayesian-analysis","title":"1-bit Matrix Completion: PAC-Bayesian Analysis of a Variational Approximation","date":"2016-04-14","arxiv_id":"1604.04191","repositories_listed":0,"syntology":null},{"url":null,"slug":"removing-clouds-and-recovering-ground","title":"Removing Clouds and Recovering Ground Observations in Satellite Image Sequences via Temporally Contiguous Robust Matrix Completion","date":"2016-04-13","arxiv_id":"1604.03915","repositories_listed":0,"syntology":null},{"url":null,"slug":"unified-view-of-matrix-completion-under","title":"Unified View of Matrix Completion under General Structural Constraints","date":"2016-03-29","arxiv_id":"1603.08708","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":"graph-clustering-variational-image","title":"Graph clustering, variational image segmentation methods and Hough transform scale detection for object measurement in images","date":"2016-02-27","arxiv_id":"1602.08574","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-harmonic-extension-approach-for","title":"A Harmonic Extension Approach for Collaborative Ranking","date":"2016-02-16","arxiv_id":"1602.05127","repositories_listed":0,"syntology":null},{"url":null,"slug":"network-inference-by-learned-node-specific","title":"Network Inference by Learned Node-Specific Degree Prior","date":"2016-02-07","arxiv_id":"1602.02386","repositories_listed":0,"syntology":null},{"url":null,"slug":"recovery-guarantee-of-weighted-low-rank","title":"Recovery guarantee of weighted low-rank approximation via alternating minimization","date":"2016-02-06","arxiv_id":"1602.02262","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-note-on-alternating-minimization-algorithm","title":"A Note on Alternating Minimization Algorithm for the Matrix Completion Problem","date":"2016-02-05","arxiv_id":"1602.02164","repositories_listed":0,"syntology":null},{"url":null,"slug":"log-normal-matrix-completion-for-large-scale","title":"Log-Normal Matrix Completion for Large Scale Link Prediction","date":"2016-01-28","arxiv_id":"1601.07714","repositories_listed":0,"syntology":null},{"url":null,"slug":"top-n-recommender-system-via-matrix","title":"Top-N Recommender System via Matrix Completion","date":"2016-01-19","arxiv_id":"1601.04800","repositories_listed":0,"syntology":null},{"url":null,"slug":"subspace-clustering-based-tag-sharing-for","title":"Subspace Clustering Based Tag Sharing for Inductive Tag Matrix Refinement with Complex Errors","date":"2016-01-12","arxiv_id":"1601.03055","repositories_listed":0,"syntology":null},{"url":null,"slug":"fitting-spectral-decay-with-the-k-support","title":"Fitting Spectral Decay with the $k$-Support Norm","date":"2016-01-04","arxiv_id":"1601.00449","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-under-monotonic-single","title":"Matrix Completion Under Monotonic Single Index Models","date":"2015-12-29","arxiv_id":"1512.08787","repositories_listed":0,"syntology":null},{"url":null,"slug":"new-perspectives-on-k-support-and-cluster-1","title":"New Perspectives on $k$-Support and Cluster Norms","date":"2015-12-27","arxiv_id":"1512.08204","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-optimization-algorithm-on-riemannian","title":"Fast Optimization Algorithm on Riemannian Manifolds and Its Application in Low-Rank Representation","date":"2015-12-07","arxiv_id":"1512.01927","repositories_listed":0,"syntology":null},{"url":null,"slug":"pseudo-bayesian-robust-pca-algorithms-and","title":"Pseudo-Bayesian Robust PCA: Algorithms and Analyses","date":"2015-12-07","arxiv_id":"1512.02188","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-with-noisy-side-information","title":"Matrix Completion with Noisy Side Information","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"recognizing-retinal-ganglion-cells-in-the","title":"Recognizing retinal ganglion cells in the dark","date":"2015-12-01","arxiv_id":null,"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":"taming-the-wild-a-unified-analysis-of-hogwild-1","title":"Taming the Wild: A Unified Analysis of Hogwild-Style Algorithms","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":"factorizing-lambdamart-for-cold-start","title":"Factorizing LambdaMART for cold start recommendations","date":"2015-11-04","arxiv_id":"1511.01282","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-singular-value-decomposition-applications","title":"The Singular Value Decomposition, Applications and Beyond","date":"2015-10-29","arxiv_id":"1510.08532","repositories_listed":0,"syntology":null},{"url":null,"slug":"minimax-lower-bounds-for-noisy-matrix","title":"Minimax Lower Bounds for Noisy Matrix Completion Under Sparse Factor Models","date":"2015-10-02","arxiv_id":"1510.00701","repositories_listed":0,"syntology":null},{"url":null,"slug":"boolean-matrix-factorization-and-noisy","title":"Boolean Matrix Factorization and Noisy Completion via Message Passing","date":"2015-09-28","arxiv_id":"1509.08535","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-dimensional-time-series-prediction-with","title":"High-dimensional Time Series Prediction with Missing Values","date":"2015-09-28","arxiv_id":"1509.08333","repositories_listed":0,"syntology":null},{"url":null,"slug":"exponential-family-matrix-completion-under","title":"Exponential Family Matrix Completion under Structural Constraints","date":"2015-09-15","arxiv_id":"1509.04397","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-low-rank-estimation-by-projected","title":"Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees","date":"2015-09-10","arxiv_id":"1509.03025","repositories_listed":0,"syntology":null},{"url":null,"slug":"information-theoretic-bounds-on-matrix","title":"Information-theoretic Bounds on Matrix Completion under Union of Subspaces Model","date":"2015-08-14","arxiv_id":"1508.03395","repositories_listed":0,"syntology":null},{"url":null,"slug":"regret-guarantees-for-item-item-collaborative","title":"Regret Guarantees for Item-Item Collaborative Filtering","date":"2015-07-20","arxiv_id":"1507.05371","repositories_listed":0,"syntology":null},{"url":null,"slug":"projected-wirtinger-gradient-descent-for-low","title":"Projected Wirtinger Gradient Descent for Low-Rank Hankel Matrix Completion in Spectral Compressed Sensing","date":"2015-07-14","arxiv_id":"1507.03707","repositories_listed":0,"syntology":null},{"url":null,"slug":"categorical-matrix-completion","title":"Categorical Matrix Completion","date":"2015-07-02","arxiv_id":"1507.00421","repositories_listed":0,"syntology":null},{"url":null,"slug":"annotation-projection-based-representation","title":"Annotation Projection-based Representation Learning for Cross-lingual Dependency Parsing","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"notes-on-low-rank-matrix-factorization","title":"Notes on Low-rank Matrix Factorization","date":"2015-06-30","arxiv_id":"1507.00333","repositories_listed":0,"syntology":null},{"url":null,"slug":"completing-low-rank-matrices-with-corrupted","title":"Completing Low-Rank Matrices with Corrupted Samples from Few Coefficients in General Basis","date":"2015-06-25","arxiv_id":"1506.07615","repositories_listed":0,"syntology":null},{"url":null,"slug":"taming-the-wild-a-unified-analysis-of-hogwild","title":"Taming the Wild: A Unified Analysis of Hogwild!-Style Algorithms","date":"2015-06-22","arxiv_id":"1506.06438","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-properties-of-variational","title":"On the properties of variational approximations of Gibbs posteriors","date":"2015-06-12","arxiv_id":"1506.04091","repositories_listed":0,"syntology":null},{"url":null,"slug":"image-tag-completion-and-refinement-by","title":"Image Tag Completion and Refinement by Subspace Clustering and Matrix Completion","date":"2015-06-10","arxiv_id":"1506.03475","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-from-fewer-entries-spectral","title":"Matrix Completion from Fewer Entries: Spectral Detectability and Rank Estimation","date":"2015-06-10","arxiv_id":"1506.03498","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":"matrix-completion-for-resolving-label","title":"Matrix Completion for Resolving Label Ambiguity","date":"2015-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"smooth-parafac-decomposition-for-tensor","title":"Smooth PARAFAC Decomposition for Tensor Completion","date":"2015-05-25","arxiv_id":"1505.06611","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-faster-rates-and-oracle-property-for","title":"Towards Faster Rates and Oracle Property for Low-Rank Matrix Estimation","date":"2015-05-18","arxiv_id":"1505.04780","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-low-rank-tensor-recovery-from","title":"Optimal Low-Rank Tensor Recovery from Separable Measurements: Four Contractions Suffice","date":"2015-05-15","arxiv_id":"1505.04085","repositories_listed":0,"syntology":null},{"url":null,"slug":"prediction-and-quantification-of-individual","title":"Prediction and Quantification of Individual Athletic Performance","date":"2015-05-05","arxiv_id":"1505.01147","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":"social-trust-prediction-via-max-norm","title":"Social Trust Prediction via Max-norm Constrained 1-bit Matrix Completion","date":"2015-04-24","arxiv_id":"1504.06394","repositories_listed":0,"syntology":null},{"url":null,"slug":"regularization-free-estimation-in-trace","title":"Regularization-free estimation in trace regression with symmetric positive semidefinite matrices","date":"2015-04-23","arxiv_id":"1504.06305","repositories_listed":0,"syntology":null},{"url":null,"slug":"poisson-matrix-recovery-and-completion","title":"Poisson Matrix Recovery and Completion","date":"2015-04-20","arxiv_id":"1504.05229","repositories_listed":0,"syntology":null},{"url":null,"slug":"streaming-memory-limited-matrix-completion","title":"Streaming, Memory Limited Matrix Completion with Noise","date":"2015-04-13","arxiv_id":"1504.03156","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-matrix-completion-with","title":"Structured Matrix Completion with Applications to Genomic Data Integration","date":"2015-04-08","arxiv_id":"1504.01823","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":"scalable-nuclear-norm-minimization-by","title":"Scalable Nuclear-norm Minimization by Subspace Pursuit Proximal Riemannian Gradient","date":"2015-03-10","arxiv_id":"1503.02828","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":"matrix-completion-with-noisy-entries-and","title":"Matrix Completion with Noisy Entries and Outliers","date":"2015-03-01","arxiv_id":"1503.00214","repositories_listed":0,"syntology":null},{"url":null,"slug":"1-bit-matrix-completion-under-exact-low-rank","title":"1-Bit Matrix Completion under Exact Low-Rank Constraint","date":"2015-02-24","arxiv_id":"1502.06689","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":"exact-tensor-completion-using-t-svd","title":"Exact tensor completion using t-SVD","date":"2015-02-16","arxiv_id":"1502.04689","repositories_listed":0,"syntology":null},{"url":null,"slug":"speeding-up-permutation-testing-in","title":"Speeding up Permutation Testing in Neuroimaging","date":"2015-02-12","arxiv_id":"1502.03536","repositories_listed":0,"syntology":null},{"url":null,"slug":"recovery-of-piecewise-smooth-images-from-few","title":"Recovery of Piecewise Smooth Images from Few Fourier Samples","date":"2015-02-03","arxiv_id":"1502.00705","repositories_listed":0,"syntology":null},{"url":null,"slug":"noisy-tensor-completion-via-the-sum-of","title":"Noisy Tensor Completion via the Sum-of-Squares Hierarchy","date":"2015-01-26","arxiv_id":"1501.06521","repositories_listed":0,"syntology":null},{"url":null,"slug":"poisson-matrix-completion","title":"Poisson Matrix Completion","date":"2015-01-26","arxiv_id":"1501.06243","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":"accams-additive-co-clustering-to-approximate","title":"ACCAMS: Additive Co-Clustering to Approximate Matrices Succinctly","date":"2014-12-31","arxiv_id":"1501.00199","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-parameters-for-weighted-matrix","title":"Learning Parameters for Weighted Matrix Completion via Empirical Estimation","date":"2014-12-31","arxiv_id":"1501.00192","repositories_listed":0,"syntology":null},{"url":null,"slug":"functional-correspondence-by-matrix","title":"Functional correspondence by matrix completion","date":"2014-12-27","arxiv_id":"1412.8070","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":"quantized-matrix-completion-for-personalized","title":"Quantized Matrix Completion for Personalized Learning","date":"2014-12-18","arxiv_id":"1412.5968","repositories_listed":0,"syntology":null}],"record_sha256":"82ddb375989d3fd79b40f2d1b1b755bda6d39c2d9a9b160f57879914401cccec","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}