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 151175 of 796 papers

TitleStatusHype
Optimal Algorithms for Latent Bandits with Cluster Structure0
Quantizing Heavy-tailed Data in Statistical Estimation: (Near) Minimax Rates, Covariate Quantization, and Uniform Recovery0
Rank-1 Matrix Completion with Gradient Descent and Small Random Initialization0
Generalization Bounds for Inductive Matrix Completion in Low-noise Settings0
Conditions for Estimation of Sensitivities of Voltage Magnitudes to Complex Power InjectionsCode0
Learning Transition Operators From Sparse Space-Time Samples0
Doubly robust nearest neighbors in factor models0
Multiple Imputation with Neural Network Gaussian Process for High-dimensional Incomplete DataCode0
Efficient Rigid Body Localization based on Euclidean Distance Matrix Completion for AGV Positioning under Harsh Environment0
Low Rank Quaternion Matrix Completion Based on Quaternion QR Decomposition and Sparse Regularizer0
Always Valid Risk Monitoring for Online Matrix Completion0
A Generalized Latent Factor Model Approach to Mixed-data Matrix Completion with Entrywise ConsistencyCode0
Hyperparameter optimization in deep multi-target predictionCode1
Deep Linear Networks for Matrix Completion -- An Infinite Depth Limit0
Graph Regularized Probabilistic Matrix Factorization for Drug-Drug Interactions Prediction0
A Sequence-Aware Recommendation Method Based on Complex Networks0
Bounded Simplex-Structured Matrix Factorization: Algorithms, Identifiability and ApplicationsCode0
Low-Rank Covariance Completion for Graph Quilting with Applications to Functional Connectivity0
Inductive Matrix Completion and Root-MUSIC-Based Channel Estimation for Intelligent Reflecting Surface (IRS)-Aided Hybrid MIMO Systems0
Synthesis of Sparse Linear Arrays via Low-Rank Hankel Matrix Completion0
SUPER-Rec: SUrrounding Position-Enhanced Representation for Recommendation0
Optimal (0,1)-Matrix Completion with Majorization Ordered Objectives (To the memory of Pravin Varaiya)0
Online Low Rank Matrix Completion0
Recursive Gaussian Process over graphs for Integrating Multi-timescale Measurements in Low-Observable Distribution Systems0
Partial Matrix Completion0
Show:102550
← PrevPage 7 of 32Next →

No leaderboard results yet.