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

Showing 76100 of 796 papers

TitleStatusHype
A regularized deep matrix factorized model of matrix completion for image restorationCode0
Deep Collective Matrix Factorization for Augmented Multi-View LearningCode0
Spectral Geometric Matrix CompletionCode0
DeepVir -- Graphical Deep Matrix Factorization for "In Silico" Antiviral Repositioning: Application to COVID-19Code0
Counterfactual inference for sequential experimentsCode0
Algebraic Variety Models for High-Rank Matrix CompletionCode0
Distant Supervision for Relation Extraction with Matrix CompletionCode0
Efficient and Robust Freeway Traffic Speed Estimation under Oblique Grid using Vehicle Trajectory DataCode0
Conditions for Estimation of Sensitivities of Voltage Magnitudes to Complex Power InjectionsCode0
Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient DescentCode0
Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust RecommendationCode0
Faster One-Sample Stochastic Conditional Gradient Method for Composite Convex MinimizationCode0
Fast Low-Rank Matrix Learning with Nonconvex RegularizationCode0
Decomposition into Low-rank plus Additive Matrices for Background/Foreground Separation: A Review for a Comparative Evaluation with a Large-Scale DatasetCode0
A Unified Framework for Structured Low-rank Matrix LearningCode0
Depth Image Inpainting: Improving Low Rank Matrix Completion with Low Gradient RegularizationCode0
CayleyNets: Graph Convolutional Neural Networks with Complex Rational Spectral FiltersCode0
A Gradient Descent Algorithm on the Grassman Manifold for Matrix CompletionCode0
Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form SolutionCode0
Collaborative Filtering with Graph Information: Consistency and Scalable MethodsCode0
A Perturbation Bound on the Subspace Estimator from Canonical ProjectionsCode0
Adaptively-weighted Nearest Neighbors for Matrix CompletionCode0
Imputation and low-rank estimation with Missing Not At Random dataCode0
Collective Matrix CompletionCode0
Bounded Simplex-Structured Matrix Factorization: Algorithms, Identifiability and ApplicationsCode0
Show:102550
← PrevPage 4 of 32Next →

No leaderboard results yet.