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
Efficient Compression of Overparameterized Deep Models through Low-Dimensional Learning DynamicsCode0
A framework to generate sparsity-inducing regularizers for enhanced low-rank matrix completion—0
Robust Low-Rank Matrix Completion via a New Sparsity-Inducing Regularizer—0
Matrix Completion in Almost-Verification Time—0
Data-based system representations from irregularly measured data—0
Teaching Arithmetic to Small TransformersCode1
Non-Convex Optimizations for Machine Learning with Theoretical Guarantee: Robust Matrix Completion and Neural Network Learning—0
Graph-Based Matrix Completion Applied to Weather Data—0
Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation—0
Matrix Completion from General Deterministic Sampling Patterns—0
Spectal Harmonics: Bridging Spectral Embedding and Matrix Completion in Self-Supervised Learning—0
Disjunctive Branch-And-Bound for Certifiably Optimal Low-Rank Matrix Completion—0
A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion—0
Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time—0
Guaranteed Tensor Recovery Fused Low-rankness and SmoothnessCode1
Learning Transition Operators From Sparse Space-Time Samples—0
Low-Rank Covariance Completion for Graph Quilting with Applications to Functional Connectivity—0
Online Low Rank Matrix Completion—0
Generalized Nonconvex Approach for Low-Tubal-Rank Tensor RecoveryCode1
Introducing the Huber mechanism for differentially private low-rank matrix completion—0
Robust Matrix Completion with Heavy-tailed Noise—0
Bayesian Low-rank Matrix Completion with Dual-graph Embedding: Prior Analysis and Tuning-free Inference—0
Adaptive Noisy Matrix Completion—0
High Dimensional Statistical Estimation under Uniformly Dithered One-bit Quantization—0
Variational Bayesian Filtering with Subspace Information for Extreme Spatio-Temporal Matrix Completion—0
Show:102550
← PrevPage 2 of 7Next →

No leaderboard results yet.