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 26–50 of 796 papers

TitleStatusHype
Robust Egoistic Rigid Body Localization—0
Low rank matrix completion and realization of graphs: results and problems—0
Improved Approximation Algorithms for Low-Rank Problems Using Semidefinite Optimization—0
Deeply Learned Robust Matrix Completion for Large-scale Low-rank Data Recovery—0
Robust Matrix Completion for Discrete Rating-Scale DataCode0
Matrix Completion via Residual Spectral Matching—0
Representational Transfer Learning for Matrix Completion—0
A privacy-preserving distributed credible evidence fusion algorithm for collective decision-making—0
On adaptivity and minimax optimality of two-sided nearest neighborsCode0
Efficient and Robust Freeway Traffic Speed Estimation under Oblique Grid using Vehicle Trajectory DataCode0
Multi-Channel Hypergraph Contrastive Learning for Matrix Completion—0
Abrupt Learning in Transformers: A Case Study on Matrix Completion—0
Bayesian Collaborative Bandits with Thompson Sampling for Improved Outreach in Maternal Health Program—0
Low-rank Bayesian matrix completion via geodesic Hamiltonian Monte Carlo on Stiefel manifolds—0
Distributional Matrix Completion via Nearest Neighbors in the Wasserstein SpaceCode0
Learning Counterfactual Distributions via Kernel Nearest NeighborsCode0
Can We Predict Performance of Large Models across Vision-Language Tasks?Code0
Hierarchical Matrix Completion for the Prediction of Properties of Binary Mixtures—0
Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees—0
Tailed Low-Rank Matrix Factorization for Similarity Matrix Completion—0
A Proximal Modified Quasi-Newton Method for Nonsmooth Regularized Optimization—0
Entry-Specific Matrix Estimation under Arbitrary Sampling Patterns through the Lens of Network Flows—0
Negative Binomial Matrix Completion—0
Decentralized Singular Value Decomposition for Large-scale Distributed Sensor Networks—0
Online Matrix Completion: A Collaborative Approach with Hott Items—0
Show:102550
← PrevPage 2 of 32Next →

No leaderboard results yet.