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)

Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data
Nonconvex Low-Rank Tensor Completion from Noisy Data
Low rank matrix recovery from rank one measurements
Asymmetry helps: eigenvalue and eigenvector analyses of asymmetrically perturbed low-rank matrices
Approximate matrix completion based on cavity method
A nonconvex approach to low-rank matrix completion using convex optimization.
Recovery of low-rank matrices based on the rank null space properties
Recovering structured probability matrices
Optimal prediction in the linearly transformed spiked model
Model-free nonconvex matrix completion: local minima analysis and applications in memory-efficient kernel PCA
Iterative Collaborative Filtering for Sparse Matrix Estimation
Fast alternating linearization methods for minimizing the sum of two convex functions
Random perturbation of low rank matrices: improving classical bounds
A Riemannian gossip approach to subspace learning on Grassmann manifold
Matrix recipes for hard thresholding methods
Revisiting Landscape Analysis in Deep Neural Networks: Eliminating Decreasing Paths to Infinity
Blind deconvolution by a steepest descent algorithm on a quotient manifold
Robust principal component pursuit via inexact alternating minimization on matrix manifolds
A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
An alternating minimization method for matrix completion problems
T-product factorization based method for matrix and tensor completion problems
Heteroskedastic PCA: algorithm, optimality, and applications
Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit
The landscape of empirical risk for nonconvex losses
Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis
CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
Matrix completion and tensor rank
A two-step item bank calibration strategy based on 1-bit matrix completion for small-scale computerized adaptive testing
Applied harmonic analysis and data science. Abstracts from the workshop held April 21--26, 2024
Size biased couplings and the spectral gap for random regular graphs
Synchronization problems in computer vision with closed-form solutions
Matrix completion for cost reduction in finite element simulations under hybrid uncertainties
Detection thresholds in very sparse matrix completion
On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint
Estimation in high dimensions: a geometric perspective
Cross: efficient low-rank tensor completion
High-dimensional estimation with geometric constraints
An introduction to a class of matrix cone programming
Adaptive estimation of the sparsity in the Gaussian vector model
Proof methods for robust low-rank matrix recovery
Median-truncated gradient descent: a robust and scalable nonconvex approach for signal estimation
Bayesian uncertainty quantification for low-rank matrix completion
Riemannian conjugate gradient descent method for fixed multi rank third-order tensor completion
Mixed norm regularized models for low-rank tensor completion
Inference for heteroskedastic PCA with missing data
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

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)