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

TitleStatusHype
New Perspectives on k-Support and Cluster Norms0
Noise-Clustered Distant Supervision for Relation Extraction: A Nonparametric Bayesian Perspective0
Noise-Tolerant Life-Long Matrix Completion via Adaptive Sampling0
Noisy Inductive Matrix Completion Under Sparse Factor Models0
Noisy Matrix Completion under Sparse Factor Models0
Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization0
Noisy Tensor Completion via the Sum-of-Squares Hierarchy0
Nonconvex Federated Learning on Compact Smooth Submanifolds With Heterogeneous Data0
Non-Convex Matrix Completion Against a Semi-Random Adversary0
Nonconvex Matrix Completion with Linearly Parameterized Factors0
Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview0
Non-Convex Optimizations for Machine Learning with Theoretical Guarantee: Robust Matrix Completion and Neural Network Learning0
Nonconvex Rectangular Matrix Completion via Gradient Descent without _2, Regularization0
Nonlinear Inductive Matrix Completion based on One-layer Neural Networks0
Nonlinear Traffic Prediction as a Matrix Completion Problem with Ensemble Learning0
Patch Tracking-based Streaming Tensor Ring Completion for Visual Data Recovery0
Non-Local Robust Quaternion Matrix Completion for Color Images and Videos Inpainting0
Nonparametric Estimation of Low Rank Matrix Valued Function0
Nonparametric Trace Regression in High Dimensions via Sign Series Representation0
Norm-Bounded Low-Rank Adaptation0
No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysis0
Notes on Low-rank Matrix Factorization0
Novel Structured Low-rank algorithm to recover spatially smooth exponential image time series0
Nuclear norm penalization and optimal rates for noisy low rank matrix completion0
Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion0
Ocean Reverberation Suppression via Matrix Completion with Sensor Failure0
On adaptivity and minimax optimality of two-sided nearest neighbors0
On Asymptotic Linear Convergence of Projected Gradient Descent for Constrained Least Squares0
On Deterministic Sampling Patterns for Robust Low-Rank Matrix Completion0
One-Bit Matrix Completion with Differential Privacy0
One-sided Matrix Completion from Two Observations Per Row0
Online Algorithms for Factorization-Based Structure from Motion0
Online high rank matrix completion0
Online Low Rank Matrix Completion0
Online Matrix Completion: A Collaborative Approach with Hott Items0
Online Matrix Completion and Online Robust PCA0
Online Matrix Completion Through Nuclear Norm Regularisation0
Online Matrix Completion with Side Information0
Online Optimization for Large-Scale Max-Norm Regularization0
Online Optimization for Max-Norm Regularization0
Online Policy Learning and Inference by Matrix Completion0
Online Variational Bayesian Subspace Filtering with Applications0
On Tensor Completion via Nuclear Norm Minimization0
On the Convergence of Stochastic Gradient Descent with Low-Rank Projections for Convex Low-Rank Matrix Problems0
On the convex geometry of blind deconvolution and matrix completion0
On the Fundamental Limits of Matrix Completion: Leveraging Hierarchical Similarity Graphs0
On the Optimality of Nuclear-norm-based Matrix Completion for Problems with Smooth Non-linear Structure0
Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?0
On the Power of Adaptivity in Matrix Completion and Approximation0
On the Power of Truncated SVD for General High-rank Matrix Estimation Problems0
Show:102550
← PrevPage 12 of 16Next →

No leaderboard results yet.