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 51–100 of 796 papers

TitleStatusHype
A Block Lanczos with Warm Start Technique for Accelerating Nuclear Norm Minimization Algorithms—0
A new accelerated gradient method inspired by continuous-time perspective—0
A New Retraction for Accelerating the Riemannian Three-Factor Low-Rank Matrix Completion Algorithm—0
A New Theory for Matrix Completion—0
Adversarial Robust Low Rank Matrix Estimation: Compressed Sensing and Matrix Completion—0
Low-rank matrix completion theory via Plucker coordinates—0
An Extended Frank-Wolfe Method with "In-Face" Directions, and its Application to Low-Rank Matrix Completion—0
A Fast Matrix-Completion-Based Approach for Recommendation Systems—0
A framework to generate sparsity-inducing regularizers for enhanced low-rank matrix completion—0
Annotation Projection-based Representation Learning for Cross-lingual Dependency Parsing—0
A Non-convex One-Pass Framework for Generalized Factorization Machine and Rank-One Matrix Sensing—0
A Non-monotone Alternating Updating Method for A Class of Matrix Factorization Problems—0
Blind Regression: Nonparametric Regression for Latent Variable Models via Collaborative Filtering—0
Boolean Matrix Factorization and Noisy Completion via Message Passing—0
Categorical Matrix Completion—0
Convergence of the majorized PAM method with subspace correction for low-rank composite factorization model—0
A Majorization-Minimization Gauss-Newton Method for 1-Bit Matrix Completion—0
Adjusting Leverage Scores by Row Weighting: A Practical Approach to Coherent Matrix Completion—0
A divide-and-conquer algorithm for binary matrix completion—0
Always Valid Risk Monitoring for Online Matrix Completion—0
Accelerating Permutation Testing in Voxel-wise Analysis through Subspace Tracking: A new plugin for SnPM—0
PAC-Bayesian Matrix Completion with a Spectral Scaled Student Prior—0
AltGDmin: Alternating GD and Minimization for Partly-Decoupled (Federated) Optimization—0
Alternating Iteratively Reweighted Minimization Algorithms for Low-Rank Matrix Factorization—0
Ad Hoc Microphone Array Calibration: Euclidean Distance Matrix Completion Algorithm and Theoretical Guarantees—0
A Linearized Alternating Direction Multiplier Method for Federated Matrix Completion Problems—0
A Riemannian gossip approach to subspace learning on Grassmann manifold—0
A Denoising View of Matrix Completion—0
1-Bit Matrix Completion under Exact Low-Rank Constraint—0
Multi-source Learning via Completion of Block-wise Overlapping Noisy Matrices—0
A Sequence-Aware Recommendation Method Based on Complex Networks—0
A Sparse Interactive Model for Matrix Completion with Side Information—0
Asymptotic Convergence Rate of Alternating Minimization for Rank One Matrix Completion—0
Asynchronous Parallel Learning for Neural Networks and Structured Models with Dense Features—0
Attribute-based Explanations of Non-Linear Embeddings of High-Dimensional Data—0
A two-dimensional decomposition approach for matrix completion through gossip—0
A Unified Computational and Statistical Framework for Nonconvex Low-Rank Matrix Estimation—0
A Unified Convex Surrogate for the Schatten-p Norm—0
A Unified Framework for Sparse Relaxed Regularized Regression: SR3—0
A majorization-minimization algorithm for nonnegative binary matrix factorization—0
Autoencoder-based Graph Construction for Semi-supervised Learning—0
Multi-target prediction for dummies using two-branch neural networks—0
Automotive Radar Sensing with Sparse Linear Arrays Using One-Bit Hankel Matrix Completion—0
Background Subtraction via Fast Robust Matrix Completion—0
Balancing Accuracy and Diversity in Recommendations using Matrix Completion Framework—0
A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion—0
Basis Pursuit Denoise with Nonsmooth Constraints—0
Bayesian Collaborative Bandits with Thompson Sampling for Improved Outreach in Maternal Health Program—0
Amplify Graph Learning for Recommendation via Sparsity Completion—0
A Riemannian gossip approach to decentralized matrix completion—0
Show:102550
← PrevPage 2 of 16Next →

No leaderboard results yet.