Pages that link to "Item:Q2978655"

The following pages link to Incoherence-Optimal Matrix Completion (Q2978655):

Displaying 27 items.

• Low rank matrix recovery from rank one measurements (Q347516) (← links)
• Enhancing matrix completion using a modified second-order total variation (Q1727032) (← links)
• Exact matrix completion based on low rank Hankel structure in the Fourier domain (Q1979919) (← links)
• Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data (Q2054540) (← links)
• Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence (Q2067681) (← links)
• Robust non-parametric regression via incoherent subspace projections (Q2071515) (← links)
• Proof methods for robust low-rank matrix recovery (Q2106469) (← links)
• Tensor clustering with planted structures: statistical optimality and computational limits (Q2119244) (← links)
• Computational barriers to estimation from low-degree polynomials (Q2149001) (← links)
• Guarantees of Riemannian optimization for low rank matrix completion (Q2176515) (← links)
• Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution (Q2189396) (← links)
• Matrix completion with nonconvex regularization: spectral operators and scalable algorithms (Q2195855) (← links)
• Optimal testing for planted satisfiability problems (Q2259537) (← links)
• Recovery of simultaneous low rank and two-way sparse coefficient matrices, a nonconvex approach (Q2286374) (← links)
• Efficient Matrix Sensing Using Rank-1 Gaussian Measurements (Q2835614) (← links)
• An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation (Q4558538) (← links)
• (Q4993268) (← links)
• Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization (Q5131966) (← links)
• The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs (Q5157395) (← links)
• (Q5159422) (← links)
• On the Simplicity and Conditioning of Low Rank Semidefinite Programs (Q5162653) (← links)
• Streaming Principal Component Analysis From Incomplete Data (Q5214169) (← links)
• (Q5214187) (← links)
• Importance sampling in signal processing applications (Q5358731) (← links)
• Tensor completion by multi-rank via unitary transformation (Q6042617) (← links)
• Iterative tensor eigen rank minimization for low-rank tensor completion (Q6125187) (← links)
• Cryptography from planted graphs: security with logarithmic-size messages (Q6581792) (← links)