{"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/2","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":2,"pages_in_order":8,"rows_per_page":100,"rows":[101,200],"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","next":"/task/matrix-completion/papers/3","papers":[{"url":"/paper/scalable-probabilistic-matrix-factorization","slug":"scalable-probabilistic-matrix-factorization","title":"Scalable Probabilistic Matrix Factorization with Graph-Based Priors","date":"2019-08-25","arxiv_id":"1908.09393","repositories_listed":1,"syntology":null},{"url":"/paper/190600494","slug":"190600494","title":"Graphon Estimation from Partially Observed Network Data","date":"2019-06-02","arxiv_id":"1906.00494","repositories_listed":1,"syntology":null},{"url":"/paper/implicit-regularization-in-deep-matrix","slug":"implicit-regularization-in-deep-matrix","title":"Implicit Regularization in Deep Matrix Factorization","date":"2019-05-31","arxiv_id":"1905.13655","repositories_listed":1,"syntology":null},{"url":"/paper/matrix-completion-in-the-unit-hypercube-via","slug":"matrix-completion-in-the-unit-hypercube-via","title":"Matrix Completion in the Unit Hypercube via Structured Matrix Factorization","date":"2019-05-30","arxiv_id":"1905.12881","repositories_listed":1,"syntology":null},{"url":"/paper/190411800","slug":"190411800","title":"Adaptive Matrix Completion for the Users and the Items in Tail","date":"2019-04-22","arxiv_id":"1904.11800","repositories_listed":1,"syntology":null},{"url":"/paper/on-low-rank-trace-regression-under-general","slug":"on-low-rank-trace-regression-under-general","title":"On Low-rank Trace Regression under General Sampling Distribution","date":"2019-04-18","arxiv_id":"1904.08576","repositories_listed":1,"syntology":null},{"url":"/paper/state-building-through-public-land-disposal","slug":"state-building-through-public-land-disposal","title":"State-Building through Public Land Disposal? An Application of Matrix Completion for Counterfactual Prediction","date":"2019-03-19","arxiv_id":"1903.08028","repositories_listed":1,"syntology":null},{"url":"/paper/low-rank-tensor-completion-via-tensor-ring","slug":"low-rank-tensor-completion-via-tensor-ring","title":"Provable Tensor Ring Completion","date":"2019-03-08","arxiv_id":"1903.03315","repositories_listed":1,"syntology":null},{"url":"/paper/matrix-completion-via-nonconvex","slug":"matrix-completion-via-nonconvex","title":"Matrix Completion via Nonconvex Regularization: Convergence of the Proximal Gradient Algorithm","date":"2019-03-02","arxiv_id":"1903.00702","repositories_listed":1,"syntology":null},{"url":"/paper/phaseless-low-rank-matrix-recovery-and","slug":"phaseless-low-rank-matrix-recovery-and","title":"Provable Low Rank Phase Retrieval","date":"2019-02-13","arxiv_id":"1902.04972","repositories_listed":1,"syntology":null},{"url":"/paper/imputation-and-low-rank-estimation-with","slug":"imputation-and-low-rank-estimation-with","title":"Imputation and low-rank estimation with Missing Not At Random data","date":"2018-12-29","arxiv_id":"1812.11409","repositories_listed":1,"syntology":null},{"url":"/paper/deep-collective-matrix-factorization-for","slug":"deep-collective-matrix-factorization-for","title":"Deep Collective Matrix Factorization for Augmented Multi-View Learning","date":"2018-11-28","arxiv_id":"1811.11427","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-graph-convolutional-neural-networks","slug":"bayesian-graph-convolutional-neural-networks","title":"Bayesian graph convolutional neural networks for semi-supervised classification","date":"2018-11-27","arxiv_id":"1811.11103","repositories_listed":1,"syntology":{"n":16,"n_ran":13,"n_constructed":0,"n_ran_checked":12,"n_instrument":1,"n_unverified":3,"n_honours":3,"n_violates":3,"n_no_contract":6,"n_pointer_only":16,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 3 honoured, 3 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/bayesian-graph-convolutional-neural-networks#ran","syntology_url":"https://syntology.ai/paper/1811.11103","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.11103"}},"official":null}},{"url":"/paper/faster-matrix-completion-using-randomized-svd","slug":"faster-matrix-completion-using-randomized-svd","title":"Faster Matrix Completion Using Randomized SVD","date":"2018-10-16","arxiv_id":"1810.06860","repositories_listed":1,"syntology":null},{"url":"/paper/subspace-tracking-from-missing-and-outlier","slug":"subspace-tracking-from-missing-and-outlier","title":"Provable Subspace Tracking from Missing Data and Matrix Completion","date":"2018-10-06","arxiv_id":"1810.03051","repositories_listed":1,"syntology":null},{"url":"/paper/training-complex-models-with-multi-task-weak","slug":"training-complex-models-with-multi-task-weak","title":"Training Complex Models with Multi-Task Weak Supervision","date":"2018-10-05","arxiv_id":"1810.02840","repositories_listed":1,"syntology":null},{"url":"/paper/savoias-a-diverse-multi-category-visual","slug":"savoias-a-diverse-multi-category-visual","title":"SAVOIAS: A Diverse, Multi-Category Visual Complexity Dataset","date":"2018-10-03","arxiv_id":"1810.01771","repositories_listed":1,"syntology":null},{"url":"/paper/longitudinal-data-analysis-using-matrix","slug":"longitudinal-data-analysis-using-matrix","title":"Modeling longitudinal data using matrix completion","date":"2018-09-24","arxiv_id":"1809.08771","repositories_listed":1,"syntology":null},{"url":"/paper/nonconvex-regularization-based-sparse-and-low","slug":"nonconvex-regularization-based-sparse-and-low","title":"A Survey on Nonconvex Regularization Based Sparse and Low-Rank Recovery in Signal Processing, Statistics, and Machine Learning","date":"2018-08-16","arxiv_id":"1808.05403","repositories_listed":1,"syntology":null},{"url":"/paper/oboe-collaborative-filtering-for-automl","slug":"oboe-collaborative-filtering-for-automl","title":"OBOE: Collaborative Filtering for AutoML Model Selection","date":"2018-08-09","arxiv_id":"1808.03233","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/oboe-collaborative-filtering-for-automl#ran","syntology_url":"https://syntology.ai/paper/1808.03233","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1808.03233"}},"official":{"repos":["udellgroup/oboe"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/collective-matrix-completion","slug":"collective-matrix-completion","title":"Collective Matrix Completion","date":"2018-07-24","arxiv_id":"1807.09010","repositories_listed":1,"syntology":null},{"url":"/paper/a-unified-framework-for-structured-low-rank","slug":"a-unified-framework-for-structured-low-rank","title":"A Unified Framework for Structured Low-rank Matrix Learning","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/causal-inference-with-noisy-and-missing","slug":"causal-inference-with-noisy-and-missing","title":"Causal Inference with Noisy and Missing Covariates via Matrix Factorization","date":"2018-06-03","arxiv_id":"1806.00811","repositories_listed":1,"syntology":null},{"url":"/paper/k-space-deep-learning-for-accelerated-mri","slug":"k-space-deep-learning-for-accelerated-mri","title":"k-Space Deep Learning for Accelerated MRI","date":"2018-05-10","arxiv_id":"1805.03779","repositories_listed":1,"syntology":null},{"url":"/paper/deep-models-of-interactions-across-sets","slug":"deep-models-of-interactions-across-sets","title":"Deep Models of Interactions Across Sets","date":"2018-03-07","arxiv_id":"1803.02879","repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-sample-efficient-inductive-matrix","slug":"fast-and-sample-efficient-inductive-matrix","title":"Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase Procrustes Flow","date":"2018-03-03","arxiv_id":"1803.01233","repositories_listed":1,"syntology":null},{"url":"/paper/ngs-based-haplotype-assembly-using-matrix","slug":"ngs-based-haplotype-assembly-using-matrix","title":"NGS Based Haplotype Assembly Using Matrix Completion","date":"2018-01-30","arxiv_id":"1801.09864","repositories_listed":1,"syntology":null},{"url":"/paper/matrix-norm-estimation-from-a-few-entries","slug":"matrix-norm-estimation-from-a-few-entries","title":"Matrix Norm Estimation from a Few Entries","date":"2017-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/sweetrs-dataset-for-a-recommender-systems-of","slug":"sweetrs-dataset-for-a-recommender-systems-of","title":"SweetRS: Dataset for a recommender systems of sweets","date":"2017-09-10","arxiv_id":"1709.03496","repositories_listed":1,"syntology":null},{"url":"/paper/vigan-missing-view-imputation-with-generative","slug":"vigan-missing-view-imputation-with-generative","title":"VIGAN: Missing View Imputation with Generative Adversarial Networks","date":"2017-08-22","arxiv_id":"1708.06724","repositories_listed":1,"syntology":null},{"url":"/paper/algebraic-variety-models-for-high-rank-matrix","slug":"algebraic-variety-models-for-high-rank-matrix","title":"Algebraic Variety Models for High-Rank Matrix Completion","date":"2017-03-28","arxiv_id":"1703.09631","repositories_listed":1,"syntology":null},{"url":"/paper/riemannian-stochastic-variance-reduced-1","slug":"riemannian-stochastic-variance-reduced-1","title":"Riemannian stochastic variance reduced gradient algorithm with retraction and vector transport","date":"2017-02-18","arxiv_id":"1702.05594","repositories_listed":1,"syntology":null},{"url":"/paper/generalizing-to-unseen-entities-and-entity","slug":"generalizing-to-unseen-entities-and-entity","title":"Generalizing to Unseen Entities and Entity Pairs with Row-less Universal Schema","date":"2016-06-18","arxiv_id":"1606.05804","repositories_listed":1,"syntology":null},{"url":"/paper/recognizing-emotions-from-abstract-paintings","slug":"recognizing-emotions-from-abstract-paintings","title":"Recognizing Emotions From Abstract Paintings Using Non-Linear Matrix Completion","date":"2016-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/high-resolution-neural-connectivity-from","slug":"high-resolution-neural-connectivity-from","title":"High resolution neural connectivity from incomplete tracing data using nonnegative spline regression","date":"2016-05-24","arxiv_id":"1605.08031","repositories_listed":1,"syntology":null},{"url":"/paper/riemannian-stochastic-variance-reduced","slug":"riemannian-stochastic-variance-reduced","title":"Riemannian stochastic variance reduced gradient on Grassmann manifold","date":"2016-05-24","arxiv_id":"1605.07367","repositories_listed":1,"syntology":null},{"url":"/paper/dictionary-learning-for-massive-matrix","slug":"dictionary-learning-for-massive-matrix","title":"Dictionary Learning for Massive Matrix Factorization","date":"2016-05-03","arxiv_id":"1605.00937","repositories_listed":1,"syntology":null},{"url":"/paper/depth-image-inpainting-improving-low-rank","slug":"depth-image-inpainting-improving-low-rank","title":"Depth Image Inpainting: Improving Low Rank Matrix Completion with Low Gradient Regularization","date":"2016-04-20","arxiv_id":"1604.05817","repositories_listed":1,"syntology":null},{"url":"/paper/song-recommendation-with-non-negative-matrix","slug":"song-recommendation-with-non-negative-matrix","title":"Song Recommendation with Non-Negative Matrix Factorization and Graph Total Variation","date":"2016-01-08","arxiv_id":"1601.01892","repositories_listed":1,"syntology":null},{"url":"/paper/bayesian-matrix-completion-via-adaptive","slug":"bayesian-matrix-completion-via-adaptive","title":"Bayesian Matrix Completion via Adaptive Relaxed Spectral Regularization","date":"2015-12-03","arxiv_id":"1512.01110","repositories_listed":1,"syntology":null},{"url":"/paper/fast-low-rank-matrix-learning-with-nonconvex","slug":"fast-low-rank-matrix-learning-with-nonconvex","title":"Fast Low-Rank Matrix Learning with Nonconvex Regularization","date":"2015-12-03","arxiv_id":"1512.00984","repositories_listed":1,"syntology":null},{"url":"/paper/decomposition-into-low-rank-plus-additive","slug":"decomposition-into-low-rank-plus-additive","title":"Decomposition into Low-rank plus Additive Matrices for Background/Foreground Separation: A Review for a Comparative Evaluation with a Large-Scale Dataset","date":"2015-11-04","arxiv_id":"1511.01245","repositories_listed":1,"syntology":null},{"url":"/paper/preference-completion-large-scale","slug":"preference-completion-large-scale","title":"Preference Completion: Large-scale Collaborative Ranking from Pairwise Comparisons","date":"2015-07-16","arxiv_id":"1507.04457","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/preference-completion-large-scale#ran","syntology_url":"https://syntology.ai/paper/1507.04457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1507.04457"}},"official":null}},{"url":"/paper/generalized-low-rank-models","slug":"generalized-low-rank-models","title":"Generalized Low Rank Models","date":"2014-10-01","arxiv_id":"1410.0342","repositories_listed":1,"syntology":null},{"url":"/paper/distant-supervision-for-relation-extraction-4","slug":"distant-supervision-for-relation-extraction-4","title":"Distant Supervision for Relation Extraction with Matrix Completion","date":"2014-06-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/orthogonal-rank-one-matrix-pursuit-for-low","slug":"orthogonal-rank-one-matrix-pursuit-for-low","title":"Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix Completion","date":"2014-04-04","arxiv_id":"1404.1377","repositories_listed":1,"syntology":null},{"url":"/paper/online-robust-subspace-tracking-from-partial","slug":"online-robust-subspace-tracking-from-partial","title":"Online Robust Subspace Tracking from Partial Information","date":"2011-09-18","arxiv_id":"1109.3827","repositories_listed":1,"syntology":null},{"url":"/paper/robust-pca-via-outlier-pursuit","slug":"robust-pca-via-outlier-pursuit","title":"Robust PCA via Outlier Pursuit","date":"2010-10-20","arxiv_id":"1010.4237","repositories_listed":1,"syntology":null},{"url":"/paper/online-identification-and-tracking-of","slug":"online-identification-and-tracking-of","title":"Online Identification and Tracking of Subspaces from Highly Incomplete Information","date":"2010-06-21","arxiv_id":"1006.4046","repositories_listed":1,"syntology":null},{"url":"/paper/a-gradient-descent-algorithm-on-the-grassman","slug":"a-gradient-descent-algorithm-on-the-grassman","title":"A Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion","date":"2009-10-27","arxiv_id":"0910.5260","repositories_listed":1,"syntology":null},{"url":"/paper/guaranteed-rank-minimization-via-singular","slug":"guaranteed-rank-minimization-via-singular","title":"Guaranteed Rank Minimization via Singular Value Projection","date":"2009-09-30","arxiv_id":"0909.5457","repositories_listed":1,"syntology":null},{"url":"/paper/matrix-completion-from-noisy-entries","slug":"matrix-completion-from-noisy-entries","title":"Matrix Completion from Noisy Entries","date":"2009-06-11","arxiv_id":"0906.2027","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/matrix-completion-from-noisy-entries#ran","syntology_url":"https://syntology.ai/paper/0906.2027","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"0906.2027"}},"official":null}},{"url":"/paper/matrix-completion-from-a-few-entries","slug":"matrix-completion-from-a-few-entries","title":"Matrix Completion from a Few Entries","date":"2009-01-20","arxiv_id":"0901.3150","repositories_listed":1,"syntology":null},{"url":null,"slug":"new-hardness-results-for-low-rank-matrix","title":"New Hardness Results for Low-Rank Matrix Completion","date":"2025-06-23","arxiv_id":"2506.18440","repositories_listed":0,"syntology":null},{"url":null,"slug":"covariate-adjusted-deep-causal-learning-for","title":"Covariate-Adjusted Deep Causal Learning for Heterogeneous Panel Data Models","date":"2025-05-26","arxiv_id":"2505.20536","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-transport-with-heterogeneously","title":"Optimal Transport with Heterogeneously Missing Data","date":"2025-05-22","arxiv_id":"2505.17291","repositories_listed":0,"syntology":null},{"url":null,"slug":"rgnmr-a-gauss-newton-method-for-robust-matrix","title":"RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees","date":"2025-05-19","arxiv_id":"2505.12919","repositories_listed":0,"syntology":null},{"url":null,"slug":"euclidean-distance-matrix-completion-via","title":"Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent","date":"2025-04-28","arxiv_id":"2504.19530","repositories_listed":0,"syntology":null},{"url":null,"slug":"altgdmin-alternating-gd-and-minimization-for","title":"AltGDmin: Alternating GD and Minimization for Partly-Decoupled (Federated) Optimization","date":"2025-04-20","arxiv_id":"2504.14741","repositories_listed":0,"syntology":null},{"url":null,"slug":"truncated-matrix-completion-an-empirical","title":"Truncated Matrix Completion - An Empirical Study","date":"2025-04-14","arxiv_id":"2504.09873","repositories_listed":0,"syntology":null},{"url":null,"slug":"computational-efficient-informative","title":"Computational Efficient Informative Nonignorable Matrix Completion: A Row- and Column-Wise Matrix U-Statistic Pseudo-Likelihood Approach","date":"2025-04-05","arxiv_id":"2504.04016","repositories_listed":0,"syntology":null},{"url":null,"slug":"depth-aided-color-image-inpainting-in","title":"Depth-Aided Color Image Inpainting in Quaternion Domain","date":"2025-03-21","arxiv_id":"2503.16818","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-two-photon-microscopy-by-neuroimaging","title":"Fast Two-photon Microscopy by Neuroimaging with Oblong Random Acquisition (NORA)","date":"2025-03-19","arxiv_id":"2503.15487","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-linearized-alternating-direction-multiplier","title":"A Linearized Alternating Direction Multiplier Method for Federated Matrix Completion Problems","date":"2025-03-17","arxiv_id":"2503.12733","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-transfer-learning-for-missing-not-at","title":"Optimal Transfer Learning for Missing Not-at-Random Matrix Completion","date":"2025-02-28","arxiv_id":"2503.00174","repositories_listed":0,"syntology":null},{"url":null,"slug":"recommendations-from-sparse-comparison-data","title":"Recommendations from Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization","date":"2025-02-27","arxiv_id":"2502.20033","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-geometric-approach-to-personalized","title":"A Geometric Approach to Personalized Recommendation with Set-Theoretic Constraints Using Box Embeddings","date":"2025-02-15","arxiv_id":"2502.10875","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-with-graph-information-a","title":"Matrix Completion with Graph Information: A Provable Nonconvex Optimization Approach","date":"2025-02-12","arxiv_id":"2502.08536","repositories_listed":0,"syntology":null},{"url":null,"slug":"covariates-adjusted-mixed-membership","title":"Covariates-Adjusted Mixed-Membership Estimation: A Novel Network Model with Optimal Guarantees","date":"2025-02-10","arxiv_id":"2502.06671","repositories_listed":0,"syntology":null},{"url":null,"slug":"norm-bounded-low-rank-adaptation","title":"Norm-Bounded Low-Rank Adaptation","date":"2025-01-31","arxiv_id":"2501.19050","repositories_listed":0,"syntology":null},{"url":null,"slug":"faster-convergence-of-riemannian-stochastic","title":"Faster Convergence of Riemannian Stochastic Gradient Descent with Increasing Batch Size","date":"2025-01-30","arxiv_id":"2501.18164","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-in-group-testing-bounds-and","title":"Matrix Completion in Group Testing: Bounds and Simulations","date":"2025-01-23","arxiv_id":"2501.13780","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-egoistic-rigid-body-localization","title":"Robust Egoistic Rigid Body Localization","date":"2025-01-17","arxiv_id":"2501.10219","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-matrix-completion-and-realization-of","title":"Low rank matrix completion and realization of graphs: results and problems","date":"2025-01-10","arxiv_id":"2501.13935","repositories_listed":0,"syntology":null},{"url":null,"slug":"improved-approximation-algorithms-for-low","title":"Improved Approximation Algorithms for Low-Rank Problems Using Semidefinite Optimization","date":"2025-01-06","arxiv_id":"2501.02942","repositories_listed":0,"syntology":null},{"url":null,"slug":"deeply-learned-robust-matrix-completion-for","title":"Deeply Learned Robust Matrix Completion for Large-scale Low-rank Data Recovery","date":"2024-12-31","arxiv_id":"2501.00677","repositories_listed":0,"syntology":null},{"url":null,"slug":"matrix-completion-via-residual-spectral","title":"Matrix Completion via Residual Spectral Matching","date":"2024-12-13","arxiv_id":"2412.10005","repositories_listed":0,"syntology":null},{"url":null,"slug":"representational-transfer-learning-for-matrix","title":"Representational Transfer Learning for Matrix Completion","date":"2024-12-09","arxiv_id":"2412.06233","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-privacy-preserving-distributed-credible","title":"A privacy-preserving distributed credible evidence fusion algorithm for collective decision-making","date":"2024-12-03","arxiv_id":"2412.02130","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-channel-hypergraph-contrastive-learning","title":"Multi-Channel Hypergraph Contrastive Learning for Matrix Completion","date":"2024-11-02","arxiv_id":"2411.01376","repositories_listed":0,"syntology":null},{"url":"/paper/abrupt-learning-in-transformers-a-case-study","slug":"abrupt-learning-in-transformers-a-case-study","title":"Abrupt Learning in Transformers: A Case Study on Matrix Completion","date":"2024-10-29","arxiv_id":"2410.22244","repositories_listed":0,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/abrupt-learning-in-transformers-a-case-study#ran","syntology_url":"https://syntology.ai/paper/2410.22244","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2410.22244"}},"official":null}},{"url":null,"slug":"bayesian-collaborative-bandits-with-thompson","title":"Bayesian Collaborative Bandits with Thompson Sampling for Improved Outreach in Maternal Health Program","date":"2024-10-28","arxiv_id":"2410.21405","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-rank-bayesian-matrix-completion-via","title":"Low-rank Bayesian matrix completion via geodesic Hamiltonian Monte Carlo on Stiefel manifolds","date":"2024-10-27","arxiv_id":"2410.20318","repositories_listed":0,"syntology":null},{"url":null,"slug":"hierarchical-matrix-completion-for-the","title":"Hierarchical Matrix Completion for the Prediction of Properties of Binary Mixtures","date":"2024-10-08","arxiv_id":"2410.06060","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-optimization-for-non-convex","title":"Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees","date":"2024-10-08","arxiv_id":"2410.06376","repositories_listed":0,"syntology":null},{"url":null,"slug":"tailed-low-rank-matrix-factorization-for","title":"Tailed Low-Rank Matrix Factorization for Similarity Matrix Completion","date":"2024-09-29","arxiv_id":"2409.19550","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-proximal-modified-quasi-newton-method-for","title":"A Proximal Modified Quasi-Newton Method for Nonsmooth Regularized Optimization","date":"2024-09-28","arxiv_id":"2409.19428","repositories_listed":0,"syntology":null},{"url":null,"slug":"entry-specific-matrix-estimation-under","title":"Entry-Specific Matrix Estimation under Arbitrary Sampling Patterns through the Lens of Network Flows","date":"2024-09-06","arxiv_id":"2409.03980","repositories_listed":0,"syntology":null},{"url":null,"slug":"negative-binomial-matrix-completion","title":"Negative Binomial Matrix Completion","date":"2024-08-28","arxiv_id":"2408.16113","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-singular-value-decomposition","title":"Decentralized Singular Value Decomposition for Large-scale Distributed Sensor Networks","date":"2024-08-26","arxiv_id":"2408.14292","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-matrix-completion-a-collaborative","title":"Online Matrix Completion: A Collaborative Approach with Hott Items","date":"2024-08-11","arxiv_id":"2408.05843","repositories_listed":0,"syntology":null},{"url":null,"slug":"leave-one-out-analysis-for-nonconvex-robust","title":"Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions","date":"2024-07-28","arxiv_id":"2407.19446","repositories_listed":0,"syntology":null},{"url":null,"slug":"advancing-thermodynamic-group-contribution","title":"Advancing Thermodynamic Group-Contribution Methods by Machine Learning: UNIFAC 2.0","date":"2024-07-25","arxiv_id":"2408.05220","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-low-rank-matrix-completion-model","title":"Generalized Low-Rank Matrix Completion Model with Overlapping Group Error Representation","date":"2024-07-11","arxiv_id":"2407.08517","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-heterogeneous-impact-of-the-eu-canada","title":"The heterogeneous impact of the EU-Canada agreement with causal machine learning","date":"2024-07-10","arxiv_id":"2407.07652","repositories_listed":0,"syntology":null},{"url":null,"slug":"amplify-graph-learning-for-recommendation-via","title":"Amplify Graph Learning for Recommendation via Sparsity Completion","date":"2024-06-27","arxiv_id":"2406.18984","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimized-waveform-design-for-ofdm-based-isac","title":"Optimized Waveform Design for OFDM-based ISAC Systems Under Limited Resource Occupancy","date":"2024-06-27","arxiv_id":"2406.19036","repositories_listed":0,"syntology":null},{"url":null,"slug":"demystifying-forgetting-in-language-model","title":"Demystifying Language Model Forgetting with Low-rank Example Associations","date":"2024-06-20","arxiv_id":"2406.14026","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-translations-via-matrix-completion-1","title":"Learning Translations via Matrix Completion","date":"2024-06-19","arxiv_id":"2406.13195","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-iterative-reasoning-through-energy-1","title":"Learning Iterative Reasoning through Energy Diffusion","date":"2024-06-17","arxiv_id":"2406.11179","repositories_listed":0,"syntology":null}],"record_sha256":"1cf5e337b0c690e4bd06a4031e3627fefc5e9e7f4040cf66714cfd2ecf8d8b7d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}