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

Showing 101150 of 158 papers

TitleStatusHype
Matrix Completion from General Deterministic Sampling Patterns0
Matrix Completion from Power-Law Distributed Samples0
Matrix Completion in Almost-Verification Time0
Modelling Competitive Sports: Bradley-Terry-Élő Models for Supervised and On-Line Learning of Paired Competition Outcomes0
Nearly-optimal Robust Matrix Completion0
Nearly Optimal Robust Matrix Completion0
New Hardness Results for Low-Rank Matrix Completion0
Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization0
Nonconvex Federated Learning on Compact Smooth Submanifolds With Heterogeneous Data0
Non-Convex Optimizations for Machine Learning with Theoretical Guarantee: Robust Matrix Completion and Neural Network Learning0
Norm-Bounded Low-Rank Adaptation0
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
On Deterministic Sampling Patterns for Robust Low-Rank Matrix Completion0
Online Low Rank Matrix Completion0
Online Matrix Completion: A Collaborative Approach with Hott Items0
Online Matrix Completion and Online Robust PCA0
Disjunctive Branch-And-Bound for Certifiably Optimal Low-Rank Matrix Completion0
Optimum Codesign for Image Denoising Between Type-2 Fuzzy Identifier and Matrix Completion Denoiser0
Phase transitions and sample complexity in Bayes-optimal matrix factorization0
Practical Matrix Completion and Corruption Recovery using Proximal Alternating Robust Subspace Minimization0
Probabilistic low-rank matrix completion on finite alphabets0
Probabilistic Low-Rank Matrix Completion with Adaptive Spectral Regularization Algorithms0
R3MC: A Riemannian three-factor algorithm for low-rank matrix completion0
Ranking Recovery from Limited Comparisons using Low-Rank Matrix Completion0
Reconstruction of Fragmented Trajectories of Collective Motion using Hadamard Deep Autoencoders0
Recovery of damped exponentials using structured low rank matrix completion0
Reflection Removal Using Low-Rank Matrix Completion0
Relaxed Leverage Sampling for Low-rank Matrix Completion0
Reproducing Kernel Hilbert Space, Mercer's Theorem, Eigenfunctions, Nyström Method, and Use of Kernels in Machine Learning: Tutorial and Survey0
Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees0
Riemannian Stochastic Proximal Gradient Methods for Nonsmooth Optimization over the Stiefel Manifold0
Riemannian stochastic quasi-Newton algorithm with variance reduction and its convergence analysis0
Robust Low-rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method0
Robust Low-Rank Matrix Completion via a New Sparsity-Inducing Regularizer0
Robust Matrix Completion with Heavy-tailed Noise0
RTRMC: A Riemannian trust-region method for low-rank matrix completion0
Scaled Gradients on Grassmann Manifolds for Matrix Completion0
Scaled stochastic gradient descent for low-rank matrix completion0
Secrets of Matrix Factorization: Approximations, Numerics, Manifold Optimization and Random Restarts0
Efficient Compression of Overparameterized Deep Models through Low-Dimensional Learning DynamicsCode0
Guaranteed Rank Minimization via Singular Value ProjectionCode0
Depth Image Inpainting: Improving Low Rank Matrix Completion with Low Gradient RegularizationCode0
Riemannian stochastic variance reduced gradient algorithm with retraction and vector transportCode0
Efficient and Robust Freeway Traffic Speed Estimation under Oblique Grid using Vehicle Trajectory DataCode0
Algebraic Variety Models for High-Rank Matrix CompletionCode0
Mixed Membership Graph Clustering via Systematic Edge QueryCode0
A Gradient Descent Algorithm on the Grassman Manifold for Matrix CompletionCode0
Adaptive Matrix Completion for the Users and the Items in TailCode0
Show:102550
← PrevPage 3 of 4Next →

No leaderboard results yet.