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
Linear Recursive Feature Machines provably recover low-rank matricesCode1
Randomized Approach to Matrix Completion: Applications in Collaborative Filtering and Image InpaintingCode1
Compressible Dynamics in Deep Overparameterized Low-Rank Learning & AdaptationCode1
Deep Generalization of Structured Low-Rank Algorithms (Deep-SLR)Code1
Teaching Arithmetic to Small TransformersCode1
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
Generalized Nonconvex Approach for Low-Tubal-Rank Tensor RecoveryCode1
Guaranteed Tensor Recovery Fused Low-rankness and SmoothnessCode1
A divide-and-conquer algorithm for binary matrix completion—0
Ad Hoc Microphone Array Calibration: Euclidean Distance Matrix Completion Algorithm and Theoretical Guarantees—0
AltGDmin: Alternating GD and Minimization for Partly-Decoupled (Federated) Optimization—0
A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion—0
Algebraic-Combinatorial Methods for Low-Rank Matrix Completion with Application to Athletic Performance Prediction—0
Accelerating Permutation Testing in Voxel-wise Analysis through Subspace Tracking: A new plugin for SnPM—0
Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low-Rank Matrix Completion—0
A Rank-Corrected Procedure for Matrix Completion with Fixed Basis Coefficients—0
Abrupt Learning in Transformers: A Case Study on Matrix Completion—0
A framework to generate sparsity-inducing regularizers for enhanced low-rank matrix completion—0
Double Weighted Truncated Nuclear Norm Regularization for Low-Rank Matrix Completion—0
Adaptive Noisy Matrix Completion—0
Efficient Federated Low Rank Matrix Completion—0
Asynchronous Parallel Learning for Neural Networks and Structured Models with Dense Features—0
Background Subtraction via Fast Robust Matrix Completion—0
Bayesian Learning for Low-Rank matrix reconstruction—0
Bayesian Low-rank Matrix Completion with Dual-graph Embedding: Prior Analysis and Tuning-free Inference—0
Bounded Manifold Completion—0
Spectal Harmonics: Bridging Spectral Embedding and Matrix Completion in Self-Supervised Learning—0
Coherence and sufficient sampling densities for reconstruction in compressed sensing—0
Efficiently escaping saddle points on manifolds—0
Entry-Specific Bounds for Low-Rank Matrix Completion under Highly Non-Uniform Sampling—0
An Extended Frank-Wolfe Method with "In-Face" Directions, and its Application to Low-Rank Matrix Completion—0
Decentralized Singular Value Decomposition for Large-scale Distributed Sensor Networks—0
Low-rank matrix completion theory via Plucker coordinates—0
Advancing Matrix Completion by Modeling Extra Structures beyond Low-Rankness—0
Deep learned SVT: Unrolling singular value thresholding to obtain better MSE—0
Depth Enhancement via Low-rank Matrix Completion—0
A Pre-training Oracle for Predicting Distances in Social Networks—0
Depth Restoration: A fast low-rank matrix completion via dual-graph regularization—0
Discrete Aware Matrix Completion via Convexized _0-Norm Approximation—0
A privacy-preserving distributed credible evidence fusion algorithm for collective decision-making—0
Data-based system representations from irregularly measured data—0
Effect of Beampattern on Matrix Completion with Sparse Arrays—0
Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation—0
A Riemannian gossip approach to subspace learning on Grassmann manifold—0
A New Retraction for Accelerating the Riemannian Three-Factor Low-Rank Matrix Completion Algorithm—0
Communication Efficient Parallel Algorithms for Optimization on Manifolds—0
Efficient Low-Rank Matrix Factorization based on l1,ε-norm for Online Background Subtraction—0
Relative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion—0
Show:102550
← PrevPage 1 of 4Next →

No leaderboard results yet.