SOTAVerified

Matrix Completion

Matrix Completion is a method for recovering lost information. It originates from machine learning and usually deals with highly sparse matrices. Missing or unknown data is estimated using the low-rank matrix of the known data.

Source: A Fast Matrix-Completion-Based Approach for Recommendation Systems

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 1–50 of 796 papers

TitleStatusHype
Efficient Minimum Bayes Risk Decoding using Low-Rank Matrix Completion AlgorithmsCode2
Compressible Dynamics in Deep Overparameterized Low-Rank Learning & AdaptationCode1
Randomized Approach to Matrix Completion: Applications in Collaborative Filtering and Image InpaintingCode1
Linear Recursive Feature Machines provably recover low-rank matricesCode1
Teaching Arithmetic to Small TransformersCode1
Hyperparameter optimization in deep multi-target predictionCode1
Adaptive and Implicit Regularization for Matrix CompletionCode1
Sensing Theorems for Unsupervised Learning in Linear Inverse ProblemsCode1
Indiscriminate Poisoning Attacks on Unsupervised Contrastive LearningCode1
Detecting and Tracking Small and Dense Moving Objects in Satellite Videos: A BenchmarkCode1
AIR-Net: Adaptive and Implicit Regularization Neural Network for Matrix CompletionCode1
Causal Matrix CompletionCode1
GLocal-K: Global and Local Kernels for Recommender SystemsCode1
Inductive Matrix Completion Using Graph AutoencoderCode1
Simple, Fast, and Flexible Framework for Matrix Completion with Infinite Width Neural NetworksCode1
A Scalable Second Order Method for Ill-Conditioned Matrix Completion from Few SamplesCode1
Scalable and Explainable 1-Bit Matrix Completion via Graph Signal LearningCode1
Deep Permutation Equivariant Structure from MotionCode1
Adversarial Crowdsourcing Through Robust Rank-One Matrix CompletionCode1
Crosslingual Topic Modeling with WikiPDACode1
Escaping Saddle Points in Ill-Conditioned Matrix Completion with a Scalable Second Order MethodCode1
Compressed sensing of low-rank plus sparse matricesCode1
Towards Open-World Recommendation: An Inductive Model-based Collaborative Filtering ApproachCode1
Matrix Completion with Quantified Uncertainty through Low Rank Gaussian CopulaCode1
Accelerating Ill-Conditioned Low-Rank Matrix Estimation via Scaled Gradient DescentCode1
Simultaneous imputation and disease classification in incomplete medical datasets using Multigraph Geometric Matrix Completion (MGMC)Code1
Deep Generalization of Structured Low-Rank Algorithms (Deep-SLR)Code1
Inductive Matrix Completion Based on Graph Neural NetworksCode1
SAVOIAS: A Diverse, Multi-Category Visual Complexity DatasetCode1
OBOE: Collaborative Filtering for AutoML Model SelectionCode1
k-Space Deep Learning for Accelerated MRICode1
Graph Convolutional Matrix CompletionCode1
Geometric Matrix Completion with Recurrent Multi-Graph Neural NetworksCode1
Matrix Completion and Low-Rank SVD via Fast Alternating Least SquaresCode1
Generalized Low Rank ModelsCode1
New Hardness Results for Low-Rank Matrix Completion—0
Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust RecommendationCode0
N^2: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix CompletionCode0
Covariate-Adjusted Deep Causal Learning for Heterogeneous Panel Data Models—0
Optimal Transport with Heterogeneously Missing Data—0
RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees—0
Adaptively-weighted Nearest Neighbors for Matrix CompletionCode0
Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent—0
AltGDmin: Alternating GD and Minimization for Partly-Decoupled (Federated) Optimization—0
Truncated Matrix Completion - An Empirical Study—0
Computational Efficient Informative Nonignorable Matrix Completion: A Row- and Column-Wise Matrix U-Statistic Pseudo-Likelihood Approach—0
An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU functionCode0
Depth-Aided Color Image Inpainting in Quaternion Domain—0
Fast Two-photon Microscopy by Neuroimaging with Oblong Random Acquisition (NORA)—0
A Linearized Alternating Direction Multiplier Method for Federated Matrix Completion Problems—0
Show:102550
← PrevPage 1 of 16Next →

No leaderboard results yet.