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 451–500 of 796 papers

TitleStatusHype
Collective Matrix CompletionCode0
Unsupervised Metric Learning in Presence of Missing DataCode0
A Unified Framework for Sparse Relaxed Regularized Regression: SR3—0
Scalable Recommender Systems through Recursive Evidence Chains—0
Regularizing Autoencoder-Based Matrix Completion Models via Manifold Learning—0
A Primal-Dual Analysis of Global Optimality in Nonconvex Low-Rank Matrix Recovery—0
A Unified Framework for Structured Low-rank Matrix Learning—0
Implicit Regularization in Nonconvex Statistical Estimation: Gradient Descent Converges Linearly for Phase Retrieval and Matrix Completion—0
Matrix Completion from Non-Uniformly Sampled Entries—0
Ranking Recovery from Limited Comparisons using Low-Rank Matrix Completion—0
Matrix Completion and Performance Guarantees for Single Individual Haplotyping—0
Causal Inference with Noisy and Missing Covariates via Matrix FactorizationCode0
k-Space Deep Learning for Reference-free EPI Ghost Correction—0
Nonlinear Inductive Matrix Completion based on One-layer Neural Networks—0
Scalable and Robust Community Detection with Randomized Sketching—0
Matrix Co-completion for Multi-label Classification with Missing Features and Labels—0
Communication-Efficient Projection-Free Algorithm for Distributed Optimization—0
Transduction with Matrix Completion Using Smoothed Rank Function—0
Projection-Free Bandit Convex Optimization—0
Extendable Neural Matrix Completion—0
k-Space Deep Learning for Accelerated MRICode1
Sparse Group Inductive Matrix Completion—0
Tensor Methods for Nonlinear Matrix Completion—0
Parametric Models for Mutual Kernel Matrix Completion—0
Exact Reconstruction of Euclidean Distance Geometry Problem Using Low-rank Matrix Completion—0
Multi-modal Disease Classification in Incomplete Datasets Using Geometric Matrix Completion—0
Non-Convex Matrix Completion Against a Semi-Random Adversary—0
Tensor graph convolutional neural network—0
Leave-one-out Approach for Matrix Completion: Primal and Dual Analysis—0
Approximate Method of Variational Bayesian Matrix Factorization/Completion with Sparse Prior—0
Binary Matrix Completion Using Unobserved Entries—0
Deep Models of Interactions Across SetsCode0
Fast and Sample Efficient Inductive Matrix Completion via Multi-Phase Procrustes FlowCode0
Matrices with Gaussian noise: optimal estimates for singular subspace perturbation—0
Convolutional Geometric Matrix Completion—0
Smoothed analysis for low-rank solutions to semidefinite programs in quadratic penalty form—0
Static and Dynamic Robust PCA and Matrix Completion: A Review—0
Sequence-Aware Recommender SystemsCode0
Structured low-rank matrix completion for forecasting in time series analysis—0
Nonparametric Estimation of Low Rank Matrix Valued Function—0
Learning Latent Features with Pairwise Penalties in Low-Rank Matrix Completion—0
Active Feature Acquisition with Supervised Matrix Completion—0
Large-Scale Sparse Inverse Covariance Estimation via Thresholding and Max-Det Matrix Completion—0
Matrix completion with deterministic pattern - a geometric perspective—0
NGS Based Haplotype Assembly Using Matrix CompletionCode0
Matrix Completion for Structured Observations—0
Matrix Completion with Nonconvex Regularization: Spectral Operators and Scalable Algorithms—0
Indian Regional Movie Dataset for Recommender SystemsCode0
CAYLEYNETS: SPECTRAL GRAPH CNNS WITH COMPLEX RATIONAL FILTERS—0
Differentially Private Matrix Completion Revisited—0
Show:102550
← PrevPage 10 of 16Next →

No leaderboard results yet.