Incoherence-Optimal Matrix Completion
From MaRDI portal
Publication:2978655
DOI10.1109/TIT.2015.2415195zbMath1359.15022arXiv1310.0154OpenAlexW2171046470MaRDI QIDQ2978655
Publication date: 28 April 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.0154
Analysis of algorithms and problem complexity (68Q25) Numerical linear algebra (65F99) Matrix completion problems (15A83)
Related Items (26)
Tensor clustering with planted structures: statistical optimality and computational limits ⋮ Streaming Principal Component Analysis From Incomplete Data ⋮ Computational barriers to estimation from low-degree polynomials ⋮ Unnamed Item ⋮ Low rank matrix recovery from rank one measurements ⋮ Guarantees of Riemannian optimization for low rank matrix completion ⋮ Tensor completion by multi-rank via unitary transformation ⋮ Unnamed Item ⋮ Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution ⋮ Iterative tensor eigen rank minimization for low-rank tensor completion ⋮ Matrix completion with nonconvex regularization: spectral operators and scalable algorithms ⋮ Importance sampling in signal processing applications ⋮ Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization ⋮ Enhancing matrix completion using a modified second-order total variation ⋮ Exact matrix completion based on low rank Hankel structure in the Fourier domain ⋮ The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs ⋮ On the Simplicity and Conditioning of Low Rank Semidefinite Programs ⋮ An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation ⋮ Optimal testing for planted satisfiability problems ⋮ Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach ⋮ Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data ⋮ Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence ⋮ Robust non-parametric regression via incoherent subspace projections ⋮ Efficient Matrix Sensing Using Rank-1 Gaussian Measurements ⋮ Unnamed Item ⋮ Proof methods for robust low-rank matrix recovery
This page was built for publication: Incoherence-Optimal Matrix Completion
