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 251–300 of 796 papers

TitleStatusHype
Extended Gauss-Newton and ADMM-Gauss-Newton Algorithms for Low-Rank Matrix Optimization—0
Factor Group-Sparse Regularization for Efficient Low-Rank Matrix Recovery—0
Factorization Approach for Low-complexity Matrix Completion Problems: Exponential Number of Spurious Solutions and Failure of Gradient Methods—0
Factorizing LambdaMART for cold start recommendations—0
Deep Learning Approach for Matrix Completion Using Manifold Learning—0
Deep learned SVT: Unrolling singular value thresholding to obtain better MSE—0
Autoencoder-based Graph Construction for Semi-supervised Learning—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
DeepHand: Robust Hand Pose Estimation by Completing a Matrix Imputed With Deep Features—0
A Unified Framework for Structured Low-rank Matrix Learning—0
Deep geometric matrix completion: Are we doing it right?—0
A Unified Framework for Sparse Relaxed Regularized Regression: SR3—0
A majorization-minimization algorithm for nonnegative binary matrix factorization—0
A Unified Convex Surrogate for the Schatten-p Norm—0
Decentralized Singular Value Decomposition for Large-scale Distributed Sensor Networks—0
Decentralized Frank-Wolfe Algorithm for Convex and Non-convex Problems—0
A Unified Computational and Statistical Framework for Nonconvex Low-Rank Matrix Estimation—0
Always Valid Risk Monitoring for Online Matrix Completion—0
A divide-and-conquer algorithm for binary matrix completion—0
Accelerating Permutation Testing in Voxel-wise Analysis through Subspace Tracking: A new plugin for SnPM—0
Data-driven model selection within the matrix completion method for causal panel data models—0
Data-based system representations from irregularly measured data—0
A two-dimensional decomposition approach for matrix completion through gossip—0
CUR Algorithm with Incomplete Matrix Observation—0
CUR Algorithm for Partially Observed Matrices—0
Attribute-based Explanations of Non-Linear Embeddings of High-Dimensional Data—0
AltGDmin: Alternating GD and Minimization for Partly-Decoupled (Federated) Optimization—0
Crowdsourcing with Sparsely Interacting Workers—0
Asynchronous Parallel Learning for Neural Networks and Structured Models with Dense Features—0
Covariates-Adjusted Mixed-Membership Estimation: A Novel Network Model with Optimal Guarantees—0
Covariate-Adjusted Deep Causal Learning for Heterogeneous Panel Data Models—0
Asymptotic Convergence Rate of Alternating Minimization for Rank One Matrix Completion—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
Counterfactual inference for sequential experiments—0
Convolutional Geometric Matrix Completion—0
A Sparse Interactive Model for Matrix Completion with Side Information—0
Convergence of Gradient Descent with Small Initialization for Unregularized Matrix Completion—0
Convergence Analysis for Rectangular Matrix Completion Using Burer-Monteiro Factorization and Gradient Descent—0
A Sequence-Aware Recommendation Method Based on Complex Networks—0
Contextual Bandits with Latent Confounders: An NMF Approach—0
Constructing High Frequency Economic Indicators by Imputation—0
Consistent Estimation for PCA and Sparse Regression with Oblivious Outliers—0
A Riemannian gossip approach to subspace learning on Grassmann manifold—0
A Linearized Alternating Direction Multiplier Method for Federated Matrix Completion Problems—0
A Denoising View of Matrix Completion—0
1-Bit Matrix Completion under Exact Low-Rank Constraint—0
Consistent Collective Matrix Completion under Joint Low Rank Structure—0
Conservative Stochastic Optimization with Expectation Constraints—0
Show:102550
← PrevPage 6 of 16Next →

No leaderboard results yet.