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 601–650 of 796 papers

TitleStatusHype
Recognizing Emotions From Abstract Paintings Using Non-Linear Matrix CompletionCode0
Provable Efficient Online Matrix Completion via Non-convex Stochastic Gradient Descent—0
Fast Algorithms for Robust PCA via Gradient Descent—0
High resolution neural connectivity from incomplete tracing data using nonnegative spline regressionCode0
Riemannian stochastic variance reduced gradient on Grassmann manifoldCode0
Matrix Completion has No Spurious Local Minimum—0
A Riemannian gossip approach to decentralized matrix completion—0
Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entries—0
Convergence Analysis for Rectangular Matrix Completion Using Burer-Monteiro Factorization and Gradient Descent—0
A note on the statistical view of matrix completion—0
Dictionary Learning for Massive Matrix FactorizationCode0
Depth Image Inpainting: Improving Low Rank Matrix Completion with Low Gradient RegularizationCode0
Identifying global optimality for dictionary learning—0
1-bit Matrix Completion: PAC-Bayesian Analysis of a Variational Approximation—0
Removing Clouds and Recovering Ground Observations in Satellite Image Sequences via Temporally Contiguous Robust Matrix Completion—0
Unified View of Matrix Completion under General Structural Constraints—0
Scaled stochastic gradient descent for low-rank matrix completion—0
Graph clustering, variational image segmentation methods and Hough transform scale detection for object measurement in images—0
A Harmonic Extension Approach for Collaborative Ranking—0
Network Inference by Learned Node-Specific Degree Prior—0
Recovery guarantee of weighted low-rank approximation via alternating minimization—0
A Note on Alternating Minimization Algorithm for the Matrix Completion Problem—0
Log-Normal Matrix Completion for Large Scale Link Prediction—0
Top-N Recommender System via Matrix Completion—0
Subspace Clustering Based Tag Sharing for Inductive Tag Matrix Refinement with Complex Errors—0
Song Recommendation with Non-Negative Matrix Factorization and Graph Total VariationCode0
Fitting Spectral Decay with the k-Support Norm—0
Matrix Completion Under Monotonic Single Index Models—0
New Perspectives on k-Support and Cluster Norms—0
Pseudo-Bayesian Robust PCA: Algorithms and Analyses—0
Fast Optimization Algorithm on Riemannian Manifolds and Its Application in Low-Rank Representation—0
Bayesian Matrix Completion via Adaptive Relaxed Spectral RegularizationCode0
Fast Low-Rank Matrix Learning with Nonconvex RegularizationCode0
Collaborative Filtering with Graph Information: Consistency and Scalable MethodsCode0
Recognizing retinal ganglion cells in the dark—0
Matrix Completion with Noisy Side Information—0
Secrets of Matrix Factorization: Approximations, Numerics, Manifold Optimization and Random Restarts—0
Taming the Wild: A Unified Analysis of Hogwild-Style Algorithms—0
An Extended Frank-Wolfe Method with "In-Face" Directions, and its Application to Low-Rank Matrix Completion—0
Decomposition into Low-rank plus Additive Matrices for Background/Foreground Separation: A Review for a Comparative Evaluation with a Large-Scale DatasetCode0
Factorizing LambdaMART for cold start recommendations—0
The Singular Value Decomposition, Applications and Beyond—0
Minimax Lower Bounds for Noisy Matrix Completion Under Sparse Factor Models—0
Boolean Matrix Factorization and Noisy Completion via Message Passing—0
High-dimensional Time Series Prediction with Missing Values—0
Exponential Family Matrix Completion under Structural Constraints—0
Fast low-rank estimation by projected gradient descent: General statistical and algorithmic guarantees—0
Information-theoretic Bounds on Matrix Completion under Union of Subspaces Model—0
Regret Guarantees for Item-Item Collaborative Filtering—0
Preference Completion: Large-scale Collaborative Ranking from Pairwise ComparisonsCode0
Show:102550
← PrevPage 13 of 16Next →

No leaderboard results yet.