Matrix completion from noisy entries

Recommendations

Matrix completion with noisy entries and outliers
Matrix Completion From a Few Entries
Noisy Matrix Completion Under Sparse Factor Models
Inference and uncertainty quantification for noisy matrix completion
Matrix completion problems
Matrix completion with column outliers and sparse noise
Matrix completion problems with arbitrary locations of prescribed entries
Noisy low-rank matrix completion with general sampling distribution
Matrix completion with sparse measurement errors

Cited in

(only showing first 100 items - show all)

Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations
Double instrumental variable estimation of interaction models with big data
Random perturbation of low rank matrices: improving classical bounds
Adaptive confidence sets for matrix completion
Noise-tolerance matrix completion for location recommendation
Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
Compressed sensing and matrix completion with constant proportion of corruptions
Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
Non-asymptotic approach to varying coefficient model
Second order accurate distributed eigenvector computation for extremely large matrices
Rank penalized estimators for high-dimensional matrices
Convex low rank approximation
Robust high-dimensional factor models with applications to statistical machine learning
Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees
Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
On relaxed greedy randomized iterative methods for the solution of factorized linear systems
On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint
Proof methods for robust low-rank matrix recovery
An optimal statistical and computational framework for generalized tensor estimation
Heteroskedastic PCA: algorithm, optimality, and applications
Role of sparsity and structure in the optimization landscape of non-convex matrix sensing
Tight risk bound for high dimensional time series completion
Noisy tensor completion via the sum-of-squares hierarchy
Optimal prediction in the linearly transformed spiked model
An alternating minimization method for matrix completion problems
Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution
Matrix completion with nonconvex regularization: spectral operators and scalable algorithms
Entrywise eigenvector analysis of random matrices with low expected rank
Lower bounds for finding stationary points I
Stable rank-one matrix completion is solved by the level \(2\) Lasserre relaxation
Bayesian matrix completion approach to causal inference with panel data
Robust PCA and subspace tracking from incomplete observations using \(\ell _0\)-surrogates
Two Newton methods on the manifold of fixed-rank matrices endowed with Riemannian quotient geometries
Fixed-rank matrix factorizations and Riemannian low-rank optimization
Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach
Majorized proximal alternating imputation for regularized rank constrained matrix completion
Spectral method and regularized MLE are both optimal for top-\(K\) ranking
Structured matrix estimation and completion
Matrix estimation by universal singular value thresholding
Low-rank matrix completion via preconditioned optimization on the Grassmann manifold
\(S_{1/2}\) regularization methods and fixed point algorithms for affine rank minimization problems
Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction
Alternating proximal gradient method for convex minimization
Empirical Bayes matrix completion
Asymptotic equivalence of quantum state tomography and noisy matrix completion
Noisy low-rank matrix completion with general sampling distribution
Optspace
Collaborative filtering with information-rich and~information-sparse entities
Robust principal component pursuit via inexact alternating minimization on matrix manifolds
Decentralized and privacy-preserving low-rank matrix completion
Exact matrix completion via convex optimization
Statistically optimal and computationally efficient low rank tensor completion from noisy entries
Matrix completion with sparse measurement errors
Sharp variable selection of a sparse submatrix in a high-dimensional noisy matrix
Compressive Sensing
Linear models based on noisy data and the Frisch scheme
Probabilistic low-rank matrix completion from quantized measurements
Guarantees of Riemannian optimization for low rank matrix recovery
Optimal large-scale quantum state tomography with Pauli measurements
Riemannian optimization for high-dimensional tensor completion
Online collaborative filtering on graphs
Distributed user profiling via spectral methods
Deterministic algorithms for matrix completion
On the nuclear norm and the singular value decomposition of tensors
Matrix completion via max-norm constrained optimization
A rank-corrected procedure for matrix completion with fixed basis coefficients
Iterative Methods for Solving Factorized Linear Systems
A graphical approach to the analysis of matrix completion
Low-rank and sparse dictionary learning
Low-rank transfer learning
Transfer learning in heterogeneous collaborative filtering domains
High-dimensional covariance matrix estimation with missing observations
Low-rank tensor completion by Riemannian optimization
Sampling, denoising and compression of matrices by coherent matrix organization
Learning from comparisons and choices
An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
Using side information to reliably learn low-rank matrices from missing and corrupted observations
scientific article; zbMATH DE number 7049740 (Why is no real title available?)
Matrix completion with noisy entries and outliers
Gradient descent only converges to minimizers: non-isolated critical points and invariant regions
Adapting regularized low-rank models for parallel architectures
Universal latent space model fitting for large networks with edge covariates
A modified augmented Lagrange multiplier algorithm for Toeplitz matrix completion
Iterative Collaborative Filtering for Sparse Matrix Estimation
Nonconvex Low-Rank Tensor Completion from Noisy Data
Bayesian singular value regularization via a cumulative shrinkage process
Noisy matrix completion: understanding statistical guarantees for convex relaxation via nonconvex optimization
Matrix estimation, latent variable model and collaborative filtering
Krylov methods for low-rank regularization
Uniform Bounds for Invariant Subspace Perturbations
Low-rank representation of tensor network operators with long-range pairwise interactions
Matrix completion based on Gaussian parameterized belief propagation
scientific article; zbMATH DE number 7164697 (Why is no real title available?)
Low permutation-rank matrices: structural properties and noisy completion
Non-convex matrix completion and related problems via strong duality
Sharp restricted isometry bounds for the inexistence of spurious local minima in nonconvex matrix recovery
Model-free nonconvex matrix completion: local minima analysis and applications in memory-efficient kernel PCA
Matrix Completion From a Few Entries
Convergence of fixed-point continuation algorithms for matrix rank minimization
A simpler approach to matrix completion

This page was built for publication: Matrix completion from noisy entries

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