Matrix Completion From a Few Entries

Recommendations

Matrix completion from noisy entries
Matrix completion problems
Some matrix completion problems
Matrix completion problems with arbitrary locations of prescribed entries
Matrix completion via minimizing an approximate rank
Some empirical advances in matrix completion
A simpler approach to matrix completion
Matrix Completion under Low-Rank Missing Mechanism
A note on matrix completion problems
On a Class of Matrix Completion Problems

Cited in

(only showing first 100 items - show all)

Finding one community in a sparse graph
Guarantees of Riemannian optimization for low rank matrix completion
Deterministic tensor completion with hypergraph expanders
An optimal-storage approach to semidefinite programming using approximate complementarity
An alternating direction method with continuation for nonconvex low rank minimization
Universal Features for High-Dimensional Learning and Inference
Covariate-assisted matrix completion with multiple structural breaks
Finding low-rank solutions of sparse linear matrix inequalities using convex optimization
Tensor methods for nonlinear matrix completion
Spectral Compressed Sensing via Projected Gradient Descent
Linear total variation approximate regularized nuclear norm optimization for matrix completion
Enhancing matrix completion using a modified second-order total variation
scientific article; zbMATH DE number 7049740 (Why is no real title available?)
Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval
A multi-stage convex relaxation approach to noisy structured low-rank matrix recovery
A non-convex algorithm framework based on DC programming and DCA for matrix completion
Matrix Completion Methods for Causal Panel Data Models
Typical and generic ranks in matrix completion
Matrix denoising for weighted loss functions and heterogeneous signals
Guarantees of Riemannian optimization for low rank matrix recovery
Conformal symplectic and relativistic optimization
Toeplitz matrix completion via a low-rank approximation algorithm
First-order methods almost always avoid strict saddle points
Flexible low-rank statistical modeling with missing data and side information
On polynomial time methods for exact low-rank tensor completion
Matrix completion from noisy entries
On the equivalence between low-rank matrix completion and tensor rank
Robust bilinear factorization with missing and grossly corrupted observations
A p-spherical section property for matrix Schatten-p quasi-norm minimization
Stable rank-one matrix completion is solved by the level $2$ Lasserre relaxation
Isolated calmness of solution mappings and exact recovery conditions for nuclear norm optimization problems
Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
A penalty method for rank minimization problems in symmetric matrices
Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
scientific article; zbMATH DE number 6982912 (Why is no real title available?)
Universal latent space model fitting for large networks with edge covariates
Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
scientific article; zbMATH DE number 7164697 (Why is no real title available?)
Learning Markov models via low-rank optimization
A proximal multiplier method for separable convex minimization
Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization
A mean value algorithm for Toeplitz matrix completion
A nonmonotone alternating updating method for a class of matrix factorization problems
Riemannian preconditioning
Matrix completion under interval uncertainty
Low-rank approximation and completion of positive tensors
Fundamental limits of weak recovery with applications to phase retrieval
Entrywise eigenvector analysis of random matrices with low expected rank
Sharp restricted isometry bounds for the inexistence of spurious local minima in nonconvex matrix recovery
Spectral norm bounds for block Markov chain random matrices
A geometric analysis of phase retrieval
Rank $2r$ Iterative Least Squares: Efficient Recovery of Ill-Conditioned Low Rank Matrices from Few Entries
Parallel stochastic gradient algorithms for large-scale matrix completion
Minimum n-rank approximation via iterative hard thresholding
Normal approximation and confidence region of singular subspaces
A nonlinear matrix decomposition for mining the zeros of sparse data
Role of sparsity and structure in the optimization landscape of non-convex matrix sensing
Tight risk bound for high dimensional time series completion
Equivalent Lipschitz surrogates for zero-norm and rank optimization problems
Dynamic assortment personalization in high dimensions
Modularity Maximization for Graphons
Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method
Matrix completion from a computational statistics perspective
Non-convex matrix completion and related problems via strong duality
Matrix completion and related problems via strong duality
Riemannian gradient descent methods for graph-regularized matrix completion
Convergence of projected Landweber iteration for matrix rank minimization
GNMR: a provable one-line algorithm for low rank matrix recovery
Elastic-net regularization for low-rank matrix recovery
Efficient matrix sensing using rank-1 Gaussian measurements
Rapid, robust, and reliable blind deconvolution via nonconvex optimization
Analytical convergence regions of accelerated gradient descent in nonconvex optimization under regularity condition
Ranking recovery from limited pairwise comparisons using low-rank matrix completion
Global optimality condition and fixed point continuation algorithm for non-Lipschitz _p regularized matrix minimization
Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition
Color image inpainting based on low-rank quaternion matrix factorization
A gradient system for low rank matrix completion
Matrix completion with noisy entries and outliers
Learning from comparisons and choices
Linear models based on noisy data and the Frisch scheme
Matrix estimation, latent variable model and collaborative filtering
Inference for low-rank models
Subspace estimation from unbalanced and incomplete data matrices: ${\ell_{2,\infty}}$ statistical guarantees
Sparse random tensors: concentration, regularization and applications
Empirical Bayes Poisson matrix completion
An ADMM-factorization algorithm for low rank matrix completion
A graphical approach to the analysis of matrix completion
Two relaxation methods for rank minimization problems
An efficient method for convex constrained rank minimization problems based on DC programming
Tractability from overparametrization: the example of the negative perceptron
Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
An equivalence between critical points for rank constraints versus low-rank factorizations
Robust PCA by manifold optimization
Robust recovery of Robinson property in $L^p$-graphons: a cut-norm approach
Low rank matrix completion by alternating steepest descent methods
On the second eigenvalue of random bipartite biregular graphs
Community detection with dependent connectivity
Seismic data reconstruction via weighted nuclear-norm minimization
Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization

This page was built for publication: Matrix Completion From a Few Entries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281473)