SOTAVerified

Low-Rank Matrix Completion

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

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 26–50 of 158 papers

TitleStatusHype
Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix CompletionCode0
Distant Supervision for Relation Extraction with Matrix CompletionCode0
Coherence and sufficient sampling densities for reconstruction in compressed sensing—0
Spectal Harmonics: Bridging Spectral Embedding and Matrix Completion in Self-Supervised Learning—0
A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion—0
Bounded Manifold Completion—0
Bayesian Low-rank Matrix Completion with Dual-graph Embedding: Prior Analysis and Tuning-free Inference—0
AltGDmin: Alternating GD and Minimization for Partly-Decoupled (Federated) Optimization—0
A divide-and-conquer algorithm for binary matrix completion—0
Bayesian Learning for Low-Rank matrix reconstruction—0
Background Subtraction via Fast Robust Matrix Completion—0
Asynchronous Parallel Learning for Neural Networks and Structured Models with Dense Features—0
Efficient Federated Low Rank Matrix Completion—0
Algebraic-Combinatorial Methods for Low-Rank Matrix Completion with Application to Athletic Performance Prediction—0
Ad Hoc Microphone Array Calibration: Euclidean Distance Matrix Completion Algorithm and Theoretical Guarantees—0
Accelerating Permutation Testing in Voxel-wise Analysis through Subspace Tracking: A new plugin for SnPM—0
Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation—0
A Riemannian gossip approach to subspace learning on Grassmann manifold—0
Effect of Beampattern on Matrix Completion with Sparse Arrays—0
Double Weighted Truncated Nuclear Norm Regularization for Low-Rank Matrix Completion—0
A Rank-Corrected Procedure for Matrix Completion with Fixed Basis Coefficients—0
Discrete Aware Matrix Completion via Convexized _0-Norm Approximation—0
A privacy-preserving distributed credible evidence fusion algorithm for collective decision-making—0
Efficient Low-Rank Matrix Factorization based on l1,ε-norm for Online Background Subtraction—0
Depth Restoration: A fast low-rank matrix completion via dual-graph regularization—0
Show:102550
← PrevPage 2 of 7Next →

No leaderboard results yet.