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 1–50 of 158 papers

TitleStatusHype
Efficient Minimum Bayes Risk Decoding using Low-Rank Matrix Completion AlgorithmsCode2
Deep Generalization of Structured Low-Rank Algorithms (Deep-SLR)Code1
Randomized Approach to Matrix Completion: Applications in Collaborative Filtering and Image InpaintingCode1
Guaranteed Tensor Recovery Fused Low-rankness and SmoothnessCode1
Compressible Dynamics in Deep Overparameterized Low-Rank Learning & AdaptationCode1
Escaping Saddle Points in Ill-Conditioned Matrix Completion with a Scalable Second Order MethodCode1
A Scalable Second Order Method for Ill-Conditioned Matrix Completion from Few SamplesCode1
Teaching Arithmetic to Small TransformersCode1
Linear Recursive Feature Machines provably recover low-rank matricesCode1
Generalized Nonconvex Approach for Low-Tubal-Rank Tensor RecoveryCode1
Adaptive Matrix Completion for the Users and the Items in TailCode0
Algebraic Variety Models for High-Rank Matrix CompletionCode0
Structured Low-Rank Algorithms: Theory, MR Applications, and Links to Machine LearningCode0
Efficient Compression of Overparameterized Deep Models through Low-Dimensional Learning DynamicsCode0
Depth Image Inpainting: Improving Low Rank Matrix Completion with Low Gradient RegularizationCode0
Riemannian stochastic variance reduced gradient algorithm with retraction and vector transportCode0
Mixed Membership Graph Clustering via Systematic Edge QueryCode0
Guaranteed Rank Minimization via Singular Value ProjectionCode0
Riemannian stochastic variance reduced gradient on Grassmann manifoldCode0
Provable Subspace Tracking from Missing Data and Matrix CompletionCode0
A Gradient Descent Algorithm on the Grassman Manifold for Matrix CompletionCode0
Efficient and Robust Freeway Traffic Speed Estimation under Oblique Grid using Vehicle Trajectory DataCode0
Simulation comparisons between Bayesian and de-biased estimators in low-rank matrix completionCode0
Collaborative Filtering with Graph Information: Consistency and Scalable MethodsCode0
GNMR: A provable one-line algorithm for low rank matrix recoveryCode0
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 1 of 4Next →

No leaderboard results yet.