SOTAVerified

Low-Rank Matrix Completion

Low-Rank Matrix Completion is an important problem with several applications in areas such as recommendation systems, sketching, and quantum tomography. The goal in matrix completion is to recover a low rank matrix, given a small number of entries of the matrix.

Source: Universal Matrix Completion

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 101–150 of 158 papers

TitleStatusHype
Nearly Optimal Robust Matrix Completion—0
Reflection Removal Using Low-Rank Matrix Completion—0
A Riemannian gossip approach to subspace learning on Grassmann manifold—0
Recovery of damped exponentials using structured low rank matrix completion—0
Novel Structured Low-rank algorithm to recover spatially smooth exponential image time series—0
Algebraic Variety Models for High-Rank Matrix CompletionCode0
Riemannian stochastic quasi-Newton algorithm with variance reduction and its convergence analysis—0
Accelerating Permutation Testing in Voxel-wise Analysis through Subspace Tracking: A new plugin for SnPM—0
Riemannian stochastic variance reduced gradient algorithm with retraction and vector transportCode0
Solving Uncalibrated Photometric Stereo Using Fewer Images by Jointly Optimizing Low-rank Matrix Completion and Integrability—0
Modelling Competitive Sports: Bradley-Terry-Élő Models for Supervised and On-Line Learning of Paired Competition Outcomes—0
High-Rank Matrix Completion and Clustering under Self-Expressive Models—0
Asynchronous Parallel Learning for Neural Networks and Structured Models with Dense Features—0
Low-tubal-rank Tensor Completion using Alternating Minimization—0
Nearly-optimal Robust Matrix Completion—0
Riemannian stochastic variance reduced gradient on Grassmann manifoldCode0
Depth Image Inpainting: Improving Low Rank Matrix Completion with Low Gradient RegularizationCode0
Scaled stochastic gradient descent for low-rank matrix completion—0
Secrets of Matrix Factorization: Approximations, Numerics, Manifold Optimization and Random Restarts—0
Collaborative Filtering with Graph Information: Consistency and Scalable MethodsCode0
An Extended Frank-Wolfe Method with "In-Face" Directions, and its Application to Low-Rank Matrix Completion—0
Symmetric Tensor Completion from Multilinear Entries and Learning Product Mixtures over the Hypercube—0
A New Retraction for Accelerating the Riemannian Three-Factor Low-Rank Matrix Completion Algorithm—0
Relative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion—0
Relaxed Leverage Sampling for Low-rank Matrix Completion—0
Online Matrix Completion and Online Robust PCA—0
A Characterization of Deterministic Sampling Patterns for Low-Rank Matrix Completion—0
Low Rank Matrix Completion with Exponential Family Noise—0
Bayesian Learning for Low-Rank matrix reconstruction—0
Adjusting Leverage Scores by Row Weighting: A Practical Approach to Coherent Matrix Completion—0
Probabilistic low-rank matrix completion on finite alphabets—0
Errata: Distant Supervision for Relation Extraction with Matrix Completion—0
Ad Hoc Microphone Array Calibration: Euclidean Distance Matrix Completion Algorithm and Theoretical Guarantees—0
Algebraic-Combinatorial Methods for Low-Rank Matrix Completion with Application to Athletic Performance Prediction—0
Distant Supervision for Relation Extraction with Matrix CompletionCode0
Depth Enhancement via Low-rank Matrix Completion—0
Advancing Matrix Completion by Modeling Extra Structures beyond Low-Rankness—0
Orthogonal Rank-One Matrix Pursuit for Low Rank Matrix CompletionCode0
Universal Matrix Completion—0
Phase transitions and sample complexity in Bayes-optimal matrix factorization—0
Probabilistic Low-Rank Matrix Completion with Adaptive Spectral Regularization Algorithms—0
Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low-Rank Matrix Completion—0
Unsupervised Spectral Learning of WCFG as Low-rank Matrix Completion—0
Practical Matrix Completion and Corruption Recovery using Proximal Alternating Robust Subspace Minimization—0
Manopt, a Matlab toolbox for optimization on manifolds—0
R3MC: A Riemannian three-factor algorithm for low-rank matrix completion—0
Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion—0
Coherence and sufficient sampling densities for reconstruction in compressed sensing—0
Scaled Gradients on Grassmann Manifolds for Matrix Completion—0
The Algebraic Combinatorial Approach for Low-Rank Matrix Completion—0
Show:102550
← PrevPage 3 of 4Next →

No leaderboard results yet.