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

TitleStatusHype
Interference-Aware Edge Runtime Prediction with Conformal Matrix CompletionCode0
Optimal Transfer Learning for Missing Not-at-Random Matrix Completion0
Recommendations from Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization0
A Geometric Approach to Personalized Recommendation with Set-Theoretic Constraints Using Box Embeddings0
Matrix Completion with Graph Information: A Provable Nonconvex Optimization Approach0
Covariates-Adjusted Mixed-Membership Estimation: A Novel Network Model with Optimal Guarantees0
Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient DescentCode0
Norm-Bounded Low-Rank Adaptation0
Faster Convergence of Riemannian Stochastic Gradient Descent with Increasing Batch Size0
Matrix Completion in Group Testing: Bounds and Simulations0
Robust Egoistic Rigid Body Localization0
Low rank matrix completion and realization of graphs: results and problems0
Improved Approximation Algorithms for Low-Rank Problems Using Semidefinite Optimization0
Deeply Learned Robust Matrix Completion for Large-scale Low-rank Data Recovery0
Robust Matrix Completion for Discrete Rating-Scale DataCode0
Matrix Completion via Residual Spectral Matching0
Representational Transfer Learning for Matrix Completion0
A privacy-preserving distributed credible evidence fusion algorithm for collective decision-making0
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 Completion0
Abrupt Learning in Transformers: A Case Study on Matrix Completion0
Bayesian Collaborative Bandits with Thompson Sampling for Improved Outreach in Maternal Health Program0
Low-rank Bayesian matrix completion via geodesic Hamiltonian Monte Carlo on Stiefel manifolds0
Learning Counterfactual Distributions via Kernel Nearest NeighborsCode0
Show:102550
← PrevPage 3 of 32Next →

No leaderboard results yet.