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

TitleStatusHype
New Hardness Results for Low-Rank Matrix Completion—0
Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust RecommendationCode0
N^2: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix CompletionCode0
Covariate-Adjusted Deep Causal Learning for Heterogeneous Panel Data Models—0
Optimal Transport with Heterogeneously Missing Data—0
RGNMR: A Gauss-Newton method for robust matrix completion with theoretical guarantees—0
Adaptively-weighted Nearest Neighbors for Matrix CompletionCode0
Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent—0
AltGDmin: Alternating GD and Minimization for Partly-Decoupled (Federated) Optimization—0
Truncated Matrix Completion - An Empirical Study—0
Computational Efficient Informative Nonignorable Matrix Completion: A Row- and Column-Wise Matrix U-Statistic Pseudo-Likelihood Approach—0
An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU functionCode0
Depth-Aided Color Image Inpainting in Quaternion Domain—0
Fast Two-photon Microscopy by Neuroimaging with Oblong Random Acquisition (NORA)—0
A Linearized Alternating Direction Multiplier Method for Federated Matrix Completion Problems—0
Interference-Aware Edge Runtime Prediction with Conformal Matrix CompletionCode0
Optimal Transfer Learning for Missing Not-at-Random Matrix Completion—0
Recommendations from Sparse Comparison Data: Provably Fast Convergence for Nonconvex Matrix Factorization—0
A Geometric Approach to Personalized Recommendation with Set-Theoretic Constraints Using Box Embeddings—0
Matrix Completion with Graph Information: A Provable Nonconvex Optimization Approach—0
Covariates-Adjusted Mixed-Membership Estimation: A Novel Network Model with Optimal Guarantees—0
Efficient Over-parameterized Matrix Sensing from Noisy Measurements via Alternating Preconditioned Gradient DescentCode0
Norm-Bounded Low-Rank Adaptation—0
Faster Convergence of Riemannian Stochastic Gradient Descent with Increasing Batch Size—0
Matrix Completion in Group Testing: Bounds and Simulations—0
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 1 of 16Next →

No leaderboard results yet.