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 51–100 of 158 papers

TitleStatusHype
Efficient Low-Rank Matrix Factorization based on l1,ε-norm for Online Background Subtraction—0
Uncertainty Quantification For Low-Rank Matrix Completion With Heterogeneous and Sub-Exponential Noise—0
Reconstruction of Fragmented Trajectories of Collective Motion using Hadamard Deep Autoencoders—0
Weighted Low Rank Matrix Approximation and Acceleration—0
GNMR: A provable one-line algorithm for low rank matrix recoveryCode0
Reproducing Kernel Hilbert Space, Mercer's Theorem, Eigenfunctions, Nyström Method, and Use of Kernels in Machine Learning: Tutorial and Survey—0
A Pre-training Oracle for Predicting Distances in Social Networks—0
A Scalable Second Order Method for Ill-Conditioned Matrix Completion from Few SamplesCode1
Deep learned SVT: Unrolling singular value thresholding to obtain better MSE—0
Simulation comparisons between Bayesian and de-biased estimators in low-rank matrix completionCode0
Structure-Preserving Progressive Low-rank Image Completion for Defending Adversarial Attacks—0
Exact Linear Convergence Rate Analysis for Low-Rank Symmetric Matrix Completion via Gradient Descent—0
Sparse Array Beamformer Design for Active and Passive Sensing—0
Mixed Membership Graph Clustering via Systematic Edge QueryCode0
Optimum Codesign for Image Denoising Between Type-2 Fuzzy Identifier and Matrix Completion Denoiser—0
Escaping Saddle Points in Ill-Conditioned Matrix Completion with a Scalable Second Order MethodCode1
Robust Low-rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method—0
A Scalable, Adaptive and Sound Nonconvex Regularizer for Low-rank Matrix Completion—0
Riemannian Stochastic Proximal Gradient Methods for Nonsmooth Optimization over the Stiefel Manifold—0
Low-rank matrix completion theory via Plucker coordinates—0
Bounded Manifold Completion—0
Deep Generalization of Structured Low-Rank Algorithms (Deep-SLR)Code1
Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery—0
Structured Low-Rank Algorithms: Theory, MR Applications, and Links to Machine LearningCode0
The Sparse Reverse of Principal Component Analysis for Fast Low-Rank Matrix Completion—0
Low-rank matrix completion and denoising under Poisson noise—0
A divide-and-conquer algorithm for binary matrix completion—0
Depth Restoration: A fast low-rank matrix completion via dual-graph regularization—0
Efficiently escaping saddle points on manifolds—0
Guaranteed Matrix Completion Under Multiple Linear Transformations—0
Adaptive Matrix Completion for the Users and the Items in TailCode0
Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation—0
Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization—0
Double Weighted Truncated Nuclear Norm Regularization for Low-Rank Matrix Completion—0
Communication Efficient Parallel Algorithms for Optimization on Manifolds—0
Provable Subspace Tracking from Missing Data and Matrix CompletionCode0
Fusion Subspace Clustering: Full and Incomplete Data—0
Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval and Matrix Completion—0
Ranking Recovery from Limited Comparisons using Low-Rank Matrix Completion—0
Sparse Group Inductive Matrix Completion—0
Tensor Methods for Nonlinear Matrix Completion—0
Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-rank Matrix Completion—0
Leave-one-out Approach for Matrix Completion: Primal and Dual Analysis—0
Static and Dynamic Robust PCA and Matrix Completion: A Review—0
Structured low-rank matrix completion for forecasting in time series analysis—0
Learning Latent Features with Pairwise Penalties in Low-Rank Matrix Completion—0
On Deterministic Sampling Patterns for Robust Low-Rank Matrix Completion—0
Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval, Matrix Completion, and Blind Deconvolution—0
Background Subtraction via Fast Robust Matrix Completion—0
Fast Low-Rank Bayesian Matrix Completion with Hierarchical Gaussian Prior Models—0
Show:102550
← PrevPage 2 of 4Next →

No leaderboard results yet.