Browse State-of-the-Art › Low-Rank Matrix Completion
Low-Rank Matrix Completion
27 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
Low-Rank Matrix Completion is an important problem with several applications in areas such as recommendation systems, sketching, and quantum tomography. The goal in matrix completion is to recover a low rank matrix, given a small number of entries of the matrix.
Source: Universal Matrix Completion
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Papers archive 2025-07-28
archive papers tagged: 158 · with a code link: 27 · where Syntology ran a sample: 4 (3 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (4 of 158 tagged: 3 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)
Page 1 of 2: papers 1 to 100 of 158, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.
-
7 Sep 2020 2 repositories listedWe propose an iterative algorithm for low-rank matrix completion that can be interpreted as both an iteratively reweighted least squares (IRLS) algorithm and a saddle-escaping smoothing Newton method applied to a…
-
1 Dec 2015 2 repositories listedLow rank matrix completion plays a fundamental role in collaborative filtering applications, the key idea being that the variables lie in a smaller subspace than the ambient space.
-
6 Nov 2024 1 repository listedAccurately estimating spatiotemporal traffic states on freeways is a significant challenge due to limited sensor deployment and potential data corruption.
-
6 Jun 2024 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 1 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified (of 4 harvested samples) · 4 pointer-only (licence)In practice, we demonstrate the effectiveness of this approach for deep low-rank matrix completion as well as fine-tuning language models.
-
5 Jun 2024 1 repository listedOur experimental results on machine translation tasks demonstrate that the proposed method requires 1/16 utility metric computations compared to vanilla MBR decoding while achieving equal translation quality measured by…
-
4 Mar 2024 1 repository listedOur results show that CSMC provides solutions of the same quality as state-of-the-art matrix completion algorithms based on convex optimization, while achieving significant reductions in computational runtime.
-
9 Jan 2024 1 repository listed Syntology official (archive's flag): 1 ran · 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) · 2 unverified (of 3 harvested samples) · 3 pointer-only (licence)A possible explanation is that common training algorithms for neural networks implicitly perform dimensionality reduction - a process called feature learning.
-
8 Nov 2023 1 repository listedWe empirically evaluate the effectiveness of our compression technique on matrix recovery problems.
-
7 Jul 2023 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample)Even in the complete absence of pretraining, this approach significantly and simultaneously improves accuracy, sample complexity, and convergence speed.
-
4 Feb 2023 1 repository listedRecent research have made significant progress by adopting two insightful tensor priors, i. e., global low-rankness (L) and local smoothness (S) across different tensor modes, which are always encoded as a sum of two…
-
4 Aug 2022 1 repository listedThe tensor-tensor product-induced tensor nuclear norm (t-TNN) (Lu et al., 2020) minimization for low-tubal-rank tensor recovery attracts broad attention recently.
-
24 Jun 2021 1 repository listedLow rank matrix recovery problems, including matrix completion and matrix sensing, appear in a broad range of applications.
-
3 Jun 2021 1 repository listed Syntology official: not harvested · 0 ran · 5 unverified (of 5 harvested samples) · 5 pointer-only (licence)We propose an iterative algorithm for low-rank matrix completion that can be interpreted as an iteratively reweighted least squares (IRLS) algorithm, a saddle-escaping smoothing Newton method or a variable metric…
-
22 Mar 2021 1 repository listedIn this paper, we study the low-rank matrix completion problem, a class of machine learning problems, that aims at the prediction of missing entries in a partially observed matrix.
-
25 Nov 2020 1 repository listedThis work aims at learning mixed membership of nodes using queried edges.
-
7 Dec 2019 1 repository listedThe main challenge with this strategy is the high computational complexity of matrix completion.
-
27 Oct 2019 1 repository listedIn this survey, we provide a detailed review of recent advances in the recovery of continuous domain multidimensional signals from their few non-uniform (multichannel) measurements using structured low-rank matrix…
-
22 Apr 2019 1 repository listedIn this work, we show that the skewed distribution of ratings in the user-item rating matrix of real-world datasets affects the accuracy of matrix-completion-based approaches.
-
6 Oct 2018 1 repository listedIn this work, we show that a simple modification of our robust ST solution also provably solves ST-miss and robust ST-miss.
-
28 Mar 2017 1 repository listedWe consider a generalization of low-rank matrix completion to the case where the data belongs to an algebraic variety, i. e. each data point is a solution to a system of polynomial equations.
-
18 Feb 2017 1 repository listedIn recent years, stochastic variance reduction algorithms have attracted considerable attention for minimizing the average of a large but finite number of loss functions.
-
24 May 2016 1 repository listedIn this paper, we propose a novel Riemannian extension of the Euclidean stochastic variance reduced gradient algorithm (R-SVRG) to a compact manifold search space.
-
20 Apr 2016 1 repository listedThe proposed low gradient regularization is integrated with the low rank regularization into the low rank low gradient approach for depth image inpainting.
-
1 Jun 2014 1 repository listed
-
4 Apr 2014 1 repository listedNumerical results show that our proposed algorithm is more efficient than competing algorithms while achieving similar or better prediction performance.
-
27 Oct 2009 1 repository listedWe consider the problem of reconstructing a low-rank matrix from a small subset of its entries.
-
30 Sep 2009 1 repository listedMinimizing the rank of a matrix subject to affine constraints is a fundamental problem with many important applications in machine learning and statistics.
-
New Hardness Results for Low-Rank Matrix Completion23 Jun 2025 0 repositories listedThe low-rank matrix completion problem asks whether a given real matrix with missing values can be completed so that the resulting matrix has low rank or is close to a low-rank matrix.
-
AltGDmin: Alternating GD and Minimization for Partly-Decoupled (Federated) Optimization20 Apr 2025 0 repositories listedThis article describes a novel optimization solution framework, called alternating gradient descent (GD) and minimization (AltGDmin), that is useful for many problems for which alternating minimization (AltMin) is a…
-
Truncated Matrix Completion - An Empirical Study14 Apr 2025 0 repositories listedLow-rank Matrix Completion (LRMC) describes the problem where we wish to recover missing entries of partially observed low-rank matrix.
-
Norm-Bounded Low-Rank Adaptation31 Jan 2025 0 repositories listed
-
Faster Convergence of Riemannian Stochastic Gradient Descent with Increasing Batch Size30 Jan 2025 0 repositories listed
-
Low rank matrix completion and realization of graphs: results and problems10 Jan 2025 0 repositories listed
-
A privacy-preserving distributed credible evidence fusion algorithm for collective decision-making3 Dec 2024 0 repositories listed
-
29 Oct 2024 0 repositories listed Syntology 4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 4 harvested samples) · 4 pointer-only (licence)
-
Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees8 Oct 2024 0 repositories listed
-
Decentralized Singular Value Decomposition for Large-scale Distributed Sensor Networks26 Aug 2024 0 repositories listed
-
Online Matrix Completion: A Collaborative Approach with Hott Items11 Aug 2024 0 repositories listed
-
Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions28 Jul 2024 0 repositories listed
-
Generalized Low-Rank Matrix Completion Model with Overlapping Group Error Representation11 Jul 2024 0 repositories listed
-
Nonconvex Federated Learning on Compact Smooth Submanifolds With Heterogeneous Data12 Jun 2024 0 repositories listed
-
Symmetric Matrix Completion with ReLU Sampling9 Jun 2024 0 repositories listed
-
Efficient Federated Low Rank Matrix Completion10 May 2024 0 repositories listed
-
Discrete Aware Matrix Completion via Convexized ℓ₀-Norm Approximation3 May 2024 0 repositories listed
-
Entry-Specific Bounds for Low-Rank Matrix Completion under Highly Non-Uniform Sampling29 Feb 2024 0 repositories listed
-
Effect of Beampattern on Matrix Completion with Sparse Arrays12 Jan 2024 0 repositories listed
-
Harmonic Retrieval Using Weighted Lifted-Structure Low-Rank Matrix Completion8 Nov 2023 0 repositories listed
-
A framework to generate sparsity-inducing regularizers for enhanced low-rank matrix completion8 Oct 2023 0 repositories listed
-
Robust Low-Rank Matrix Completion via a New Sparsity-Inducing Regularizer7 Oct 2023 0 repositories listed
-
Matrix Completion in Almost-Verification Time7 Aug 2023 0 repositories listed
-
Data-based system representations from irregularly measured data21 Jul 2023 0 repositories listed
-
Non-Convex Optimizations for Machine Learning with Theoretical Guarantee: Robust Matrix Completion and Neural Network Learning28 Jun 2023 0 repositories listed
-
Graph-Based Matrix Completion Applied to Weather Data14 Jun 2023 0 repositories listed
-
Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation7 Jun 2023 0 repositories listed
-
Matrix Completion from General Deterministic Sampling Patterns4 Jun 2023 0 repositories listed
-
Spectal Harmonics: Bridging Spectral Embedding and Matrix Completion in Self-Supervised Learning31 May 2023 0 repositories listed
-
Disjunctive Branch-And-Bound for Certifiably Optimal Low-Rank Matrix Completion20 May 2023 0 repositories listed
-
A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion27 Apr 2023 0 repositories listed
-
Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time21 Feb 2023 0 repositories listed
-
Learning Transition Operators From Sparse Space-Time Samples1 Dec 2022 0 repositories listed
-
Low-Rank Covariance Completion for Graph Quilting with Applications to Functional Connectivity17 Sep 2022 0 repositories listed
-
Online Low Rank Matrix Completion8 Sep 2022 0 repositories listed
-
Introducing the Huber mechanism for differentially private low-rank matrix completion16 Jun 2022 0 repositories listed
-
Robust Matrix Completion with Heavy-tailed Noise9 Jun 2022 0 repositories listed
-
Bayesian Low-rank Matrix Completion with Dual-graph Embedding: Prior Analysis and Tuning-free Inference18 Mar 2022 0 repositories listed
-
Adaptive Noisy Matrix Completion16 Mar 2022 0 repositories listed
-
High Dimensional Statistical Estimation under Uniformly Dithered One-bit Quantization26 Feb 2022 0 repositories listed
-
Variational Bayesian Filtering with Subspace Information for Extreme Spatio-Temporal Matrix Completion20 Jan 2022 0 repositories listed
-
Efficient Low-Rank Matrix Factorization based on l1,ε-norm for Online Background Subtraction19 Nov 2021 0 repositories listed
-
Uncertainty Quantification For Low-Rank Matrix Completion With Heterogeneous and Sub-Exponential Noise22 Oct 2021 0 repositories listed
-
Reconstruction of Fragmented Trajectories of Collective Motion using Hadamard Deep Autoencoders20 Oct 2021 0 repositories listed
-
Weighted Low Rank Matrix Approximation and Acceleration22 Sep 2021 0 repositories listed
-
Reproducing Kernel Hilbert Space, Mercer's Theorem, Eigenfunctions, Nyström Method, and Use of Kernels in Machine Learning: Tutorial and Survey15 Jun 2021 0 repositories listed
-
A Pre-training Oracle for Predicting Distances in Social Networks6 Jun 2021 0 repositories listed
-
Deep learned SVT: Unrolling singular value thresholding to obtain better MSE14 May 2021 0 repositories listed
-
Structure-Preserving Progressive Low-rank Image Completion for Defending Adversarial Attacks4 Mar 2021 0 repositories listed
-
Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix Completion via Gradient Descent4 Feb 2021 0 repositories listed
-
Sparse Array Beamformer Design for Active and Passive Sensing18 Jan 2021 0 repositories listed
-
Optimum Codesign for Image Denoising Between Type-2 Fuzzy Identifier and Matrix Completion Denoiser13 Oct 2020 0 repositories listed
-
Robust Low-rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method18 Aug 2020 0 repositories listed
-
A Scalable, Adaptive and Sound Nonconvex Regularizer for Low-rank Matrix Completion14 Aug 2020 0 repositories listed
-
Riemannian Stochastic Proximal Gradient Methods for Nonsmooth Optimization over the Stiefel Manifold3 May 2020 0 repositories listed
-
Low-rank matrix completion theory via Plucker coordinates26 Apr 2020 0 repositories listed
-
Bounded Manifold Completion19 Dec 2019 0 repositories listed
-
Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery13 Nov 2019 0 repositories listed
-
The Sparse Reverse of Principal Component Analysis for Fast Low-Rank Matrix Completion4 Oct 2019 0 repositories listed
-
Low-rank matrix completion and denoising under Poisson noise11 Jul 2019 0 repositories listed
-
A divide-and-conquer algorithm for binary matrix completion9 Jul 2019 0 repositories listed
-
Depth Restoration: A fast low-rank matrix completion via dual-graph regularization5 Jul 2019 0 repositories listed
-
Efficiently escaping saddle points on manifolds10 Jun 2019 0 repositories listed
-
Guaranteed Matrix Completion Under Multiple Linear Transformations1 Jun 2019 0 repositories listed
-
Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation22 Apr 2019 0 repositories listed
-
Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization20 Feb 2019 0 repositories listed
-
Double Weighted Truncated Nuclear Norm Regularization for Low-Rank Matrix Completion7 Jan 2019 0 repositories listed
-
Communication Efficient Parallel Algorithms for Optimization on Manifolds26 Oct 2018 0 repositories listed
-
Fusion Subspace Clustering: Full and Incomplete Data2 Aug 2018 0 repositories listed
-
Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval and Matrix Completion1 Jul 2018 0 repositories listed
-
Ranking Recovery from Limited Comparisons using Low-Rank Matrix Completion14 Jun 2018 0 repositories listed
-
Sparse Group Inductive Matrix Completion27 Apr 2018 0 repositories listed
-
Tensor Methods for Nonlinear Matrix Completion26 Apr 2018 0 repositories listed
Syntology lines on 5 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections