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

TitleStatusHype
Inference and Uncertainty Quantification for Noisy Matrix Completion0
Influenza Modeling Based on Massive Feature Engineering and International Flow Deconvolution0
Information-theoretic Bounds on Matrix Completion under Union of Subspaces Model0
Intelligent Reflecting Surface for Massive Device Connectivity: Joint Activity Detection and Channel Estimation0
Which Tumblr Post Should I Read Next?0
Interpretable Matrix Completion: A Discrete Optimization Approach0
Introducing the Huber mechanism for differentially private low-rank matrix completion0
Iterative missing value imputation based on feature importance0
Joint Matrix Completion and Compressed Sensing for State Estimation in Low-observable Distribution System0
Adaptively-weighted Nearest Neighbors for Matrix Completion0
k-Space Deep Learning for Reference-free EPI Ghost Correction0
L_2,1-Norm Regularized Quaternion Matrix Completion Using Sparse Representation and Quaternion QR Decomposition0
Large-Scale Low-Rank Matrix Learning with Nonconvex Regularizers0
Large-Scale Matrix Factorization with Missing Data under Additional Constraints0
Large-Scale Sparse Inverse Covariance Estimation via Thresholding and Max-Det Matrix Completion0
Latent Variable Models for Predicting File Dependencies in Large-Scale Software Development0
Learning Counterfactual Distributions via Kernel Nearest Neighbors0
Learning from Ambiguously Labeled Face Images0
Learning Iterative Reasoning through Energy Diffusion0
Learning Latent Features with Pairwise Penalties in Low-Rank Matrix Completion0
Learning Mixtures of Discrete Product Distributions using Spectral Decompositions0
Learning of Generalized Low-Rank Models: A Greedy Approach0
Learning Parameters for Weighted Matrix Completion via Empirical Estimation0
Learning Transition Operators From Sparse Space-Time Samples0
Learning Translations via Matrix Completion0
Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions0
Lifelong Matrix Completion with Sparsity-Number0
Active Feature Acquisition with Supervised Matrix Completion0
Link Discovery using Graph Feature Tracking0
Link Prediction via Matrix Completion0
Local Search Algorithms for Rank-Constrained Convex Optimization0
Log-Normal Matrix Completion for Large Scale Link Prediction0
Sum-of-squares meets square loss: Fast rates for agnostic tensor completion0
Low Permutation-rank Matrices: Structural Properties and Noisy Completion0
Simple Heuristics Yield Provable Algorithms for Masked Low-Rank Approximation0
Low-Rank Approximations of Nonseparable Panel Models0
Low-rank Bayesian matrix completion via geodesic Hamiltonian Monte Carlo on Stiefel manifolds0
Low-Rank Covariance Completion for Graph Quilting with Applications to Functional Connectivity0
SUPER-Rec: SUrrounding Position-Enhanced Representation for Recommendation0
Survey of Matrix Completion Algorithms0
Low-rank matrix completion and denoising under Poisson noise0
Low rank matrix completion and realization of graphs: results and problems0
Low Rank Matrix Completion via Robust Alternating Minimization in Nearly Linear Time0
Low Rank Matrix Completion with Exponential Family Noise0
Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence0
Low-rank matrix recovery with non-quadratic loss: projected gradient method and regularity projection oracle0
Low-Rank Modeling and Its Applications in Image Analysis0
Low-rank optimization for distance matrix completion0
Low-rank optimization with trace norm penalty0
Low Rank Quaternion Matrix Completion Based on Quaternion QR Decomposition and Sparse Regularizer0
Show:102550
← PrevPage 8 of 16Next →

No leaderboard results yet.