{"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/5","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":5,"pages_in_order":8,"rows_per_page":100,"rows":[401,500],"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/4","next":"/task/matrix-completion/papers/6","papers":[{"url":null,"slug":"efficient-mcmc-sampling-for-bayesian-matrix","title":"Efficient MCMC Sampling for Bayesian Matrix Factorization by Breaking Posterior Symmetries","date":"2020-06-08","arxiv_id":"2006.04295","repositories_listed":0,"syntology":null},{"url":null,"slug":"mc2g-an-efficient-algorithm-for-matrix","title":"MC2G: An Efficient Algorithm for Matrix Completion with Social and Item Similarity Graphs","date":"2020-06-08","arxiv_id":"2006.04373","repositories_listed":0,"syntology":null},{"url":null,"slug":"discrete-aware-matrix-completion-via-proximal","title":"Discrete-Aware Matrix Completion via Proximal Gradient","date":"2020-06-07","arxiv_id":"2006.04075","repositories_listed":0,"syntology":null},{"url":null,"slug":"tensor-completion-made-practical","title":"Tensor Completion Made Practical","date":"2020-06-04","arxiv_id":"2006.03134","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-matrix-completion-with-mixed-data","title":"Robust Matrix Completion with Mixed Data Types","date":"2020-05-25","arxiv_id":"2005.12415","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-framework-for-detecting-ground","title":"Deep Learning Framework for Detecting Ground Deformation in the Built Environment using Satellite InSAR data","date":"2020-05-07","arxiv_id":"2005.03221","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-stochastic-proximal-gradient","title":"Riemannian Stochastic Proximal Gradient Methods for Nonsmooth Optimization over the Stiefel Manifold","date":"2020-05-03","arxiv_id":"2005.01209","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-exposition-to-the-finiteness-of-fibers-in","title":"Low-rank matrix completion theory via Plucker coordinates","date":"2020-04-26","arxiv_id":"2004.12430","repositories_listed":0,"syntology":null},{"url":null,"slug":"ocean-reverberation-suppression-via-matrix","title":"Ocean Reverberation Suppression via Matrix Completion with Sensor Failure","date":"2020-04-26","arxiv_id":"2004.12494","repositories_listed":0,"syntology":null},{"url":null,"slug":"orthogonal-inductive-matrix-completion","title":"Orthogonal Inductive Matrix Completion","date":"2020-04-03","arxiv_id":"2004.01653","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonconvex-matrix-completion-with-linearly","title":"Nonconvex Matrix Completion with Linearly Parameterized Factors","date":"2020-03-29","arxiv_id":"2003.13153","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-the-robust-matrix-completion-problem","title":"Solving the Robust Matrix Completion Problem via a System of Nonlinear Equations","date":"2020-03-24","arxiv_id":"2003.10992","repositories_listed":0,"syntology":null},{"url":null,"slug":"dropout-explicit-forms-and-capacity-control-1","title":"Dropout: Explicit Forms and Capacity Control","date":"2020-03-06","arxiv_id":"2003.03397","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-regularity-and-conditioning-of-low","title":"On the simplicity and conditioning of low rank semidefinite programs","date":"2020-02-25","arxiv_id":"2002.10673","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-high-rank-matrix-completion-1","title":"Online high rank matrix completion","date":"2020-02-20","arxiv_id":"2002.08934","repositories_listed":0,"syntology":null},{"url":null,"slug":"finiteness-of-fibers-in-matrix-completion-via","title":"Results on the algebraic matroid of the determinantal variety","date":"2020-02-12","arxiv_id":"2002.05082","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-mean-estimation-under-coordinate-level","title":"On Robust Mean Estimation under Coordinate-level Corruption","date":"2020-02-10","arxiv_id":"2002.04137","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-adaptive-matrix-completion","title":"Optimal Exact Matrix Completion Under new Parametrization","date":"2020-02-06","arxiv_id":"2002.02431","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-convergence-of-stochastic-gradient-3","title":"On the Convergence of Stochastic Gradient Descent with Low-Rank Projections for Convex Low-Rank Matrix Problems","date":"2020-01-31","arxiv_id":"2001.11668","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-in-thermodynamics-prediction","title":"Machine Learning in Thermodynamics: Prediction of Activity Coefficients by Matrix Completion","date":"2020-01-29","arxiv_id":"2001.10675","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonlinear-traffic-prediction-as-a-matrix","title":"Nonlinear Traffic Prediction as a Matrix Completion Problem with Ensemble Learning","date":"2020-01-08","arxiv_id":"2001.02492","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-cold-start-problem-in-recommendation","title":"Solving Cold Start Problem in Recommendation with Attribute Graph Neural Networks","date":"2019-12-28","arxiv_id":"1912.12398","repositories_listed":0,"syntology":null},{"url":null,"slug":"bounded-manifold-completion","title":"Bounded Manifold Completion","date":"2019-12-19","arxiv_id":"1912.09026","repositories_listed":0,"syntology":null},{"url":null,"slug":"polynomial-matrix-completion-for-missing-data","title":"Polynomial Matrix Completion for Missing Data Imputation and Transductive Learning","date":"2019-12-15","arxiv_id":"1912.06989","repositories_listed":0,"syntology":null},{"url":null,"slug":"balancing-accuracy-and-diversity-in","title":"Balancing Accuracy and Diversity in Recommendations using Matrix Completion Framework","date":"2019-12-11","arxiv_id":"2001.04349","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-and-matrix-completion","title":"Community Detection and Matrix Completion with Social and Item Similarity Graphs","date":"2019-12-06","arxiv_id":"1912.04099","repositories_listed":0,"syntology":null},{"url":null,"slug":"influenza-modeling-based-on-massive-feature","title":"Influenza Modeling Based on Massive Feature Engineering and International Flow Deconvolution","date":"2019-12-06","arxiv_id":"1912.02989","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-fast-matrix-completion-based-approach-for","title":"A Fast Matrix-Completion-Based Approach for Recommendation Systems","date":"2019-12-02","arxiv_id":"1912.00600","repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-non-linear-inductive-matrix","title":"Provable Non-linear Inductive Matrix Completion","date":"2019-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stable-matrix-completion-using-properly","title":"Matrix Completion using Kronecker Product Approximation","date":"2019-11-26","arxiv_id":"1911.11774","repositories_listed":0,"syntology":null},{"url":null,"slug":"factor-group-sparse-regularization-for-1","title":"Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery","date":"2019-11-13","arxiv_id":"1911.05774","repositories_listed":0,"syntology":null},{"url":null,"slug":"intelligent-reflecting-surface-for-massive","title":"Intelligent Reflecting Surface for Massive Device Connectivity: Joint Activity Detection and Channel Estimation","date":"2019-11-12","arxiv_id":"1911.12157","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-graph-convolutional-neural-networks-1","title":"Bayesian Graph Convolutional Neural Networks Using Non-Parametric Graph Learning","date":"2019-10-26","arxiv_id":"1910.12132","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-exact-matrix-completion-a-unifying","title":"Fast Exact Matrix Completion: A Unified Optimization Framework for Matrix Completion","date":"2019-10-21","arxiv_id":"1910.09092","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-sampling-for-matrix-completion-using","title":"Graph Sampling for Matrix Completion Using Recurrent Gershgorin Disc Shift","date":"2019-10-16","arxiv_id":"1906.01087","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-counterfactuals-and-factor","title":"Matrix Completion, Counterfactuals, and Factor Analysis of Missing Data","date":"2019-10-15","arxiv_id":"1910.06677","repositories_listed":0,"syntology":null},{"url":null,"slug":"deterministic-completion-of-rectangular-1","title":"New and Explicit Constructions of Unbalanced Ramanujan Bipartite Graphs","date":"2019-10-08","arxiv_id":"1910.03937","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-sparse-reverse-of-principal-component","title":"The Sparse Reverse of Principal Component Analysis for Fast Low-Rank Matrix Completion","date":"2019-10-04","arxiv_id":"1910.02155","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-geometric-matrix-completion-are-we-doing","title":"Deep geometric matrix completion: Are we doing it right?","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-inferences-of-linear-forms-for","title":"Statistical Inferences of Linear Forms for Noisy Matrix Completion","date":"2019-08-31","arxiv_id":"1909.00116","repositories_listed":0,"syntology":null},{"url":null,"slug":"deterministic-completion-of-rectangular","title":"Deterministic Completion of Rectangular Matrices Using Asymmetric Ramanujan Graphs: Exact and Stable Recovery","date":"2019-08-02","arxiv_id":"1908.00963","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-bayesian-non-linear-matrix","title":"Scalable Bayesian Non-linear Matrix Completion","date":"2019-07-31","arxiv_id":"1908.01009","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-non-rigid-structure-from-motion","title":"Deep Non-Rigid Structure from Motion with Missing Data","date":"2019-07-30","arxiv_id":"1907.13123","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-filtering-and-multi-label","title":"Collaborative Filtering and Multi-Label Classification with Matrix Factorization","date":"2019-07-23","arxiv_id":"1907.12365","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-matrix-completion-and-denoising","title":"Low-rank matrix completion and denoising under Poisson noise","date":"2019-07-11","arxiv_id":"1907.05325","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-landscape-of-non-convex-empirical-risk","title":"The Landscape of Non-convex Empirical Risk with Degenerate Population Risk","date":"2019-07-11","arxiv_id":"1907.05520","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-divide-and-conquer-algorithm-for-binary","title":"A divide-and-conquer algorithm for binary matrix completion","date":"2019-07-09","arxiv_id":"1907.04251","repositories_listed":0,"syntology":null},{"url":null,"slug":"depth-restoration-a-fast-low-rank-matrix","title":"Depth Restoration: A fast low-rank matrix completion via dual-graph regularization","date":"2019-07-05","arxiv_id":"1907.02841","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-matrix-completion-based-on-cavity","title":"Approximate matrix completion based on cavity method","date":"2019-06-29","arxiv_id":"1907.00138","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-variational-bayesian-subspace","title":"Online Variational Bayesian Subspace Filtering with Applications","date":"2019-06-24","arxiv_id":"1906.09920","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-error-bounds-for-kernel-matrix","title":"Generalization error bounds for kernel matrix completion and extrapolation","date":"2019-06-20","arxiv_id":"1906.08770","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-matrix-completion-with-side","title":"Online Matrix Completion with Side Information","date":"2019-06-17","arxiv_id":"1906.07255","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficiently-escaping-saddle-points-on","title":"Efficiently escaping saddle points on manifolds","date":"2019-06-10","arxiv_id":"1906.04321","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-and-uncertainty-quantification-for","title":"Inference and Uncertainty Quantification for Noisy Matrix Completion","date":"2019-06-10","arxiv_id":"1906.04159","repositories_listed":0,"syntology":null},{"url":null,"slug":"guaranteed-matrix-completion-under-multiple","title":"Guaranteed Matrix Completion Under Multiple Linear Transformations","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"190600098","title":"Spectral Perturbation Meets Incomplete Multi-view Data","date":"2019-05-31","arxiv_id":"1906.00098","repositories_listed":0,"syntology":null},{"url":null,"slug":"sum-of-squares-meets-square-loss-fast-rates","title":"Sum-of-squares meets square loss: Fast rates for agnostic tensor completion","date":"2019-05-30","arxiv_id":"1905.13283","repositories_listed":0,"syntology":null},{"url":null,"slug":"collaborative-self-attention-for-recommender","title":"Collaborative Self-Attention for Recommender Systems","date":"2019-05-27","arxiv_id":"1905.13133","repositories_listed":0,"syntology":null},{"url":null,"slug":"star-gcn-stacked-and-reconstructed-graph","title":"STAR-GCN: Stacked and Reconstructed Graph Convolutional Networks for Recommender Systems","date":"2019-05-27","arxiv_id":"1905.13129","repositories_listed":0,"syntology":null},{"url":null,"slug":"prediction-with-unpredictable-feature","title":"Prediction with Unpredictable Feature Evolution","date":"2019-04-27","arxiv_id":"1904.12171","repositories_listed":0,"syntology":null},{"url":null,"slug":"gradient-descent-for-sparse-rank-one-matrix-1","title":"Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers","date":"2019-04-25","arxiv_id":"1904.11608","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-approximation-from-communication","title":"Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation","date":"2019-04-22","arxiv_id":"1904.09841","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-matrix-recovery-with-composite","title":"Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence","date":"2019-04-22","arxiv_id":"1904.10020","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-with-selective-sampling","title":"Matrix Completion With Selective Sampling","date":"2019-04-17","arxiv_id":"1904.08540","repositories_listed":0,"syntology":null},{"url":null,"slug":"binary-matrix-completion-with-nonconvex","title":"Binary matrix completion with nonconvex regularizers","date":"2019-04-08","arxiv_id":"1904.03807","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-view-matrix-completion-for-multi-label","title":"Multi-View Matrix Completion for Multi-Label Image Classification","date":"2019-04-08","arxiv_id":"1904.03901","repositories_listed":0,"syntology":null},{"url":null,"slug":"cluster-developing-1-bit-matrix-completion","title":"Cluster Developing 1-Bit Matrix Completion","date":"2019-04-07","arxiv_id":"1904.03779","repositories_listed":0,"syntology":null},{"url":null,"slug":"ensemble-methods-for-causal-effects-in-panel","title":"Ensemble Methods for Causal Effects in Panel Data Settings","date":"2019-03-24","arxiv_id":"1903.10079","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-methods-economists-should","title":"Machine Learning Methods Economists Should Know About","date":"2019-03-24","arxiv_id":"1903.10075","repositories_listed":0,"syntology":null},{"url":null,"slug":"inceptiongcn-receptive-field-aware-graph","title":"InceptionGCN: Receptive Field Aware Graph Convolutional Network for Disease Prediction","date":"2019-03-11","arxiv_id":"1903.04233","repositories_listed":0,"syntology":null},{"url":null,"slug":"multilspectral-snapshot-demosaicing-via-non","title":"Multispectral snapshot demosaicing via non-convex matrix completion","date":"2019-02-28","arxiv_id":"1902.11032","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-convex-geometry-of-blind-deconvolution","title":"On the convex geometry of blind deconvolution and matrix completion","date":"2019-02-28","arxiv_id":"1902.11156","repositories_listed":0,"syntology":null},{"url":null,"slug":"noisy-matrix-completion-understanding","title":"Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization","date":"2019-02-20","arxiv_id":"1902.07698","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-matrix-completion-state-estimation-in","title":"Robust Matrix Completion State Estimation in Distribution Systems","date":"2019-02-06","arxiv_id":"1902.02009","repositories_listed":0,"syntology":null},{"url":null,"slug":"geometric-matrix-completion-with-deep","title":"Geometric Matrix Completion with Deep Conditional Random Fields","date":"2019-01-29","arxiv_id":"1901.10429","repositories_listed":0,"syntology":null},{"url":null,"slug":"computing-large-market-equilibria-using","title":"Computing large market equilibria using abstractions","date":"2019-01-18","arxiv_id":"1901.06230","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonconvex-rectangular-matrix-completion-via","title":"Nonconvex Rectangular Matrix Completion via Gradient Descent without $\\ell_{2,\\infty}$ Regularization","date":"2019-01-18","arxiv_id":"1901.06116","repositories_listed":0,"syntology":null},{"url":null,"slug":"double-weighted-truncated-nuclear-norm","title":"Double Weighted Truncated Nuclear Norm Regularization for Low-Rank Matrix Completion","date":"2019-01-07","arxiv_id":"1901.01711","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-under-low-rank-missing","title":"Matrix Completion under Low-Rank Missing Mechanism","date":"2018-12-19","arxiv_id":"1812.07813","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretable-matrix-completion-a-discrete","title":"Interpretable Matrix Completion: A Discrete Optimization Approach","date":"2018-12-17","arxiv_id":"1812.06647","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-factorization-via-deep-learning","title":"Matrix Factorization via Deep Learning","date":"2018-12-04","arxiv_id":"1812.01478","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixture-matrix-completion-1","title":"Mixture Matrix Completion","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"basis-pursuit-denoise-with-nonsmooth","title":"Basis Pursuit Denoise with Nonsmooth Constraints","date":"2018-11-28","arxiv_id":"1811.11633","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-with-variational-graph","title":"Matrix Completion With Variational Graph Autoencoders: Application in Hyperlocal Air Quality Inference","date":"2018-11-05","arxiv_id":"1811.01662","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-approach-to-quantized-matrix","title":"A Novel Approach to Quantized Matrix Completion Using Huber Loss Measure","date":"2018-10-29","arxiv_id":"1810.12460","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-parallel-algorithms","title":"Communication Efficient Parallel Algorithms for Optimization on Manifolds","date":"2018-10-26","arxiv_id":"1810.11155","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-recommender-systemsthrough-recursive","title":"Scalable Recommender Systemsthrough Recursive Evidence Chains","date":"2018-10-20","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"nonconvex-optimization-meets-low-rank-matrix","title":"Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview","date":"2018-09-25","arxiv_id":"1809.09573","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-with-weighted-constraint","title":"Matrix Completion with Weighted Constraint for Haplotype Estimation","date":"2018-09-17","arxiv_id":"1809.06117","repositories_listed":0,"syntology":null},{"url":null,"slug":"clipped-matrix-completion-a-remedy-for","title":"Clipped Matrix Completion: A Remedy for Ceiling Effects","date":"2018-09-13","arxiv_id":"1809.04997","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-target-prediction-a-unifying-view-on","title":"Multi-Target Prediction: A Unifying View on Problems and Methods","date":"2018-09-07","arxiv_id":"1809.02352","repositories_listed":0,"syntology":null},{"url":null,"slug":"ranking-with-features-algorithm-and-a-graph","title":"Ranking with Features: Algorithm and A Graph Theoretic Analysis","date":"2018-08-11","arxiv_id":"1808.03857","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-temporal-interpolation-of-head-and","title":"Improving Temporal Interpolation of Head and Body Pose using Gaussian Process Regression in a Matrix Completion Setting","date":"2018-08-06","arxiv_id":"1808.01837","repositories_listed":0,"syntology":null},{"url":null,"slug":"fusion-subspace-clustering-full-and","title":"Fusion Subspace Clustering: Full and Incomplete Data","date":"2018-08-02","arxiv_id":"1808.00628","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixture-matrix-completion","title":"Mixture Matrix Completion","date":"2018-08-02","arxiv_id":"1808.00616","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-and-extrapolation-via","title":"Matrix completion and extrapolation via kernel regression","date":"2018-08-01","arxiv_id":"1808.00441","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-framework-for-sparse-relaxed","title":"A Unified Framework for Sparse Relaxed Regularized Regression: SR3","date":"2018-07-14","arxiv_id":"1807.05411","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-recommender-systems-through","title":"Scalable Recommender Systems through Recursive Evidence Chains","date":"2018-07-05","arxiv_id":"1807.02150","repositories_listed":0,"syntology":null},{"url":null,"slug":"regularizing-autoencoder-based-matrix","title":"Regularizing Autoencoder-Based Matrix Completion Models via Manifold Learning","date":"2018-07-04","arxiv_id":"1807.01798","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-primal-dual-analysis-of-global-optimality","title":"A Primal-Dual Analysis of Global Optimality in Nonconvex Low-Rank Matrix Recovery","date":"2018-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"6f668b5e794d99ac980729f10c334651a5c5ebc76e0649997cdc1855081568f1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}